×

zbMATH — the first resource for mathematics

Lerman, Manuel

Compute Distance To:
Author ID: lerman.manuel Recent zbMATH articles by "Lerman, Manuel"
Published as: Lerman, M.; Lerman, Manuel
Documents Indexed: 64 Publications since 1969, including 5 Books

Publications by Year

Citations contained in zbMATH

55 Publications have been cited 440 times in 306 Documents Cited by Year
Degrees of unsolvability. Local and global theory. Zbl 0542.03023
Lerman, Manuel
104
1983
Initial segments of the degrees of unsolvability. Zbl 0193.31004
Lerman, M.
23
1971
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov’s completeness criterion. Zbl 0708.03020
Jockusch, C. G. jun.; Lerman, M.; Soare, R. I.; Solovay, R. M.
20
1989
Separating principles below Ramsey’s theorem for pairs. Zbl 1326.03021
Lerman, Manuel; Solomon, Reed; Towsner, Henry
19
2013
Lattice embeddings into the recursively enumerable degrees. Zbl 0633.03037
Ambos-Spies, K.; Lerman, M.
15
1986
Lattice embeddings into the recursively enumerable degrees. II. Zbl 0687.03022
Ambos-Spies, K.; Lerman, M.
13
1989
\(r\)-maximal major subsets. Zbl 0384.03025
Lerman, Manuel; Shore, Richard A.; Soare, Robert I.
12
1978
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Zbl 0883.03025
Lempp, Steffen; Lerman, Manuel
11
1997
The universal splitting property. II. Zbl 0586.03033
Lerman, M.; Remmel, J. B.
11
1984
d-simple sets, small sets, and degree classes. Zbl 0467.03040
Lerman, Manuel; Soare, Robert I.
11
1980
Admissible ordinals and priority arguments. Zbl 0293.02028
Lerman, Manuel
11
1973
Some minimal pairs of \(\alpha\)-recursively enumerable degrees. Zbl 0262.02040
Lerman, Manuel; Sacks, Gerald E.
11
1972
Recursive linear orderings. Zbl 0511.03018
Lerman, Manuel; Rosenstein, J.
10
1982
Maximal sets in \(\alpha\)-recursion theory. Zbl 0261.02030
Lerman, M.; Simpson, S. G.
10
1973
On suborderings of the \(\alpha\)-recursively enumerable \(\alpha\)-degrees. Zbl 0262.02038
Lerman, Manuel
10
1972
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. Zbl 1103.03014
Binns, Stephen; Kjos-Hanssen, Bjørn; Lerman, Manuel; Solomon, Reed
9
2006
The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical. Zbl 0559.03027
Lerman, M.; Shore, R. A.; Soare, R. I.
9
1984
Priority arguments using iterated trees of strategies. Zbl 0702.03019
Lempp, Steffen; Lerman, Manuel
7
1990
Degrees which do not bound minimal degrees. Zbl 0589.03027
Lerman, Manuel
7
1986
Some theorems on \(r\)-maximal sets and major subsets of recursively enumerable sets. Zbl 0242.02047
Lerman, Manuel
7
1971
Turing degrees and many-one degrees of maximal sets. Zbl 0198.02503
Lerman, M.
7
1970
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees. Zbl 0945.03062
Lerman, M.
6
2000
Upper bounds for the arithmetical degrees. Zbl 0608.03014
Lerman, M.
6
1985
A decidable fragment of the elementary theory of the lattice of recursively enumerable sets. Zbl 0439.03023
Lerman, Manuel; Soare, Robert I.
6
1980
Hypersimple \(\alpha\)-r. e. sets. Zbl 0317.02045
Chong, C. T.; Lerman, M.
6
1976
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees. Zbl 0924.03075
Lerman, M.
5
1998
The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations. Zbl 0856.03034
Lempp, Steffen; Lerman, Manuel
5
1996
Lattice embeddings into the r.e. degrees preserving 0 and 1. Zbl 0808.03027
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
5
1994
Decidability and invariant classes for degree structures. Zbl 0707.03036
Lerman, Manuel; Shore, Richard A.
5
1988
Logic year 1979–80, The University of Connecticut, USA. Zbl 0456.00006
Lerman, Manuel (ed.); Schmerl, J. H. (ed.); Soare, Robert I. (ed.)
5
1981
Recursive functions modulo co-r-maximal sets. Zbl 0198.02502
Lerman, M.
5
1970
A general framework for priority arguments. Zbl 0841.03025
Lempp, Steffen; Lerman, Manuel
4
1995
Congruence relations, filters, ideals, and definability in lattices of \(\alpha\)-recursively enumerable sets. Zbl 0333.02037
Lerman, Manuel
4
1976
A framework for priority arguments. Zbl 1203.03054
Lerman, Manuel
3
2010
Stability and posets. Zbl 1171.03034
Jockusch, Carl G. jun.; Kastermans, Bart; Lempp, Steffen; Lerman, Manuel; Solomon, Reed
3
2009
Embedding finite lattices into the computably enumerable degrees – a status survey. Zbl 1107.03046
Lempp, Steffen; Lerman, Manuel; Solomon, Reed
3
2006
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. Zbl 0863.03021
Ambos-Spies, Klaus; Fejer, Peter A.; Lempp, Steffen; Lerman, Manuel
3
1996
The universal splitting property. I. Zbl 0497.03036
Lerman, M.; Remmel, J. B.
3
1982
Theories with recursive models. Zbl 0423.03038
Lerman, Manuel; Schmerl, James H.
3
1979
On elementary theories of some lattices of \(\alpha\)-recursively enumerable sets. Zbl 0391.03022
Lerman, Manuel
3
1978
Degrees of unsolvability. Local and global theory. Reprint of the 1983 original published by Springer. Zbl 1365.03002
Lerman, Manuel
2
2016
Iterated trees of strategies and priority arguments. Zbl 0899.03030
Lempp, Steffen; Lerman, Manuel
2
1997
On recursive linear orderings. Zbl 0467.03045
Lerman, Manuel
2
1981
The degrees of unsolvability: Some recent results. Zbl 0457.03041
Lerman, Manuel
2
1980
Types of simple \(\alpha\)-recursively enumerable sets. Zbl 0333.02038
Lerman, Manuel
2
1976
Self-embeddings of computable trees. Zbl 1204.03044
Binns, Stephen; Kjos-Hanssen, Bjørn; Lerman, Manuel; Schmerl, James H.; Solomon, Reed
1
2008
Embedding finite lattices into the ideals of computably enumerable Turing degrees. Zbl 1002.03035
Calhoun, William; Lerman, Manuel
1
2001
Computability theory and its applications. Current trends and open problems. Proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, Boulder, CO, USA, June 13–17, 1999. Zbl 0945.00017
Cholak, Peter A. (ed.); Lempp, Steffen (ed.); Lerman, Manuel (ed.); Shore, Richard A. (ed.)
1
2000
Embeddings into the recursively enumerable degrees. Zbl 0849.03032
Lerman, Manuel
1
1996
Lattice embeddings into the r.e. degrees preserving 1. Zbl 0819.03032
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
1
1994
The existential theory of the poset of r.e. degrees with a predicate for single jump reducibility. Zbl 0764.03014
Lempp, Steffen; Lerman, Manuel
1
1992
On the ordering of classes in high/low hierarchies. Zbl 0587.03031
Lerman, Manuel
1
1985
Ideals of generalized finite sets in lattices of \(\alpha\)-recursively enumerable sets. Zbl 0352.02032
Lerman, Manuel
1
1976
Maximal \(\alpha\)-r.e. sets. Zbl 0333.02036
Lerman, Manuel
1
1974
Some nondistributive lattices as initial segments of the degrees of unsolvability. Zbl 0191.30403
Lerman, M.
1
1969
Degrees of unsolvability. Local and global theory. Reprint of the 1983 original published by Springer. Zbl 1365.03002
Lerman, Manuel
2
2016
Separating principles below Ramsey’s theorem for pairs. Zbl 1326.03021
Lerman, Manuel; Solomon, Reed; Towsner, Henry
19
2013
A framework for priority arguments. Zbl 1203.03054
Lerman, Manuel
3
2010
Stability and posets. Zbl 1171.03034
Jockusch, Carl G. jun.; Kastermans, Bart; Lempp, Steffen; Lerman, Manuel; Solomon, Reed
3
2009
Self-embeddings of computable trees. Zbl 1204.03044
Binns, Stephen; Kjos-Hanssen, Bjørn; Lerman, Manuel; Schmerl, James H.; Solomon, Reed
1
2008
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. Zbl 1103.03014
Binns, Stephen; Kjos-Hanssen, Bjørn; Lerman, Manuel; Solomon, Reed
9
2006
Embedding finite lattices into the computably enumerable degrees – a status survey. Zbl 1107.03046
Lempp, Steffen; Lerman, Manuel; Solomon, Reed
3
2006
Embedding finite lattices into the ideals of computably enumerable Turing degrees. Zbl 1002.03035
Calhoun, William; Lerman, Manuel
1
2001
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees. Zbl 0945.03062
Lerman, M.
6
2000
Computability theory and its applications. Current trends and open problems. Proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, Boulder, CO, USA, June 13–17, 1999. Zbl 0945.00017
Cholak, Peter A. (ed.); Lempp, Steffen (ed.); Lerman, Manuel (ed.); Shore, Richard A. (ed.)
1
2000
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees. Zbl 0924.03075
Lerman, M.
5
1998
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Zbl 0883.03025
Lempp, Steffen; Lerman, Manuel
11
1997
Iterated trees of strategies and priority arguments. Zbl 0899.03030
Lempp, Steffen; Lerman, Manuel
2
1997
The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations. Zbl 0856.03034
Lempp, Steffen; Lerman, Manuel
5
1996
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices. Zbl 0863.03021
Ambos-Spies, Klaus; Fejer, Peter A.; Lempp, Steffen; Lerman, Manuel
3
1996
Embeddings into the recursively enumerable degrees. Zbl 0849.03032
Lerman, Manuel
1
1996
A general framework for priority arguments. Zbl 0841.03025
Lempp, Steffen; Lerman, Manuel
4
1995
Lattice embeddings into the r.e. degrees preserving 0 and 1. Zbl 0808.03027
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
5
1994
Lattice embeddings into the r.e. degrees preserving 1. Zbl 0819.03032
Ambos-Spies, Klaus; Lempp, Steffen; Lerman, Manuel
1
1994
The existential theory of the poset of r.e. degrees with a predicate for single jump reducibility. Zbl 0764.03014
Lempp, Steffen; Lerman, Manuel
1
1992
Priority arguments using iterated trees of strategies. Zbl 0702.03019
Lempp, Steffen; Lerman, Manuel
7
1990
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov’s completeness criterion. Zbl 0708.03020
Jockusch, C. G. jun.; Lerman, M.; Soare, R. I.; Solovay, R. M.
20
1989
Lattice embeddings into the recursively enumerable degrees. II. Zbl 0687.03022
Ambos-Spies, K.; Lerman, M.
13
1989
Decidability and invariant classes for degree structures. Zbl 0707.03036
Lerman, Manuel; Shore, Richard A.
5
1988
Lattice embeddings into the recursively enumerable degrees. Zbl 0633.03037
Ambos-Spies, K.; Lerman, M.
15
1986
Degrees which do not bound minimal degrees. Zbl 0589.03027
Lerman, Manuel
7
1986
Upper bounds for the arithmetical degrees. Zbl 0608.03014
Lerman, M.
6
1985
On the ordering of classes in high/low hierarchies. Zbl 0587.03031
Lerman, Manuel
1
1985
The universal splitting property. II. Zbl 0586.03033
Lerman, M.; Remmel, J. B.
11
1984
The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical. Zbl 0559.03027
Lerman, M.; Shore, R. A.; Soare, R. I.
9
1984
Degrees of unsolvability. Local and global theory. Zbl 0542.03023
Lerman, Manuel
104
1983
Recursive linear orderings. Zbl 0511.03018
Lerman, Manuel; Rosenstein, J.
10
1982
The universal splitting property. I. Zbl 0497.03036
Lerman, M.; Remmel, J. B.
3
1982
Logic year 1979–80, The University of Connecticut, USA. Zbl 0456.00006
Lerman, Manuel (ed.); Schmerl, J. H. (ed.); Soare, Robert I. (ed.)
5
1981
On recursive linear orderings. Zbl 0467.03045
Lerman, Manuel
2
1981
d-simple sets, small sets, and degree classes. Zbl 0467.03040
Lerman, Manuel; Soare, Robert I.
11
1980
A decidable fragment of the elementary theory of the lattice of recursively enumerable sets. Zbl 0439.03023
Lerman, Manuel; Soare, Robert I.
6
1980
The degrees of unsolvability: Some recent results. Zbl 0457.03041
Lerman, Manuel
2
1980
Theories with recursive models. Zbl 0423.03038
Lerman, Manuel; Schmerl, James H.
3
1979
\(r\)-maximal major subsets. Zbl 0384.03025
Lerman, Manuel; Shore, Richard A.; Soare, Robert I.
12
1978
On elementary theories of some lattices of \(\alpha\)-recursively enumerable sets. Zbl 0391.03022
Lerman, Manuel
3
1978
Hypersimple \(\alpha\)-r. e. sets. Zbl 0317.02045
Chong, C. T.; Lerman, M.
6
1976
Congruence relations, filters, ideals, and definability in lattices of \(\alpha\)-recursively enumerable sets. Zbl 0333.02037
Lerman, Manuel
4
1976
Types of simple \(\alpha\)-recursively enumerable sets. Zbl 0333.02038
Lerman, Manuel
2
1976
Ideals of generalized finite sets in lattices of \(\alpha\)-recursively enumerable sets. Zbl 0352.02032
Lerman, Manuel
1
1976
Maximal \(\alpha\)-r.e. sets. Zbl 0333.02036
Lerman, Manuel
1
1974
Admissible ordinals and priority arguments. Zbl 0293.02028
Lerman, Manuel
11
1973
Maximal sets in \(\alpha\)-recursion theory. Zbl 0261.02030
Lerman, M.; Simpson, S. G.
10
1973
Some minimal pairs of \(\alpha\)-recursively enumerable degrees. Zbl 0262.02040
Lerman, Manuel; Sacks, Gerald E.
11
1972
On suborderings of the \(\alpha\)-recursively enumerable \(\alpha\)-degrees. Zbl 0262.02038
Lerman, Manuel
10
1972
Initial segments of the degrees of unsolvability. Zbl 0193.31004
Lerman, M.
23
1971
Some theorems on \(r\)-maximal sets and major subsets of recursively enumerable sets. Zbl 0242.02047
Lerman, Manuel
7
1971
Turing degrees and many-one degrees of maximal sets. Zbl 0198.02503
Lerman, M.
7
1970
Recursive functions modulo co-r-maximal sets. Zbl 0198.02502
Lerman, M.
5
1970
Some nondistributive lattices as initial segments of the degrees of unsolvability. Zbl 0191.30403
Lerman, M.
1
1969
all top 5

Cited by 176 Authors

30 Shore, Richard A.
28 Downey, Rodney Graham
17 Lerman, Manuel
15 Slaman, Theodore A.
13 Lempp, Steffen
13 Soare, Robert I.
12 Patey, Ludovic
11 Nies, André Otfrid
10 Chong, Chi Tat
10 Jockusch, Carl G. jun.
9 Cholak, Peter A.
9 Yu, Liang
8 Greenberg, Noam
7 Montalbán, Antonio
7 Simpson, Stephen G.
6 Ambos-Spies, Klaus
6 Cooper, Stuart Barry
6 Dzhafarov, Damir D.
6 Harrington, Leo A.
6 Maass, Wolfgang
6 Sorbi, Andrea
6 Terwijn, Sebastiaan A.
5 Kjos-Hanssen, Bjørn
5 Lewis, Andrew E. M.
5 Yang, Yue
4 Barmpalias, George
4 Cai, Mingzhong
4 Groszek, Marcia J.
4 Kumabe, Masahiro
4 Shafer, Paul
4 Stob, Michael
4 Sutner, Klaus
4 Wang, Wei
3 Arslanov, Marat M.
3 Chong, Chen-Tai
3 Ding, Decheng
3 Fejer, Peter A.
3 Hirschfeldt, Denis Roman
3 Knight, Julia F.
3 Lachlan, Alistair H.
3 Leggett, Anne M.
3 Lewis, Alain A.
3 Li, Angsheng
3 Miller, Joseph S.
3 Remmel, Jeffrey B.
3 Schöning, Uwe
3 Shavrukov, V. Yu.
3 Solomon, Reed
3 Stephan, Frank
3 Yokoyama, Keita
2 Beklemishev, Lev D.
2 Binns, Stephen
2 Calhoun, William C.
2 Cole, Joshua A.
2 Conidis, Chris J.
2 Englert, Burkhard
2 Friedman, Sy-David
2 Gasarch, William Ian
2 Goncharov, Sergeĭ Savost’yanovich
2 Harizanov, Valentina S.
2 Haught, Christine Ann
2 Hirst, Jeffry Lynn
2 Jahn, Michael A.
2 Kalantari, Iraj
2 Kobzev, G. N.
2 Kučera, Antonín
2 Leonhardi, Steven D.
2 Li, Wei
2 Li, Weilin
2 Melnikov, Alexander G.
2 Shinoda, Juichi
2 Shmidt, Yu. D.
2 Soskova, Mariya Ivanova
2 Teutsch, Jason
2 Weber, Rebecca
2 Wu, Guohua
2 Yang, Dongping
2 Zubkov, Maxim V.
1 Abraham, Uri
1 Adamowicz, Zofia
1 Amir, Amihood
1 Aoki, Kunimasa
1 Ash, Christopher John
1 Astor, Eric P.
1 Avigad, Jeremy
1 Barendregt, Hendrik Pieter
1 Barnes, James S.
1 Bäuerle, Frank A.
1 Beigel, Richard
1 Bélanger, David R.
1 Bienvenu, Laurent
1 Brodhead, Paul
1 Brown, Douglas K.
1 Brown, Ron
1 Buss, Sam
1 Cenzer, Douglas
1 Courcelle, Bruno
1 Dëgtev, A. N.
1 Di Paola, Robert A.
1 Dorais, François Gilbert
...and 76 more Authors
all top 5

Cited in 43 Serials

75 The Journal of Symbolic Logic
69 Annals of Pure and Applied Logic
21 The Bulletin of Symbolic Logic
15 Transactions of the American Mathematical Society
14 Israel Journal of Mathematics
13 Archive for Mathematical Logic
10 Proceedings of the American Mathematical Society
9 Algebra and Logic
8 Theoretical Computer Science
8 Journal of Mathematical Logic
5 Advances in Mathematics
4 Notre Dame Journal of Formal Logic
4 Russian Mathematics
3 Journal of Computer and System Sciences
3 Mathematical Social Sciences
3 Bulletin of the American Mathematical Society
2 Archiv für Mathematische Logik und Grundlagenforschung
2 Mathematical Proceedings of the Cambridge Philosophical Society
2 Algebra Universalis
2 Information and Computation
2 MSCS. Mathematical Structures in Computer Science
2 Bulletin of the American Mathematical Society. New Series
2 Acta Mathematica Sinica. New Series
1 Information Processing Letters
1 Mathematical Notes
1 Annali di Matematica Pura ed Applicata. Serie Quarta
1 Journal of Algebra
1 Journal of Combinatorial Theory. Series B
1 Mathematical Systems Theory
1 Nagoya Mathematical Journal
1 Siberian Mathematical Journal
1 Studia Logica
1 Tohoku Mathematical Journal. Second Series
1 Topology and its Applications
1 Mathematical Logic Quarterly (MLQ)
1 Selecta Mathematica. New Series
1 Theory of Computing Systems
1 Lobachevskii Journal of Mathematics
1 Proceedings of the Steklov Institute of Mathematics
1 Studies in History and Philosophy of Science. Part B. Studies in History and Philosophy of Modern Physics
1 Advances in Mathematical Physics
1 Computability
1 Transactions of the London Mathematical Society

Citations by Year