Parametric Presburger arithmetic: complexity of counting and quantifier elimination

, , &
Mathematical Logic Quarterly 65 (2):237-250 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.201800068

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Bounding quantification in parametric expansions of Presburger arithmetic.John Goodrick - 2018 - Archive for Mathematical Logic 57 (5-6):577-591.
Presburger arithmetic, rational generating functions, and quasi-polynomials.Kevin Woods - 2015 - Journal of Symbolic Logic 80 (2):433-449.
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.
The Role of Quantifier Alternations in Cut Elimination.Philipp Gerhardy - 2005 - Notre Dame Journal of Formal Logic 46 (2):165-171.
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
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.
On the expansion (n, +, 2x) of Presburger arithmetic.Harvey Friedman - unknown
Remarks on formalized arithmetic and subsystems thereof.C. Brink - unknown
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.
Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
Quantifier elimination for modules with scalar variables.Lou van den Dries & Jan Holly - 1992 - Annals of Pure and Applied Logic 57 (2):161-179.
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.
Dependence Logic with a Majority Quantifier.Arnaud Durand, Johannes Ebbing, Juha Kontinen & Heribert Vollmer - 2015 - Journal of Logic, Language and Information 24 (3):289-305.
Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.

Analytics

Added to PP
2019-09-04

Downloads
3 (#1,686,544)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Quantifier elimination for modules with scalar variables.Lou van den Dries & Jan Holly - 1992 - Annals of Pure and Applied Logic 57 (2):161-179.

Add more references