Game with numbers and axioms: Peano-Dedekind systems

MaRDI QIDQ4976996zbMATH OpenFDO

Authors Gigel Militaru, Ana-Loredana Agore

Publication date 3 August 2017

zbMATH Keywords

Hilbert recursion theoremnatural numbersPeano axiom

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• On certain axiomatizations of arithmetic of natural and integer numbers
• scientific article; zbMATH DE number 4097362
• scientific article; zbMATH DE number 3999883
• Reverse mathematics and Peano categoricity
• From Dedekind to Zermelo versus Peano to Gödel

Cited in

(8)

• Reachability is decidable in the numbers game
• On certain axiomatizations of arithmetic of natural and integer numbers
• On a Peano-type axiomatization for free monoids
• scientific article; zbMATH DE number 4097362 (Why is no real title available?)
• scientific article; zbMATH DE number 778297 (Why is no real title available?)
• Simple axioms that are obviously true in \(\mathbb{N}\)
• On the most suitable axiomatization of signed integers
• On the (In)Dependence of the Peano Axioms for Natural Numbers

This page was built for publication: Game with numbers and axioms: Peano-Dedekind systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976996)