On finite lattices of degrees of constructibility of reals

Journal of Symbolic Logic 41 (2):313-322 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272229

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Patrick Farrington. Hinges and automorphisms of the degrees of non-constructibility. The journal of the London Mathematical Society, ser. 2 vol. 28 , pp. 193–202. - Petr Hájek. Some results on degrees of constructibility. Higher set theory, Proceedings, Oberwolfach, Germany, April 13–23, 1977, edited by G. H. Müller and D. S. Scott, Lecture notes in mathematics, vol. 669, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 55–71. - Zofia Adamowicz. On finite lattices of degrees of constructibility of reals. The journal of symbolic logic, vol. 41 , pp. 313–322. - Zofia Adamowicz. Constructive semi-lattices of degrees of constructibility. Set theory and hierarchy theory V, Bierutowice, Poland 1976, edited by A. Lachlan, M. Srebrny, and A. Zarach, Lecture notes in mathematics, vol. 619, Springer-Verlag, Berlin, Heidelberg, and New York, 1977, pp. 1–43. [REVIEW]Robert Lubarsky - 1989 - Journal of Symbolic Logic 54 (3):1109-1111.
On finite lattices of degrees of constructibility.Zofia Adamowicz - 1977 - Journal of Symbolic Logic 42 (3):349-371.
On MODkP Counting Degrees.Masamitsu Ozaki & Juichi Shinoda - 1999 - Mathematical Logic Quarterly 45 (3):327-342.
Degrees of d. c. e. reals.Rod Downey, Guohua Wu & Xizhong Zheng - 2004 - Mathematical Logic Quarterly 50 (4-5):345-350.
Ω*1 as an initial segment of the c-degrees.Marcia Groszek - 1994 - Journal of Symbolic Logic 59 (3):956 - 976.
The structure of the honest polynomial m-degrees.Rod Downey, William Gasarch & Michael Moses - 1994 - Annals of Pure and Applied Logic 70 (2):113-139.
The natural hierarchy and quasi-hierarchy of constructibility degrees.Philip Welch - 1986 - Journal of Symbolic Logic 51 (1):130-134.
$omega^ast_1$ as an Initial Segment of the $c$-Degrees.Marcia Groszek - 1994 - Journal of Symbolic Logic 59 (3):956-976.
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees.M. Lerman - 1998 - Annals of Pure and Applied Logic 94 (1-3):143-180.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
Hinges and Automorphisms of the Degrees of Non-constructibility.Patrick Farrington, D. S. Scott & Zofia Adamowicz - 1989 - Journal of Symbolic Logic 54 (3):1109-1111.
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees.Steffen Lempp & Manuel Lerman - 1997 - Annals of Pure and Applied Logic 87 (2):167-185.
Representation of finite demi-p-lattices by means of posets.Hernando Gaitan - 1996 - Studia Logica 56 (1-2):97 - 110.
Approximation representations for reals and their wtt‐degrees.George Barmpalias - 2004 - Mathematical Logic Quarterly 50 (4-5):370-380.
Embedding finite lattices into the Σ20 enumeration degrees.Steffen Lempp & Andrea Sorbi - 2002 - Journal of Symbolic Logic 67 (1):69-90.

Analytics

Added to PP
2009-01-28

Downloads
41 (#380,229)

6 months
9 (#295,075)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Applications of iterated perfect set forcing.Marcia J. Groszek - 1988 - Annals of Pure and Applied Logic 39 (1):19-53.

Add more citations

References found in this work

No references found.

Add more references