Skip to main content
Log in

A note on definability in fragments of arithmetic with free unary predicates

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We carry out a study of definability issues in the standard models of Presburger and Skolem arithmetics (henceforth referred to simply as Presburger and Skolem arithmetics, for short, because we only deal with these models, not the theories, thus there is no risk of confusion) supplied with free unary predicates—which are strongly related to definability in the monadic SOA (second-order arithmetic) without × or + , respectively. As a consequence, we obtain a very direct proof for \({\Pi^1_1}\) -completeness of Presburger, and also Skolem, arithmetic with a free unary predicate, generalize it to all \({\Pi^1_n}\) -levels, and give an alternative description of the analytical hierarchy without × or + . Here ‘direct’ means that one explicitly m-reduces the truth of \({\Pi^1_1}\) -formulae in SOA to the truth in the extended structures. Notice that for the case of Presburger arithmetic, the \({\Pi^1_1}\) -completeness was already known, but the proof was indirect and exploited some special \({\Pi^1_1}\) -completeness results on so-called recurrent nondeterministic Turing machines—for these reasons, it was hardly able to shed any light on definability issues or possible generalizations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadi M., Halpern J.Y.: Decidability and expressiveness for first-order logics of probability. Inf. Comput. 112(1), 1–36 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bès, A.: A survey of arithmetical definability, A tribute to Maurice Boffa, Soc. Math. Belgique, 1–54 (2002)

  3. Bès A., Richard D.: Undecidable extensions of Skolem Arithmetic. J. Symb. Log. 63(2), 379–401 (1998)

    Article  MATH  Google Scholar 

  4. Downey, P.: Undecidability of Presburger Arithmetic with a Single Monadic Predicate Letter, Technical Report 18-72. Center for Research in Computing Technology, Harvard University, Cambridge (1972)

  5. Ershov Yu.L., Lavrov I.A., Taimanov A.D., Taitslin M.A.: Elementary theories. Russ. Math. Surv. 20(4), 35–105 (1965)

    Article  Google Scholar 

  6. Gaifman, H.: On local and nonlocal properties. In: Proceedings of the Herbrand Symposium ’81, Studies in Logic and the Foundations of Mathematics 107, pp. 105–135. North-Holland, Amsterdam (1982)

  7. Garfunkel S., Schmerl J.H.: The undecidability of theories of groupoids with an extra predicate. Proc. AMS 42(1), 286–289 (1974)

    Article  MathSciNet  Google Scholar 

  8. Gurevich Yu.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 479–506. Springer, Berlin (1985)

    Google Scholar 

  9. Halpern J.Y.: Presburger arithmetic with unary predicates is \({\Pi_1^1}\) complete. J. Symb. Log. 56(2), 637–642 (1991)

    Article  MATH  Google Scholar 

  10. Harel D., Pnueli A., Stavi J.: Propositional dynamic logic of nonregular programs. J. Comput. Syst. Sci. 26(2), 222–243 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  11. Korec I.: A list of arithmetical structures complete with respect to the first-order definability. Theor. Comput. Sci. 257, 115–151 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Putnam H.: Decidability and essential undecidability. J. Symb. Log. 22, 39–54 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  13. Robinson J.: Definability and decision problems in arithmetic. J. Symb. Log. 14, 98–114 (1949)

    Article  MATH  Google Scholar 

  14. Rogers H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)

    MATH  Google Scholar 

  15. Simpson S.G.: Subsystems of Second Order Arithmetic. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  16. Speranski, S.O.: Complexity for probability logic with quantifiers over propositions. J. Log. Comput. (2012). doi:10.1093/logcom/exs041

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stanislav O. Speranski.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Speranski, S.O. A note on definability in fragments of arithmetic with free unary predicates. Arch. Math. Logic 52, 507–516 (2013). https://doi.org/10.1007/s00153-013-0328-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-013-0328-9

Keywords

Mathematics Subject Classification (2000)

Navigation