Presburger arithmetic with uninterpreted function symbols is 1 1-complete

Journal of Symbolic Logic 56:637-642 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
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.
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.
Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
On the expansion (n, +, 2x) of Presburger arithmetic.Harvey Friedman - unknown
The shortest definition of a number in Peano arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
Decidability and incompleteness results for first-order temporal logics of linear time.Stephan Merz - 1992 - Journal of Applied Non-Classical Logics 2 (2):139-156.
Self-reference and the languages of arithmetic.Richard Heck - 2007 - Philosophia Mathematica 15 (1):1-29.
General arithmetic.Andrew Boucher - manuscript
Degrees of interpretation.John N. Phillips - 1972 - Philosophy of Science 39 (3):315-321.
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.
Proving consistency of equational theories in bounded arithmetic.Arnold Beckmann† - 2002 - Journal of Symbolic Logic 67 (1):279-296.
Learning Via Queries in $\lbrack +, < \rbrack$.William I. Gasarch, Mark G. Pleszkoch & Robert Solovay - 1992 - Journal of Symbolic Logic 57 (1):53 - 81.

Analytics

Added to PP
2014-04-06

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Joseph Y. Halpern
Cornell University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references