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

Download Edit this record How to cite View on PhilPapers
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.
(categorize this paper)
PhilPapers/Archive ID
Upload history
Archival date: 2022-09-20
View other versions
Added to PP index

Total views
5 ( #74,002 of 72,575 )

Recent downloads (6 months)
5 ( #70,952 of 72,575 )

How can I increase my downloads?

Downloads since first upload

Sorry, there are not enough data points to plot this chart.