On recursion theory in IΣ1

DOI10.2307/2274871MaRDI QIDQ3481685zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 4150148
• scientific article; zbMATH DE number 3995657
• \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\)
• Iterated trees and fragments of arithmetic
• Σ₂-collection and the infinite injury priority method

Cites work

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

Cited in

(9)

• scientific article; zbMATH DE number 3995657 (Why is no real title available?)
• On some formalized conservation results in arithmetic
• The logic of \(\Pi_ 1\)-conservativity
• Iterated trees and fragments of arithmetic
• The strength of Ramsey's theorem for pairs and arbitrarily many colors
• A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$
• Σ₂-collection and the infinite injury priority method
• Finite injury and Σ₁-induction
• scientific article; zbMATH DE number 3916272 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481685)