Sequence encoding without induction

DOI10.1002/MALQ.201200013zbMath1248.03079arXiv1201.5835OpenAlexW3101802257MaRDI QIDQ2888636

Emil Jeřábek

Publication date: 1 June 2012

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5835

zbMATH Keywords

weak arithmeticsequential theory

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (7)

The small‐is‐very‐small principle ⋮ On \(\mathsf{Q}\) ⋮ Cofinal elementary extensions ⋮ Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories ⋮ THE ARITHMETIC OF THE EVEN AND THE ODD ⋮ The Interpretation Existence Lemma ⋮ Weak sequential theories of finite full binary trees

Cites Work

• Unnamed Item
• Pairs, sets and sequences in first-order theories
• Cuts, consistency statements and interpretations
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Some Prime Elements in the Lattice of Interpretability Types
• Axiomatizability by a schema

This page was built for publication: Sequence encoding without induction