The following pages link to Manuel Lerman (Q1049746):
Displaying 50 items.
- (Q802547) (redirect page) (← links)
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical (Q802550) (← links)
- Self-embeddings of computable trees (Q1049747) (← links)
- Degrees which do not bound minimal degrees (Q1073789) (← links)
- Upper bounds for the arithmetical degrees (Q1086229) (← links)
- d-simple sets, small sets, and degree classes (Q1155608) (← links)
- \(r\)-maximal major subsets (Q1248505) (← links)
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← links)
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees (Q1368585) (← links)
- Iterated trees of strategies and priority arguments (Q1387095) (← links)
- Homomorphisms and quotients of degree structures (Q1408859) (← links)
- The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations (Q1921269) (← links)
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees (Q1964021) (← links)
- Initial segments of the degrees of unsolvability (Q2538529) (← links)
- Maximal sets in \(\alpha\)-recursion theory (Q2560401) (← links)
- (Q3325711) (← links)
- (Q3329452) (← links)
- (Q3480023) (← links)
- Decidability and Invariant Classes for Degree Structures (Q3487331) (← links)
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion (Q3489987) (← links)
- (Q3573560) (← links)
- Stability and posets (Q3630588) (← links)
- (Q3712325) (← links)
- The universal splitting property. II (Q3712326) (← links)
- (Q3714069) (← links)
- Lattice embeddings into the recursively enumerable degrees (Q3770516) (← links)
- Theories with recursive models (Q3856753) (← links)
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets (Q3880826) (← links)
- (Q3905266) (← links)
- (Q3919702) (← links)
- (Q3960683) (← links)
- Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets (Q3990704) (← links)
- The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility (Q4032885) (← links)
- (Q4044555) (← links)
- Maximal a-R.E. Sets (Q4100079) (← links)
- Congruence relations, filters, ideals, and definability in lattices of <i>α</i>-recursively enumerable sets (Q4100080) (← links)
- Types of simple α-recursively enumerable sets (Q4100081) (← links)
- Ideals of Generalized Finite Sets in Lattices of α‐Recursively Enumerable Sets (Q4121886) (← links)
- On elementary theories of some lattices or α-recursively enumerable sets (Q4172045) (← links)
- Lattice embeddings into the recursively enumerable degrees. II (Q4205431) (← links)
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 (Q4286357) (← links)
- (Q4325778) (← links)
- Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834) (← links)
- Computable choice functions for computable linear orderings (Q4434504) (← links)
- (Q4513972) (← links)
- (Q4749830) (← links)
- Least upper bounds for minimal pairs of α-R.E. α-degrees (Q4774031) (← links)
- A General Framework for Priority Arguments (Q4847389) (← links)
- (Q4863245) (← links)
- CAPPABLE CEA SETS AND RAMSEY'S THEOREM (Q4922663) (← links)
