Embedding distributive lattices preserving 1 below a nonzero recursively enumerable turing degree
One way to try to gain an understanding of the various degree-theoretic structures which recursion theorists study is to see what lattices can be embedded into them. Lattice embeddings have been used to show that such structures have an undecidable theory (via embeddings as initial segments) and to...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Chapter/Article |
| Language: | English |
| Published: |
1993
|
| In: |
Logical methods
Year: 1993, Pages: 92-129 |
| DOI: | 10.1007/978-1-4612-0325-4_2 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/978-1-4612-0325-4_2
|
| Author Notes: | Klaus Ambos-Spies, Ding Decheng, Peter A. Fejer |
| Summary: | One way to try to gain an understanding of the various degree-theoretic structures which recursion theorists study is to see what lattices can be embedded into them. Lattice embeddings have been used to show that such structures have an undecidable theory (via embeddings as initial segments) and to show that the theory of such structures is decidable up to a certain quantifier level. Many results in recursion theory can be stated as results about lattice embeddings even if they were not originally phrased that way. |
|---|---|
| Item Description: | Gesehen am 12.06.2023 |
| Physical Description: | Online Resource |
| ISBN: | 9781461203254 |
| DOI: | 10.1007/978-1-4612-0325-4_2 |