Sciweavers

8 search results - page 1 / 2
» apal 2011
Sort
View
APAL
2011
13 years 1 months ago
Stable domination and weight
We develop the theory of domination by stable types and stable weight in an arbitrary theory.
Alf Onshuus, Alexander Usvyatsov
APAL
2011
13 years 1 months ago
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
Benjamin D. Miller
APAL
2011
13 years 1 months ago
New spectra of strongly minimal theories in finite languages
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...
Uri Andrews
APAL
2011
13 years 1 months ago
A sorting network in bounded arithmetic
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...
Emil Jerábek
46
Voted
APAL
2011
13 years 1 months ago
The complexity of central series in nilpotent computable groups
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...
Barbara F. Csima, Reed Solomon