Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction

DOI10.1016/0168-0072(86)90074-6zbMath0603.03019OpenAlexW2002594958MaRDI QIDQ1082338

Rick L. Smith, Stephen G. Simpson

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90074-6

zbMATH Keywords

exponential functioninductioncomprehensionsecond order arithmeticReverse Mathematicscountable algebraelementary function arithmetic

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Second- and higher-order arithmetic and fragments (03F35) Nonstandard arithmetic and field theory (12L15)

Related Items (29)

Open Questions in Reverse Mathematics ⋮ Algebraic disguises of \(\Sigma ^ 0_ 1\) induction ⋮ Herbrand analyses ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ Minimal elementary end extensions ⋮ Primitive recursive reverse mathematics ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ PREDICATIVITY THROUGH TRANSFINITE REFLECTION ⋮ The strength of extensionality. II: Weak weak set theories without infinity ⋮ Combinatorial principles concerning approximations of functions ⋮ Baire categoricity and \(\Sigma_1^0\)-induction ⋮ Categorical characterizations of the natural numbers require primitive recursion ⋮ Ordinal numbers and the Hilbert basis theorem ⋮ Dickson's lemma and weak Ramsey theory ⋮ Weaker cousins of Ramsey's theorem over a weak base theory ⋮ On mathematical instrumentalism ⋮ On the strength of Ramsey's theorem without Σ₁‐induction ⋮ Algorithmic randomness, reverse mathematics, and the dominated convergence theorem ⋮ Forcing in Proof Theory ⋮ Interpreting Weak König’s Lemma using the Arithmetized Completeness Theorem ⋮ THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES ⋮ REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION ⋮ The Baire category theorem in weak subsystems of second-order arithmetic ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS ⋮ A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection ⋮ Groundwork for weak analysis ⋮ FINITIST AXIOMATIC TRUTH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Addendum to ``Countable algebra and set existence axioms
• Effective procedures in field theory
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction