∑ n Definable Sets without ∑ n Induction
From MaRDI portal
Publication:4032456
DOI10.2307/2153986zbMath0771.03015OpenAlexW2322029536MaRDI QIDQ4032456
No author found.
Publication date: 1 April 1993
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2153986
models of arithmeticfragments of Peano arithmeticsplitting of r.e. setshigher dimensional analogsFriedberg-Muchnik Theoremmodels of \(\Sigma_ 1\) collectionSacks Splitting Theorem
Models of arithmetic and set theory (03C62) Recursively (computably) enumerable sets and degrees (03D25) Second- and higher-order arithmetic and fragments (03F35) Computability and recursion theory (03D99)
Related Items
\(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator, Computational processes, observers and Turing incompleteness, \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction, \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture, The minimal e-degree problem in fragments of Peano arithmetic
