default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Lerman
Person information
- affiliation: University of Connecticut, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j30]Manuel Lerman, Theodore A. Slaman:
IN MEMORIAM: GERALD E. SACKS, 1933-2019. Bull. Symb. Log. 28(1): 150-155 (2022)
2010 – 2019
- 2013
- [j29]Manuel Lerman, Reed Solomon, Henry Towsner
:
Separating Principles below Ramsey's Theorem for Pairs. J. Math. Log. 13(2): 1350007 (2013)
2000 – 2009
- 2009
- [j28]Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon:
Stability and posets. J. Symb. Log. 74(2): 693-711 (2009) - 2008
- [j27]Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon:
Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. 49(1): 1-37 (2008) - 2006
- [j26]Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon:
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. 71(1): 119-136 (2006) - 2003
- [j25]Burkhard Englert, Manuel Lerman, Kevin Wald:
Homomorphisms and quotients of degree structures. Ann. Pure Appl. Log. 123(1-3): 193-233 (2003) - [j24]Manuel Lerman, Richard Watnick:
Computable choice functions for computable linear orderings. Math. Log. Q. 49(5): 485-510 (2003) - 2001
- [j23]William C. Calhoun, Manuel Lerman:
Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees. J. Symb. Log. 66(4): 1791-1802 (2001) - 2000
- [j22]Manuel Lerman:
A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees. Ann. Pure Appl. Log. 101(2-3): 275-297 (2000)
1990 – 1999
- 1998
- [j21]Manuel Lerman:
A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. Ann. Pure Appl. Log. 94(1-3): 143-180 (1998) - 1997
- [j20]Steffen Lempp, Manuel Lerman:
Iterated trees of strategies and priority arguments. Arch. Math. Log. 36(4-5): 297-312 (1997) - [j19]Steffen Lempp, Manuel Lerman:
A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. Ann. Pure Appl. Log. 87(2): 167-185 (1997) - 1996
- [j18]Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman:
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. J. Symb. Log. 61(3): 880-905 (1996) - 1995
- [j17]Steffen Lempp, Manuel Lerman:
A general framework for priority arguments. Bull. Symb. Log. 1(2): 189-201 (1995) - 1992
- [j16]Steffen Lempp, Manuel Lerman:
The Existential Theory of the Pomset of r.e. Degrees with a Predicate for Single Jump Reducibility. J. Symb. Log. 57(3): 1120-1130 (1992) - 1991
- [j15]Manuel Lerman:
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets. Math. Log. Q. 37(19-22): 331-342 (1991)
1980 – 1989
- 1989
- [j14]Klaus Ambos-Spies, Manuel Lerman:
Lattice Embeddings into the Recursively Enumerable Degrees II. J. Symb. Log. 54(3): 735-760 (1989) - [j13]Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay:
Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. J. Symb. Log. 54(4): 1288-1323 (1989) - 1986
- [j12]Manuel Lerman:
Degrees which do not bound minimal degrees. Ann. Pure Appl. Log. 30(3): 249-276 (1986) - [j11]Klaus Ambos-Spies, Manuel Lerman:
Lattice Embeddings into the Recursively Enumerable Degrees. J. Symb. Log. 51(2): 257-272 (1986) - 1985
- [j10]Manuel Lerman:
Upper bounds for the arithmetical degrees. Ann. Pure Appl. Log. 29(3): 225-254 (1985) - 1984
- [j9]Manuel Lerman, Jeffrey B. Remmel:
The Universal Splitting Property. II. J. Symb. Log. 49(1): 137-150 (1984)
1970 – 1979
- 1979
- [j8]Manuel Lerman, James H. Schmerl:
Theories with Recursive Models. J. Symb. Log. 44(1): 59-76 (1979) - 1976
- [j7]Manuel Lerman:
Congruence Relations, Filters, Ideals, and Definability in Lattices of alpha-Recursively Enumerable Sets. J. Symb. Log. 41(2): 405-418 (1976) - [j6]Manuel Lerman:
Types of Simple alpha-Recursively Enumerable Sets. J. Symb. Log. 41(2): 419-426 (1976) - [j5]Manuel Lerman:
Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable Sets. Math. Log. Q. 22(1): 347-352 (1976) - 1974
- [j4]Manuel Lerman:
Least Upper Bounds For Minimal Pairs of alpha-R.E. alpha Degrees. J. Symb. Log. 39(1): 49-56 (1974) - 1971
- [j3]Manuel Lerman:
Some Theorems on R-Maximal Sets and Major Subsets of Recursively Enumerable Sets. J. Symb. Log. 36(2): 193-215 (1971) - 1970
- [j2]Manuel Lerman:
Turing Degrees and Many-One Degrees of Maximal Sets. J. Symb. Log. 35(1): 29-40 (1970)
1960 – 1969
- 1969
- [j1]Manuel Lerman:
Some Nondistributive Lattices as Initial Segments of the Degrees of Unsolvability. J. Symb. Log. 34(1): 85-98 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
