Decidability bounds for Presburger arithmetic extended by sine

Annals of Pure and Applied Logic 175 (10):103487 (2024)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

External links

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

Through your library

Similar books and articles

Groups definable in Presburger arithmetic.Juan Pablo Acosta - 2025 - Annals of Pure and Applied Logic 176 (1):103507.
Definable groups in models of Presburger Arithmetic.Alf Onshuus & Mariana Vicaría - 2020 - Annals of Pure and Applied Logic 171 (6):102795.
On the Presburger fragment of logics with multiteam semantics.Richard Wilke - 2022 - Annals of Pure and Applied Logic 173 (10):103120.
Quantifier elimination for modules with scalar variables.Lou van den Dries & Jan Holly - 1992 - Annals of Pure and Applied Logic 57 (2):161-179.
Decidability and the number of countable models.Terrence Millar - 1984 - Annals of Pure and Applied Logic 27 (2):137-153.
Decidability questions for a ring of Laurent polynomials.Alla Sirokofskich - 2012 - Annals of Pure and Applied Logic 163 (5):615-619.
Lower complexity bounds in justification logic.Samuel R. Buss & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (7):888-905.
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Transductions in arithmetic.Albert Visser - 2016 - Annals of Pure and Applied Logic 167 (3):211-234.

Analytics

Added to PP
2024-06-14

Downloads
9 (#1,534,659)

6 months
4 (#1,279,871)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Eion Blanchard
University of Florida

Citations of this work

No citations found.

Add more citations

References found in this work

Notes on local o‐minimality.Carlo Toffalori & Kathryn Vozoris - 2009 - Mathematical Logic Quarterly 55 (6):617-632.
Turing meets Schanuel.Angus Macintyre - 2016 - Annals of Pure and Applied Logic 167 (10):901-938.

Add more references