Diophantine induction
From MaRDI portal
Publication:584258
DOI10.1016/0168-0072(90)90076-EzbMath0693.03038OpenAlexW4212773215MaRDI QIDQ584258
Publication date: 1990
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(90)90076-e
inductioncountable nonstandard modelsdiophantine formulas without parametersMatijasevič's theoremsubsystem of Peano arithmetic
Related Items (18)
A direct method for simulating partial recursive functions by Diophantine equations ⋮ A note on exponentiation ⋮ The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem ⋮ Restricted polynomial induction versus parameter free ordinary induction ⋮ Division by zero ⋮ Restricted polynomial induction versus ordinary induction ⋮ Toward the limits of the Tennenbaum phenomenon ⋮ Pell equations and exponentiation in fragments of arithmetic ⋮ Pell Equations and Weak Regularity Principles ⋮ Algebraic combinatorics in bounded induction ⋮ A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) ⋮ Hilbert's tenth problem for weak theories of arithmetic ⋮ Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document} ⋮ Elementary equivalence for abelian-by-finite and nilpotent groups ⋮ Weak arithmetics ⋮ Weak arithmetic ⋮ Induction rules in bounded arithmetic ⋮ Solving Pell equations locally in models of IΔ0
Cites Work
This page was built for publication: Diophantine induction
