Sciweavers

APAL
2005
83views more  APAL 2005»
13 years 11 months ago
Reflections on reflections in explicit mathematics
We give a broad discussion of reflection principles in explicit mathematics, thereby addressing various kinds of universe existence principles. The proof-theoretic strength of the...
Gerhard Jäger, Thomas Strahm
APAL
2005
57views more  APAL 2005»
13 years 11 months ago
Enumerations in computable structure theory
Sergei S. Goncharov, Valentina S. Harizanov, Julia...
APAL
2005
67views more  APAL 2005»
13 years 11 months ago
Free abelian lattice-ordered groups
Abstract. Let n be a positive integer and FA (n) be the free abelian latticeordered group on n generators. We prove that FA (m) and FA (n) do not satisfy the same first-order sente...
Andrew M. W. Glass, Angus Macintyre, Franço...
APAL
2005
154views more  APAL 2005»
13 years 11 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
APAL
2005
87views more  APAL 2005»
13 years 11 months ago
Stability in geometric theories
The class of geometric surgical theories (which includes all o-minimal theories) is examined. The main theorem is that every stable theory that is interpretable in a geometric sur...
Jerry Gagelman
APAL
2005
78views more  APAL 2005»
13 years 11 months ago
The logic of proofs, semantically
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of se...
Melvin Fitting
APAL
2005
88views more  APAL 2005»
13 years 11 months ago
Dependence relations in computably rigid computable vector spaces
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
Rumen D. Dimitrov, Valentina S. Harizanov, Andrei ...
APAL
2005
82views more  APAL 2005»
13 years 11 months ago
Forcing indestructibility of MAD families
Let A [] be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indest...
Jörg Brendle, Shunsuke Yatabe
APAL
2005
88views more  APAL 2005»
13 years 11 months ago
Completing pseudojump operators
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
Richard Coles, Rodney G. Downey, Carl G. Jockusch ...