The following pages link to Steffen Lempp (Q218972):
Displayed 44 items.
- Jumps of nontrivial splittings of recursively enumerable sets (Q4205430) (← links)
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072) (← links)
- (Q4218120) (← links)
- Constructive models of uncountably categorical theories (Q4268931) (← links)
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 (Q4286357) (← links)
- Highness and bounding minimal pairs (Q4304785) (← links)
- (Q4325778) (← links)
- The computational complexity of torsion-freeness of finitely presented groups (Q4374809) (← links)
- Contiguity and distributivity in the enumerable Turing degrees (Q4382472) (← links)
- Trivial, strongly minimal theories are model complete after naming constants (Q4425430) (← links)
- (Q4521130) (← links)
- Embedding finite lattices into the Σ<sub>2</sub><sup>0</sup> enumeration degrees (Q4532601) (← links)
- Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (Q4596667) (← links)
- (Q4677692) (← links)
- Jumps of Minimal Degrees Below <b>0</b> ′ (Q4716667) (← links)
- THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS (Q4799377) (← links)
- A General Framework for Priority Arguments (Q4847389) (← links)
- (Q4863238) (← links)
- The undecidability of the Π<sub>4</sub>-theory for the r.e. wtt and Turing degrees (Q4876314) (← links)
- Computable categoricity versus relative computable categoricity (Q4921488) (← links)
- (Q4946096) (← links)
- A set with barely degree (Q4948537) (← links)
- On cototality and the skip operator in the enumeration degrees (Q4967303) (← links)
- The first-order theory of the computably enumerable equivalence relations in the uncountable setting (Q5028304) (← links)
- Extensions of two constructions of Ahmad (Q5061391) (← links)
- Computability and the Symmetric Difference Operator (Q5092564) (← links)
- On the order dimension of locally countable partial orderings (Q5111496) (← links)
- Lowness for effective Hausdorff dimension (Q5176257) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY (Q5251361) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
- Theory spectra and classes of theories (Q5267981) (← links)
- (Q5295696) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- Comparing DNR and WWKL (Q5311768) (← links)
- COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS (Q5316305) (← links)
- Kenneth Kunen, The Foundations of Mathematics, Studies in Logic, Mathematical Logic and Foundations, vol. 19. College Publications, London, 2009, vii + 251 pp. (Q5346697) (← links)
- (Q5494233) (← links)
- On the existence of a strong minimal pair (Q5501923) (← links)
- Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices (Q5687321) (← links)
- On Kalimullin pairs (Q5740204) (← links)
- Defining totality in the enumeration degrees (Q5741445) (← links)
- On the filter of computably enumerable supersets of an r-maximal set (Q5950713) (← links)
- MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY (Q6095978) (← links)
- Minimal covers in the Weihrauch degrees (Q6460238) (← links)