8 search results - page 1 / 2 » apal 2011 |
APAL
2011
12 years 11 months ago
2011
We develop the theory of domination by stable types and stable weight in an arbitrary theory.
APAL
2011
12 years 11 months ago
2011
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
APAL
2011
12 years 11 months ago
2011
We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we d...
APAL
2011
12 years 11 months ago
2011
We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an ex...
APAL
2011
12 years 11 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...