Skip to main content
SpringerLink
Log in

On simplicity of formulas

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Simple formula should contain only few quantifiers. In the paper the methods to estimate quantity and quality of quantifiers needed to express a sentence equivalent to given one.

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. J. Barwise and S. Feferman, Model-Theoretic Logics, in series Perspectives in Mathematical Logic, Springer-Verlag, 1985.

  2. X. Caicedo, Back-and-forth systems for arbitrary quantifiers, Mathematical Logic in Latin America, A. I. Arruda, R. Chuaqui and N.C.A. da Costa (eds.), North-Holland Publ. Co. (1980), pp. 83–102.

  3. C. C. Chang and H. J. Keisler, Model Theory, North-Holland Publ. Co., 1973.

  4. P. M. Cohn, Universal Algebra, Harper & Row Publ. Co., 1965.

  5. A. Ehrenfeucht, An application of games to the completeness problem for formalised theories, Fundamenta Mathematicae 49 (1961), pp. 129–141.

    Google Scholar 

  6. J. Flum, First-order logic and it extensions, Lecture Notes in Mathematic 488, Springer-Verlag (1975), pp. 248–310.

  7. R. Fraissé, Sur quelques classifications des systèmes de relations, Publ. Sci. Univ. Alger, Ser. A, vol. 1 (1954), pp. 35–182.

    Google Scholar 

  8. K. Härtig, Über einen Quantifikator mit zwei Wirkungsbereichen, in Colloq. sur les fondements des mathem. et leurs applications, Tihany 1962, Budapest/Paris (1965), pp. 31–36.

  9. L. Henkin, J. D. Monk and A. Tarski, Cylindric Algebras, North-Holland Publ. Co., 1971.

  10. N. Immerman, Upper and lower bounds for first-order expressibility, Journal Comp. Syst. Sci. 25 (1982), pp. 76–98.

    Google Scholar 

  11. N. Immerman and D. Kozen, Definability with bounded number of bound variables, Proc. Symp. on Logic in Comp. Sc. 1987, pp. 236–244.

  12. H. J. Keisler, Theory of models with generalised atomic formulas, Journal of Symbolic Logic 25 (1960), pp. 1–26.

    Google Scholar 

  13. H. J. Keisler, Logic with the quantifier “there exist uncountable many”, Annals of Mathematical Logic 1 (1970), pp. 1–93.

    Google Scholar 

  14. S. C. Kleene, Recursive predicates and quantifiers, Transaction of the American Mathematical Society 53 (1943), pp. 41–73.

    Google Scholar 

  15. A. Krawczyk and M. Krynicki, Ehrenfeucht games for generalized quantifiers, Lecture Notes in Mathematic 537 (1976), pp. 145–152.

    Google Scholar 

  16. M. Krynicki, Linear Ordered Quantifiers, to appear in Bull. Pol. Acad. of Sc. ser. Mathematics.

  17. M. Krynicki, Quantifiers determined by partial orderings, to appear in Zeitsch. für Math. Logik und Grundlagenforsch.

  18. M. Krynicki and L. W. Szczerba, Refinement of Kleene-Mostowski hierarchy for formulas, Seminarberichte Humboldt Universität zu Berlin, Proceedings of the 4TH Easter Conference on Model Theory, Humboldt Universität, Berlin 1986.

    Google Scholar 

  19. H. Lessan, On models of arithmetics, Doctoral thesis, Manchester, 1978.

  20. P. Lindström, First order predicate logic with generalized quantifiers, Theoria 32 (1966), pp. 186–195.

    Google Scholar 

  21. J. Łoś, On the extending of models I, Fundamenta Mathematicae 42 (1955), pp. 38–54.

    Google Scholar 

  22. J. Łoś and R. Suszko, On the extending of models IV: Infinite sums of models, Fundamenta Mathematicae 44 (1957), pp. 52–60.

    Google Scholar 

  23. J. A. Makowsky and S. Tulipani, Some model theory for monotone quantifiers, Archive für Mathemat. Logik und Grundlagenforsch. 18 (1977), pp. 115–134.

    Google Scholar 

  24. A. Mostowski, On a generalization of quantifiers, Fundamenta Mathematicae 44 (1957), pp. 12–36.

    Google Scholar 

  25. A. Mostowski, On definable sets of positive integers, Fundamenta Mathematicae 14 (1957), pp. 52–60.

    Google Scholar 

  26. A. Mostowski, Thirty Years of Foundational Studies, Barnes and Noble Inc., 1966.

  27. C. Ryll-Nardzewski, The role of the axiom of induction in elementary arithmetic, Fundamenta Mathematicae 39 (1952), pp. 239–263.

    Google Scholar 

  28. M. Schacher and E. G. Straus, Some applications of a non-Archimedian analogue of Descartes rule of signs, Acta Arithmetica 25 (1974), pp. 353.

    Google Scholar 

  29. A. M. Sette and J. S. Sette, Functionalisation of first-order language with finitely many predicates, in Mathematical Logic, A. I. Arruda, N.C.A. da Costa and R. Chuaqui (eds.), Marcel Dekker Inc., 1978, pp. 7–11.

  30. A. M. Sette and L. W. Szczerba, Characterisations of elementary interpretations in category theory, in Mathematical Logic, L.P. de Alcantara (ed.), Marcel Dekker Inc., 1985, pp. 243–292.

  31. L. W. Szczerba, Rough Quantifiers, Bull. Pol. Acad. of Sc. ser. Mathematics 35 (1987), pp. 251–254.

    Google Scholar 

  32. A. Tarski, Contributions to the theory of models, Indagationes Math. 16 (1954), pp. 572–588.

    Google Scholar 

  33. M. Weese, Generalized Ehrenfeucht games, Fundamenta Mathematicae 109 (1980), pp. 103–112.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University, Warsaw, Poland

    Michał Krynicki & Lesław Szczerba

  2. Agriculture and Pedagogical College, 08-110, Siedlce, Poland

    Michał Krynicki & Lesław Szczerba

Authors
  1. Michał Krynicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lesław Szczerba
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krynicki, M., Szczerba, L. On simplicity of formulas. Stud Logica 49, 401–419 (1990). https://doi.org/10.1007/BF00370372

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation