- THE COMPUTATIONAL COMPLEXITY OF TORSIONFREENESS OF FINITELY PRESENTED GROUPS
- A FINITE LATTICE WITHOUT CRITICAL TRIPLE THAT CANNOT BE EMBEDDED
- On isolating r.e. and isolated dr.e. degrees Marat Arslanov \Lambda
- JUMPS OF MINIMAL DEGREES BELOW 0 0 Rodney G. Downey, Steffen Lempp, and Richard A. Shore
- PRIORITY ARGUMENTS IN COMPUTABILITY THEORY, MODEL THEORY, AND COMPLEXITY THEORY
- THE D.R.E. DEGREES ARE NOT DENSE S. Barry Cooper
- DOWNWARD CLOSURE OF DEPTH IN COUNTABLE BOOLEAN ALGEBRAS
- Notre Dame Journal of Formal Logic Filters on computable posets
- Embedding nite lattices into the 0 enumeration degrees
- 5. Implication Chains. In order to coordinate the action of nodes working for the same (densely distributed) requirement of type 1 or 2 so that iterated limits will exist, we
- FRIEDBERG NUMBERINGS OF FAMILIES OF n-COMPUTABLY ENUMERABLE SETS
- The computable dimension of ordered abelian groups
- COMPARING NOTIONS OF RANDOMNESS BART KASTERMANS AND STEFFEN LEMPP
- ON DOWNEY'S CONJECTURE MARAT M. ARSLANOV, ISKANDER SH. KALIMULLIN,
- Randomness vs. Completeness: On the Diagonalization Strength of
- INFIMA IN THE RECURSIVELY ENUMERABLE WEAK TRUTH TABLE DEGREES
- Group theoretic properties of the group of computable automorphisms
- 5. Implication Chains. In order to coordinate the action of nodes working for the same (densely distributed) requirement of type 1 or 2 so that iterated limits will exist, we
- The Lindenbaum algebra of the theory of the class of all finite models
- THE COMPLEXITY OF THE INDEX SETS OF 0-CATEGORICAL THEORIES AND OF
- Highness and bounding minimal pairs Rodney G. Downey \Lambda
- The Decidability of the Existential Theory of the Poset of Recursively Enumerable Degrees with Jump Relations
- There is no Deep Degree Steffen Lempp
- Iterated Trees of Strategies and Priority Arguments STEFFEN LEMPP 1,3
- Contiguity and Distributivity in the Enumerable Turing Degrees ---Corrigendum
- Lecture Notes for Algebraic Reasoning
- CONSTRUCTIVE MODELS OF UNCOUNTABLY CATEGORICAL THEORIES
- THE EXISTENCE OF AN AHMAD TRIPLE ISKANDER SH. KALIMULLIN, BART KASTERMANS,
- LATTICE EMBEDDINGS INTO THE R.E. DEGREES PRESERVING 1
- INITIAL SEGMENTS OF RECURSIVE LINEAR ORDERS Klaus AmbosSpies
- An Extended Lachlan Splitting Theorem y Steffen Lempp and Sui Yuefei
- HYPERARITHMETICAL INDEX SETS IN RECURSION THEORY Steffen Lempp
- IDEALS IN COMPUTABLE RINGS yhxi qF hyxiD ippix viwD exh tyir F wsvis
- Minimal Pair Constructions and Iterated Trees of Strategies Dedicated to Anil Nerode on the occasion of his sixtieth birthday
- COMPUTABILITY-THEORETIC AND PROOF-THEORETIC ASPECTS OF PARTIAL AND LINEAR ORDERINGS
- WEAK DENSITY AND CUPPING IN THE DR.E. DEGREES S. Barry Cooper, Steffen Lempp, Philip Watson
- 2 set with barely \Sigma 0 2 degree \Lambda
- THERE IS NO PLUSCAPPING DEGREE Rodney G. Downey
- THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO
- Iterated Trees of Strategies and Priority Arguments STEFFEN LEMPP1,3
- ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
- 6. Control of Spaces. Our requirements will be of the form (j y) & (j c). If j seems to be true at a given stage of the construction, we take action to preserve the truth
- The Lindenbaum algebra of the theory of the class of all finite models
- 6. Control of Spaces. Our requirements will be of the form (j y) & (j c). If j seems to be true at a given stage of the construction, we take action to preserve the truth
- A GENERAL FRAMEWORK FOR PRIORITY ARGUMENTS Steffen Lempp and Manuel Lerman
- Minimal Pair Constructions and Iterated Trees of Strategies Dedicated to Anil Nerode on the occasion of his sixtieth birthday
- The Undecidability of the P 4 --theory for the r.e. wtt and Turing--degrees
- JUMPS OF NONTRIVIAL SPLITTINGS OF R.E. SETS Michael A. Ingrassia, Steffen Lempp
- PRIORITY ARGUMENTS IN COMPUTABILITY THEORY, MODEL THEORY, AND COMPLEXITY THEORY
- The Decidability of the Existential Theory of the Poset of Recursively Enumerable Degrees with Jump Relations
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE 0
- EMBEDDING FINITE LATTICES INTO THE COMPUTABLY ENUMERABLE DEGREES --
- DECIDABILITY AND UNDECIDABILITY IN THE ENUMERABLE TURING DEGREES
- A HIGH STRONGLY NONCAPPABLE DEGREE Steffen Lempp
- THE # 3 THEORY OF THE COMPUTABLY ENUMERABLE TURING DEGREES IS UNDECIDABLE
- We show the decidability of the existential theory of the recursively enumerable degrees in the language of Turing reducibility, Turing re
- Di erences of computably enumerable sets Ste en Lempp
- PRIORITY ARGUMENTS USING ITERATED TREES OF STRATEGIES Steffen Lempp and Manuel Lerman
- Generating Sets for the Recursively Enumerable Turing Degrees
- A DECOMPOSITION OF THE ROGERS SEMILATTICE OF A FAMILY OF D.C.E. SETS
- COMPARING DNR AND WWKL KLAUS AMBOS-SPIES, BJRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A.
- SUBSPACES OF COMPUTABLE VECTOR SPACES yhxi qF hyxiD hixs F rsgrpivhD eri wF uegrD
- LATTICE EMBEDDINGS INTO THE R.E. DEGREES PRESERVING 0 AND 1
- Contiguity and Distributivity in the Enumerable Turing Degrees \Lambda
- ON THE FILTER OF COMPUTABLY ENUMERABLE SUPERSETS OF AN RMAXIMAL SET
- Computable Categoricity of Trees of Finite Height Ste#en Lempp
- Interpolating dr. e. and REA degrees between r. Marat Arslanov \Lambda
- INFINITE VERSIONS OF SOME PROBLEMS FROM FINITE COMPLEXITY THEORY
- THE PROOF-THEORETIC STRENGTH OF THE DUSHNIK-MILLER THEOREM
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- TRIVIAL, STRONGLY MINIMAL THEORIES ARE MODEL COMPLETE AFTER NAMING CONSTANTS
- Computably Enumerable Algebras, Their Expansions, and Isomorphisms
- ON COMPUTABLE CATEGORICITY RODNEY G. DOWNEY, ASHER M. KACH, STEFFEN LEMPP,
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS NOAM GREENBERG, ASHER M. KACH, STEFFEN LEMPP, AND DANIEL D. TURETSKY
