Simple axioms that are obviously true in $\mathbb{N}$

Tomasz Połacik; Wim Ruitenburg

doi:rml/1081173835

Translator Disclaimer

November 2001 - November 2003 Simple axioms that are obviously true in $\mathbb{N}$

Tomasz Połacik, Wim Ruitenburg

Rev. Mod. Log. 9(1-2): 67-79 (November 2001 - November 2003).

Abstract

We discuss simple subtheories of Peano arithmetic over languages which include the monus function. The system $\mathrm{ZDL}$ corresponds with $\mathrm{PA}^-$. The choice of language permits our theories to have special universal axiomatizations; their classes of models have corresponding model theoretic properties.

Citation

Download Citation

Tomasz Połacik. Wim Ruitenburg. "Simple axioms that are obviously true in $\mathbb{N}$." Rev. Mod. Log. 9 (1-2) 67 - 79, November 2001 - November 2003.