The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations

DOI10.1006/aima.1996.0033zbMath0856.03034OpenAlexW2019646940MaRDI QIDQ1921269

Manuel Lerman, Steffen Lempp

Publication date: 24 February 1997

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aima.1996.0033

zbMATH Keywords

codingdecision procedurejump relationsexistential theoryposet of recursively enumerable degreeshigher level priority argumentsiterated trees of strategies

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (5)

Nonbounding and Slaman triples ⋮ Decidability of the AE-theory of the lattice of \({\Pi}_1^0\) classes ⋮ An almost deep degree ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ Degree Structures: Local and Global Investigations

This page was built for publication: The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations