Sciweavers

APAL
2004
84views more  APAL 2004»
13 years 4 months ago
The Kolmogorov complexity of random reals
We investigate the initial segment complexity of random reals. Let K( ) denote pre
Liang Yu, Decheng Ding, Rodney G. Downey
APAL
2004
78views more  APAL 2004»
13 years 4 months ago
Ternary relations and relevant semantics
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Robert K. Meyer
APAL
2004
67views more  APAL 2004»
13 years 4 months ago
Algorithmic uses of the Feferman-Vaught Theorem
The classical Feferman
Johann A. Makowsky
APAL
2004
84views more  APAL 2004»
13 years 4 months ago
Finite, integral, and finite-dimensional relation algebras: a brief history
Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The concept of integrality arose naturally early in the history of the subject, and s...
Roger D. Maddux
APAL
2004
87views more  APAL 2004»
13 years 4 months ago
Expressive equivalence of least and inflationary fixed-point logic
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
Stephan Kreutzer
APAL
2004
73views more  APAL 2004»
13 years 4 months ago
Shrinking games and local formulas
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...
H. Jerome Keisler, Wafik Boulos Lotfallah
APAL
2004
105views more  APAL 2004»
13 years 4 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
APAL
2004
75views more  APAL 2004»
13 years 4 months ago
An intensional fixed point theory over first order arithmetic
The purpose of this article is to present a new theory IPA() for fixed points over arithmetic which allows the building up of fixed points in a very nested and entangled way. But ...
Gerhard Jäger
APAL
2004
81views more  APAL 2004»
13 years 4 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
APAL
2004
91views more  APAL 2004»
13 years 4 months ago
First-order intensional logic
First-order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently several se...
Melvin Fitting