Steffen Lempp - RankMe

64 papers B 1C 1Journal 61Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A jump operator on the Weihrauch degrees. Comput. Uri Andrews, Steffen Lempp, Alberto Marcone, Joseph S. Miller, Manlio Valenti
2025	J	`jnl`	Syntactic characterization of learnability of structures with mind changes. Inf. Comput. Ekaterina B. Fokina, Steffen Lempp
2024	J	`jnl`	On cupping and Ahmad Pairs. J. Symb. Log. Iskander Sh. Kalimullin, Steffen Lempp, Keng Meng Ng, Mars M. Yamaleev
2023	J	`jnl`	Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova
2023	J	`jnl`	Minimal covers in the Weihrauch degrees. CoRR Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti
2023	C	`ed.`	Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings CiE Gianluca Della Vedova, Besik Dundua, Steffen Lempp, Florin Manea
2022	J	`jnl`	Computability and the Symmetric Difference Operator. Log. J. IGPL Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber
2022	J	`jnl`	Extensions of two constructions of Ahmad. Comput. Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova
2022	J	`jnl`	On the isomorphism problem for some classes of computable algebraic structures. Arch. Math. Log. Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon
2022	J	`jnl`	The first-order theory of the computably enumerable equivalence relations in the uncountable setting. J. Log. Comput. Uri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber
2020	J	`jnl`	Computable linear Orders and Products. J. Symb. Log. Andrey N. Frolov, Steffen Lempp, Keng Meng Ng, Guohua Wu
2019	J	`jnl`	Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. Comput. Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp
2019	J	`jnl`	Reductions between types of numberings. Ann. Pure Appl. Log. Ian Herbert, Sanjay Jain, Steffen Lempp, Manat Mustafa, Frank Stephan
2018	J	`jnl`	Interval Dismantlable Lattices. Order Kira V. Adaricheva, Jennifer Hyndman, Steffen Lempp, James B. Nation
2017	J	`jnl`	Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp
2017	J	`jnl`	Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. Ann. Pure Appl. Log. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
2017	—	`conf`	Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev
2016	J	`jnl`	Kenneth Kunen, The Foundations of Mathematics, Studies in Logic, Mathematical Logic and Foundations, vol. 19. College Publications, London, 2009, vii + 251 pp. Bull. Symb. Log. Steffen Lempp
2016	J	`jnl`	On Kalimullin pairs. Comput. Mingzhong Cai, Steffen Lempp, Joseph S. Miller, Mariya Ivanova Soskova
2016	J	`jnl`	The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán
2015	J	`jnl`	Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky
2015	J	`jnl`	Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky
2015	J	`jnl`	On the existence of a strong minimal pair. J. Math. Log. George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman
2014	J	`jnl`	Lowness for effective Hausdorff dimension. J. Math. Log. Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky, Rebecca Weber
2014	J	`jnl`	Random strings and tt-degrees of Turing complete C.E. sets. Log. Methods Comput. Sci. Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller
2014	J	`jnl`	Ulrich Felgner. Das Induktions-Prinzip. Jahresbericht der Deutschen Mathematiker-Vereinigung. vol. 114, no. 1 (2012), pp. 23-45. - Ulrich Felgner. Hilbert's "Grundlagen der Geometrie" und ihre Stellung in der Geschichte der Grundlagendiskussion. Jahresbericht der Deutschen Mathematiker-Vereinigung. vol. 115, no. 3-4 (2014), pp. 185-206. Bull. Symb. Log. Steffen Lempp
2014	J	`jnl`	Universal computably Enumerable Equivalence Relations. J. Symb. Log. Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
2010	J	`jnl`	Comparing notions of randomness. Theor. Comput. Sci. Bart Kastermans, Steffen Lempp
2010	J	`jnl`	On Downey's conjecture. J. Symb. Log. Marat M. Arslanov, Iskander Sh. Kalimullin, Steffen Lempp
2010	J	`jnl`	On the Complexity of the Successivity Relation in Computable linear Orderings. J. Math. Log. Rod Downey, Steffen Lempp, Guohua Wu
2009	J	`jnl`	A decomposition of the Rogers semilattice of a family of d.c.e. sets. J. Symb. Log. Serikzhan A. Badaev, Steffen Lempp
2009	J	`jnl`	On computable self-embeddings of computable linear orderings. J. Symb. Log. Rodney G. Downey, Bart Kastermans, Steffen Lempp
2009	J	`jnl`	Stability and posets. J. Symb. Log. Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
2006	J	`jnl`	Filters on Computable Posets. Notre Dame J. Formal Log. Steffen Lempp, Carl Mummert
2005	J	`jnl`	Computable categoricity of trees of finite height. J. Symb. Log. Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon
2005	J	`jnl`	Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
2005	J	`jnl`	On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. Steffen Lempp, Theodore A. Slaman, Andrea Sorbi
2004	J	`jnl`	Comparing DNR and WWKL. J. Symb. Log. Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
2002	J	`jnl`	Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. Rodney G. Downey, Steffen Lempp
2002	J	`jnl`	Embedding Finite Lattices into the Sigma J. Symb. Log. Steffen Lempp, Andrea Sorbi
2002	J	`jnl`	Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order. Order Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon
2002	J	`jnl`	The Lindenbaum Algebra of the Theory of the class of All finite Models. J. Math. Log. Steffen Lempp, Mikhail G. Peretyat'kin, Reed Solomon
2001	J	`jnl`	A delta J. Symb. Log. Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon
2001	J	`jnl`	On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Log. Steffen Lempp, André Nies, Reed Solomon
2000	J	`jnl`	Differences of Computably Enumerable Sets. Math. Log. Q. Steffen Lempp, André Nies
1999	J	`jnl`	A Delta J. Symb. Log. Rodney G. Downey, Geoffrey LaForte, Steffen Lempp
1998	B	`conf`	Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. MFCS Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt
1997	J	`jnl`	A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. Ann. Pure Appl. Log. Steffen Lempp, Manuel Lerman
1997	J	`jnl`	Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. Rodney G. Downey, Steffen Lempp
1997	J	`jnl`	Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame J. Formal Log. Rich Blaylock, Rodney G. Downey, Steffen Lempp
1997	J	`jnl`	Iterated trees of strategies and priority arguments. Arch. Math. Log. Steffen Lempp, Manuel Lerman
1996	J	`jnl`	An Extended Lachlan Splitting Theorem. Ann. Pure Appl. Log. Steffen Lempp, Yuefei Sui
1996	J	`jnl`	Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. J. Symb. Log. Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
1996	J	`jnl`	Infinite Versions of Some Problems From Finite Complexity Theory. Notre Dame J. Formal Log. Jeffry L. Hirst, Steffen Lempp
1996	J	`jnl`	Interpolating d-r.e. and REA Degrees between r.e. Degrees. Ann. Pure Appl. Log. Marat M. Arslanov, Steffen Lempp, Richard A. Shore
1995	J	`jnl`	A general framework for priority arguments. Bull. Symb. Log. Steffen Lempp, Manuel Lerman
1995	J	`jnl`	The Undecidability of the Pi J. Symb. Log. Steffen Lempp, André Nies
1994	J	`jnl`	There is no plus-capping degree. Arch. Math. Log. Rodney G. Downey, Steffen Lempp
1993	J	`jnl`	Highness and Bounding Minimal Pairs. Math. Log. Q. Steffen Lempp, Rodney G. Downey, Richard A. Shore
1992	J	`jnl`	The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility. J. Symb. Log. Steffen Lempp, Manuel Lerman
1991	J	`jnl`	The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Log. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
1990	J	`jnl`	Jumps of nontrivial splittings of recursively enumerable sets. Math. Log. Q. Michael A. Ingrassia, Steffen Lempp
1989	J	`jnl`	A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. Steffen Lempp, Theodore A. Slaman
1988	J	`jnl`	A High Strongly Noncappable Degree. J. Symb. Log. Steffen Lempp