On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
From MaRDI portal
Publication:3980089
DOI10.1080/014453409108837187zbMath0741.03027OpenAlexW2068523159WikidataQ58447848 ScholiaQ58447848MaRDI QIDQ3980089
Publication date: 26 June 1992
Published in: History and Philosophy of Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/014453409108837187
Related Items (23)
On representations of intended structures in foundational theories ⋮ Truncations of ordered abelian groups ⋮ Mechanical Proofs of Properties of the Tribonacci Word ⋮ Sato-Tate theorem for families and low-lying zeros of automorphic \(L\)-functions. Appendix A by Robert Kottwitz, and Appendix B by Raf Cluckers, Julia Gordon and Immanuel Halupczok. ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ A Plethora of Polynomials: A Toolbox for Counting Problems ⋮ Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials ⋮ The unreasonable ubiquitousness of quasi-polynomials ⋮ A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ The lattice of definability: origins, recent developments, and further directions ⋮ On Presburger arithmetic extended with non-unary counting quantifiers ⋮ Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version ⋮ A DEFINABLE -ADIC ANALOGUE OF KIRSZBRAUN’S THEOREM ON EXTENSIONS OF LIPSCHITZ MAPS ⋮ The Frobenius postage stamp problem, and beyond ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Definable sets up to definable bijections in Presburger groups ⋮ Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior ⋮ Theories of initial segments of standard models of arithmetics and their complete extensions ⋮ Integrability of oscillatory functions on local fields: transfer principles ⋮ ON THE COMMUTATIVITY OF PULL-BACK AND PUSH-FORWARD FUNCTORS ON MOTIVIC CONSTRUCTIBLE FUNCTIONS ⋮ Bounded minimalisation and bounded counting in argument-bounded idc's ⋮ Domain mu-calculus ⋮ Modelization of deterministic rational relations
This page was built for publication: On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
