An Exact Pair for the Arithmetic Degrees Whose Join is Not a Weak Uniform Upper Bound

Recursive Function Theory-Newsletters 28 (1982)
  Copy   BIBTEX

Abstract

Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The result extends to exact pairs for the hyperarithmetic degrees.

Categories

Keywords

Reprint years

Links

PhilArchive

External links

  • This entry has no external links. Add one.
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

Harold Hodes: Bibliography.Harold T. Hodes - unknown
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1978 - Journal of Symbolic Logic 43 (3):601-612.
Characterizing the Join-Irreducible Medvedev Degrees.Paul Shafer - 2011 - Notre Dame Journal of Formal Logic 52 (1):21-38.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
A Minimal Upper Bound on a Sequence of Turing Degrees Which Represents that Sequence.Harold T. Hodes - 1983 - Pacific Journal of Mathematics 108 (1):115-119.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Minimality in the ▵13-degrees.Philip Welch - 1987 - Journal of Symbolic Logic 52 (4):908 - 915.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
Minimal complementation below uniform upper Bounds for the arithmetical degrees.Masahiro Kumabe - 1996 - Journal of Symbolic Logic 61 (4):1158-1192.
Uniform self-reference.Raymond M. Smullyan - 1985 - Studia Logica 44 (4):439 - 445.

Analytics

Added to PP
2012-01-01

Downloads
123 (#146,744)

6 months
63 (#75,194)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Harold Hodes
Cornell University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references