On recursion theory in IΣ1

DOI10.2307/2274871zbMath0703.03019OpenAlexW1579073671MaRDI QIDQ3481685

Petr Hájek, Antonín Kučera

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274871

zbMATH Keywords

low basis theoremr.e. degreefragment of first order arithmeticpriority-free solution to Post's problem

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (3)

THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS ⋮ On some formalized conservation results in arithmetic ⋮ The logic of \(\Pi_ 1\)-conservativity

Cites Work

• Finite injury and Σ₁-induction
• Class groups of integral group rings

This page was built for publication: On recursion theory in IΣ₁