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

Recursive Function Theory-Newsletters 28 (1982)
  Copy   BIBTEX


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.

Author's Profile

Harold Hodes
Cornell University


Added to PP

83 (#84,652)

6 months
49 (#73,449)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?