The First‐Order Theory of the c‐Degrees With the #‐Operation

Mathematical Logic Quarterly 28 (33‐38):487-493 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19820283303

Other Versions

reprint Farrington, Patrick (1982) "The First-Order Theory of thec-Degrees With the #-Operation". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28(33-38):487-493

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

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

Recursive complexity of the Carnap first order modal logic C.Amélie Gheerbrant & Marcin Mostowski - 2006 - Mathematical Logic Quarterly 52 (1):87-94.
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.
Minimal Degrees in Generalized Recursion Theory.Michael Machtey - 1974 - Mathematical Logic Quarterly 20 (8-12):133-148.
A Topology for the Space of Countable Models of a First Order Theory.J. T. Baldwin & J. M. Plotkin - 1974 - Mathematical Logic Quarterly 20 (8-12):173-178.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
There is no low maximal d. c. e. degree– Corrigendum.Marat Arslanov, S. Barry Cooper & Angsheng Li - 2004 - Mathematical Logic Quarterly 50 (6):628-636.
Coding true arithmetic in the Medvedev and Muchnik degrees.Paul Shafer - 2011 - Journal of Symbolic Logic 76 (1):267 - 288.
A Splitting with Infimum in the d-c. e. Degrees.Q. Lei, L. Hong & D. Decheng - 2000 - Mathematical Logic Quarterly 46 (1):53-76.

Analytics

Added to PP
2013-12-01

Downloads
4 (#1,804,354)

6 months
2 (#1,687,048)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references