Skip to main content
SpringerLink
Log in

Decidability of a portion of the predicate calculus

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We show decidability of the existence of a model (a finite model) for sentences with the string of quantifiers ∀x(∃y 1...y n), for a language with equality, one one-place function, predicates and constants.

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

Access this article

Log in via an institution

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. B. Dreben and D. Goldfarb, a book in preparation.

  2. Y. Gurevich,The decision problem for standard classes, J. Symbolic Logic41 (1976), 460–464.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. O. Rabin,Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc.141 (1969), 1–35.

    Article  MATH  MathSciNet  Google Scholar 

  4. S. Shelah,Various results in mathematical logic, Notices Amer. Math. Soc.22 (1975), A-23(75T-E4).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel

    Saharon Shelah

Authors
  1. Saharon Shelah
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

I would like to thank the Israel Academy of Science and Humanities for partially supporting this research by a grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shelah, S. Decidability of a portion of the predicate calculus. Israel J. Math. 28, 32–44 (1977). https://doi.org/10.1007/BF02759780

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02759780

Keywords

Search

Navigation