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: 93,127

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.
Presburger arithmetic, rational generating functions, and quasi-polynomials.Kevin Woods - 2015 - Journal of Symbolic Logic 80 (2):433-449.
Remarks on formalized arithmetic and subsystems thereof.C. Brink - unknown
M. H. Löb. Concatenation as basis for a complete system of arithmetic. The journal of symbolic logic, vol. 18 (1953), pp. 1–6. - M. H. Löb. Formal systems of constructive mathematics. The journal of symbolic logic, vol. 21 (1956), pp. 63–75. [REVIEW]H. Hermes & H. A. Pogorzelski - 1970 - Journal of Symbolic Logic 35 (1):150-150.
Logic and Arithmetic. Volume 1. Natural Numbers.Michael D. Resnik - 1982 - Journal of Symbolic Logic 47 (3):708-713.
Proving consistency of equational theories in bounded arithmetic.Arnold Beckmann† - 2002 - Journal of Symbolic Logic 67 (1):279-296.
Review: J. D. Halpern, H. Lauchli, A Partition Theorem; J. D. Halpern, A. Levy, The Boolean Prime Ideal Theorem Does Not Imply the Axiom of Choice. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2003 - Bulletin of Symbolic Logic 9 (1):45-47.
Halpern J. D. and Läuchli H.. A partition theorem. Transactions of the American Mathematical Society, vol. 124 , pp. 360–367.Halpern J. D. and Lévy A.. The Boolean prime ideal theorem does not imply the axiom of choice. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 83–134. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.
Arithmetic complexity of the predicate logics of certain complete arithmetic theories.Valery Plisko - 2001 - Annals of Pure and Applied Logic 113 (1-3):243-259.

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