论文信息 - Sequence encoding without induction

Sequence encoding without induction

We show that the universally axiomatized, induction-free theory is a sequential theory in the sense of Pudlak's 5, in contrast to the closely related Robinson's arithmetic.

Emil Jerábek | Emil Jeřábek

[1] Pavel Pudlák. Some prime elements in the lattice of interpretability types , 1983 .

[2] Pavel Pudlák,et al. Cuts, consistency statements and interpretations , 1985, Journal of Symbolic Logic.

[3] Albert Visser. Pairs, sets and sequences in first-order theories , 2008, Arch. Math. Log..

[4] Richard Kaye. Models of Peano arithmetic , 1991, Oxford logic guides.

[5] K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[6] George Wilmers,et al. Models OF Peano Arithmetic (Oxford Logic Guides 15) , 1993 .

[7] Jan Krajícek,et al. Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.

[8] Robert L. Vaught,et al. Axiomatizability by a schema , 1968, Journal of Symbolic Logic.