Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-theory-of-the-effectively-closed-medvedev-degrees-is-decidable-reTlED5NMm
References (15)
-
D. Cenzer, J. Remmel (1998)
Chapter 13 Π10 classes in mathematicsStudies in logic and the foundations of mathematics, 139
-
D. Cenzer, P. Hinman (2002)
Mathematical Logic -
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
-
R. Shore, T. Slaman (1993)
Working below a high recursively enumerable degreeJournal of Symbolic Logic, 58
-
S.G. Simpson (2007)
An extension of the recursively enumerable degreesJ. Lond. Math. Soc., 75
-
D. Cenzer (1999)
Chapter 2 - ∏10 Classes in Computability TheoryStudies in logic and the foundations of mathematics, 140
-
S. Simpson (2007)
An extension of the recursively enumerable Turing degreesJournal of the London Mathematical Society, 75
-
T. Slaman, R. Soare (2001)
Extension of embeddings in the computably enumerable degreesAnnals of Mathematics, 154
-
R. Shore, T. Slaman (1990)
Working below a low2 recursively enumerably degreeArchive for Mathematical Logic, 29
-
M. Lerman (1983)
Degrees of Unsolvability -
D. Cenzer, P.G. Hinman (2003)
Density of the Medvedev lattice of $${\Pi^0_1}$$ classesArch. Math. Logic, 42
-
S. Lempp, A. Nies, T. Slaman (1998)
The Π₃-theory of the computably enumerable Turing degrees is undecidableTransactions of the American Mathematical Society, 350
-
S. Simpson (2005)
Mass Problems and RandomnessBulletin of Symbolic Logic, 11
-
F. Harvey, H. Lawson, Jr. (2001)
Finite volume flows and Morse theoryAnnals of Mathematics, 153
-
S. Binns (2003)
A splitting theorem for the Medvedev and Muchnik latticesMathematical Logic Quarterly, 49
- Publisher
- Springer Journals
- Copyright
- Copyright © 2009 by Springer-Verlag
- Subject
- Mathematics; Algebra; Mathematics, general; Mathematical Logic and Foundations
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-009-0150-6
- Publisher site
- See Article on Publisher Site
Abstract
We show that there is a computable procedure which, given an ∀∃-sentence $${\varphi}$$ in the language of the partially ordered sets with a top element 1 and a bottom element 0, computes whether $${\varphi}$$ is true in the Medvedev degrees of $${\Pi^0_1}$$ classes in Cantor space, sometimes denoted by $${\mathcal{P}_s}$$ .
Journal
Archive for Mathematical Logic – Springer Journals
Published: Sep 19, 2009