- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Rigid models of Presburger arithmetic
Mathematical Logic Quarterly 65 (1):108-115 (2019)
Abstract
We present a description of rigid models of Presburger arithmetic (i.e., ‐groups). In particular, we show that Presburger arithmetic has rigid models of all infinite cardinalities up to the continuum, but no larger.Author's Profile
My notes
Similar books and articles
A note on definability in fragments of arithmetic with free unary predicates.Stanislav O. Speranski - 2013 - Archive for Mathematical Logic 52 (5-6):507-516.
Bounding quantification in parametric expansions of Presburger arithmetic.John Goodrick - 2018 - Archive for Mathematical Logic 57 (5-6):577-591.
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
Model-checking CTL* over flat Presburger counter systems.Stéphane Demri, Alain Finkel, Valentin Goranko & Govert van Drimmelen - 2010 - Journal of Applied Non-Classical Logics 20 (4):313-344.
On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation.Mojżesz Presburger & Dale Jabcquette - 1991 - History and Philosophy of Logic 12 (2):225-233.
Ω1-like recursively saturated models of Presburger's arithmetic.Victor Harnik - 1986 - Journal of Symbolic Logic 51 (2):421-429.
Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
On Decidable Extensions of Presburger Arithmetic: From A. Bertrand Numeration Systems to Pisot Numbers.Françoise Point - 2000 - Journal of Symbolic Logic 65 (3):1347-1374.
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.Christian Michaux & Roger Villemaire - 1996 - Annals of Pure and Applied Logic 77 (3):251-277.
Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1):143-157.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Linear-time temporal logics with Presburger constraints: an overview ★.Stéphane Demri - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):311-347.
Presburger arithmetic with uninterpreted function symbols is 1 1-complete.J. Halpern - 1991 - Journal of Symbolic Logic 56:637-642.
Analytics
Added to PP
2019-04-12
Downloads
16 (#901,303)
6 months
5 (#625,697)
2019-04-12
Downloads
16 (#901,303)
6 months
5 (#625,697)
Historical graph of downloads
Author's Profile
References found in this work
Models with second order properties IV. A general method and eliminating diamonds.Saharon Shelah - 1983 - Annals of Pure and Applied Logic 25 (2):183-212.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-55b469568f-bzrbm uwo