Skip to main content
SpringerLink
Log in

Henkin Quantifiers

  • Chapter
Quantifiers: Logics, Models and Computation

Part of the book series: Synthese Library ((SYLI,volume 248))

Abstract

In the paper we give a survey of all known results (as far as we have been able to determine) concerning logics with Henkin quantifiers, known also as finite partially ordered quantifiers, branching or branched quantifiers. We concentrate on logical problems, presenting philosophical and linguistic discussions of the subject only briefly.

We would like to express our gratitude to Mark Brown, Lauri Hella, Kerkko Luosto, Dag Westerståhl for their detailed remarks to the first version of the paper. We have obtained also some suggestions from: Jon Barwise, Andreas Blass, and Wolfgang Degen — we are very obliged to all of them.

This work has been supported by Polish Government Grant Projekt Badawczy “KWANTYFIKATORY”.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. J. Barwise, Some applications of Henkin quantifiers, Israel Journal of Mathematics 25 (1976), pp. 47–63.

    Article  Google Scholar 

  2. K. J. Barwise, On Branching Quantifiers in English, Journal of Philosophical Logic 8 (1979), pp. 47–80.

    Article  Google Scholar 

  3. K. J. Barwise, Model-theoretic logics: Background and aims, in Model-Theoretic Logics, J. Barwise and S. Feferman (eds.), Springer-Verlag 1985, pp. 3–23.

    Google Scholar 

  4. K. J. Barwise and R. Cooper, Generalized quantifiers and natural language, Linguistics and Philosophy 4 (1981), pp. 159–219.

    Google Scholar 

  5. K. J. Barwise and J. S. Schlipf, An introduction to recursively saturated and resplendent models, The Journal of Symbolic Logic 41 (1976), pp. 531–536.

    Article  Google Scholar 

  6. A. Baudisch, The theory of abelian p-groups with the quantifier I is decidable, Fundamenta Matematicae 108 (1980), pp. 183–197.

    Google Scholar 

  7. J. Van Benthem, Questions about quantifiers, Journal of Symbolic Logic 49 (1984), pp. 443–466.

    Google Scholar 

  8. A. Blass and Y. Gurevich, Henkin quantifiers and complete problems, Annals of Pure and Applied Logic 32 (1986), pp 1–16.

    Article  Google Scholar 

  9. M. Brown, Operators on branched quantifiers, Quantifiers II M. Krynicki, M. Mostowski, L.W. Szczerba (eds.) 1995 pp. 21–61.

    Google Scholar 

  10. C. C. Chang and H. J. Keisler, Model Theory, North-Holland Publishing Company, 1990.

    Google Scholar 

  11. C. C. Chang and R. C. Lee, Symbolic Logic and Automated Theorem Proving, Academic Press 1973.

    Google Scholar 

  12. J. R. Cowles, The Henkin quantifier and real closed fields, Zeitschrift fir Mathematische Logik und Grundlagen der Mathematik 27 (1981), pp. 549–555.

    Article  Google Scholar 

  13. H.-D. Ebbinghaus, Extended logics: The general framework, in Model-Theoretic Logics, J. Barwise and S. Feferman (eds.), Springer-Verlag 1985, pp. 25–76.

    Google Scholar 

  14. H.-D. Ebbinghaus, On the model theory of some generalized quantifiers, in this volume 1995.

    Google Scholar 

  15. A. Ehrenfeucht, Decidability of the theory of one function, Amerinan Mathematical Society Notes 6 (1959), p. 268.

    Google Scholar 

  16. H. B. Enderton, Finite partially-ordered quantifiers, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 16 (1970), pp. 393–397.

    Article  Google Scholar 

  17. R. Fagin, Generalized first order spectra and polynomial-time recognizable sets, SIAM-AMS Proceedings 7 (1974), pp. 43–73.

    Google Scholar 

  18. G. Fauconnier, Do quantifiers branch?, in Theoretical Linguistics 1974, pp. 555–578.

    Google Scholar 

  19. D. M. Gabbay and J. M. E. Moravcsik, Branching quantifiers, English,and Montague grammar, in Theoretical Linguistics, 1974 pp. 141–157.

    Google Scholar 

  20. G. Gentzen, Untersuchungen über das Logische Schließen I, Mathematische Zeitschrift 39 (1934), pp. 176–210.

    Article  Google Scholar 

  21. F. Guenthner and J. Hoepelman, A note on representation of “Branching quantifiers”,in Theoretical Linguistics, 1974 pp. 285291.

    Google Scholar 

  22. D. Harel, Characterizing second order logic with first order quantifiers, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 25 (1979), pp. 419–422.

    Article  Google Scholar 

  23. L. Hella, Definability hierarchies of generalized quantifiers, Annals of Pure and Applied Logic 43 (1989), pp. 235–271.

    Article  Google Scholar 

  24. L. Hella and M. Krynicki, Remarks on the Cartesian closure, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 37 (1991), pp. 539–545.

    Article  Google Scholar 

  25. L. Hella and K. Luosto, Finite generation problem and n-ary quantifiers, in this volume 1995.

    Google Scholar 

  26. L. Hella and G. Sandu, Partially ordered connectives and finite graphs, Quantifiers II M. Krynicki, M. Mostowski, L.W. Szczerba (eds.) 1995 pp. 79–88.

    Google Scholar 

  27. L. Henkin, Some remarks on infinitely long formulae, in Infinitistic Methods, Pergamon Press, New York, and Polish Scientific Publishers, Warsaw, 1961, pp. 167–183.

    Google Scholar 

  28. H. Herre, M. Krynicki, A. Pinus and J. Väänänen, The Hârtig quantifier. A survey, The Journal of Symbolic Logic 56 (1991), pp. 1153–1183.

    Article  Google Scholar 

  29. D. Hilbert and P. Bernays Grundlagen der Mathematik I, II, Berlin, 1934, 1939.

    Google Scholar 

  30. J. Hintikka, Quantifiers vs. quantification theory,Dialectica 27 (1974), pp. 329–358 (also in Linguistic Iniquiry 5 (1974)).

    Google Scholar 

  31. J. Hintikka, Partially ordered quantifiers vs. partially ordered ideas, Dialectica 30 (1976), pp. 89–99.

    Article  Google Scholar 

  32. I. L. Humberstone, Critical notice, Mind 96 (1987), pp. 99–107.

    Article  Google Scholar 

  33. S. Jaskowski, On the rules of suppositions in formal logic, Studia Logica 1 (1934), pp. 5–32.

    Google Scholar 

  34. A. Krawczyk and M. Krynicki, Ehrenfeucht games for generalized quantifiers, in Set Theory and Hierarchy Theory, W. Marek, M. Srebrny and A. Zarach (eds.) Lectures Notes in Mathematics 537, Springer-Verlag, Berlin, 1976, pp. 145–152.

    Google Scholar 

  35. M. Krynicki, Henkin quantifier and decidability, in Proceedings of the Symposium on Mathematical Logic in Helsinki’75, S. Miettinen and J. V ï.nânen (eds.), 1977, pp. 89–90.

    Google Scholar 

  36. M. Krynicki, On the expressive power of the language using the Henkin quantifier, in Essays on Mathematical and Philosophical Logic, K. J. J. Hintikka, I. Niiniluoto and E. Saarinen (eds.), 1979, pp. 259–265.

    Chapter  Google Scholar 

  37. M. Krynicki, On some approximations of second order language, unpublished manuscript, pp. 12.

    Google Scholar 

  38. M. Krynicki, Notion of interpretation and nonelementary languages, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 34 (1988), pp. 541–552.

    Article  Google Scholar 

  39. M. Krynicki, Hierarchies of finite partially ordered connectives and quantifiers, Mathematical Logic Quarterly 39 (1993).

    Google Scholar 

  40. M. Krynicki and A. H. Lachlan, On the semantics of the Heukin quantifier, The Journal of Symbolic Logic 44 (1979), pp. 184–200.

    Article  Google Scholar 

  41. M. Krynicki and M. Mostowski, Decidability problems in language with Henkin quantifiers, Annals of Pure and Applied Logic 58 (1992), pp. 149–172.

    Article  Google Scholar 

  42. M. Krynicki and J. Väänanen, Henkin and function quantifiers, Annals of Pure and Applied Logic 43 (1989), pp. 273–292.

    Article  Google Scholar 

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

    Google Scholar 

  44. P. Lindström, On extension of elementary logic, Theoria 35 (1969), pp. 1–11.

    Article  Google Scholar 

  45. E. G. K. Lopez-Escobar, A non-interpolation theorem, Bulletin de l’Academie Polonaise des Sciences 17 (1969), pp. 109–112.

    Google Scholar 

  46. E. G. K. Lopez-Escobar, Formalizing a non-linear Henkin quantifier, Fundamenta Mathematicae 138 (1991), pp. 83–101.

    Google Scholar 

  47. A. Macintyre, Ramsey quantifiers in arithmetic, in Model Theory of Algebra and Arithmetic, L. Pacholski, J. Wierzejewski, and A. J.Wilkie (eds), Lecture Notes in Mathematics, vol. 834, Springer-Verlag, Berlin and New York, 1980, pp. 186–210.

    Google Scholar 

  48. M. Magidor and J. I. Malitz, Compact extensions of L(Q). Part 1(a), Annals of Mathematical Logic 11 (1977), pp. 217–261.

    Article  Google Scholar 

  49. J. A. Makowsky and Pnueli, Computable quantifiers and logics over finite structures, in this volume.

    Google Scholar 

  50. A. H. Mekler and S. Shelah, Stationary logic and its friends II, Notre Dame Journal of Formal Logic 27 (1986), pp. 39–50.

    Article  Google Scholar 

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

    Google Scholar 

  52. M. Mostowski, The relational semantics for branched quantifiers, in Mathematical Logic and its Application, D. Skordev (ed.), Plenum Press, 1987, pp. 315–322.

    Google Scholar 

  53. M. Mostowski, Branched quantifiers with dualization, technical report for Research Project RPBP III. 24, Bialystok, 1987.

    Google Scholar 

  54. M. Mostowski, Reasoning with branched quantifiers, technical report for Research Project RPBP III. 24, Bialystok, 1987.

    Google Scholar 

  55. M. Mostowski, An extension of the logic with branched quantifiers, 8th International Congress of Logic, Methodology and Philosophy of Science, Abtracts, vol. 5, part 3, Moscow, 1987, pp. 261–263.

    Google Scholar 

  56. M. Mostowski, Pure logic with branched quantifiers, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 35 (1989), pp. 45–48.

    Article  Google Scholar 

  57. M. Mostqwski, Divisibility quantifiers, in Bulletin of the Section of Logic 20, no. 2 (1990), pp. 67–70.

    Google Scholar 

  58. M. Mostowski, Branched Quantifiers, Rozprawy Uniwer- sytetu Warszawskiego, Dzial Wydawnictw Filii UW w Bialymstoku, 1991.

    Google Scholar 

  59. M. Mostqwski, Arithmetic with the Henkin quantifier and its generalizations, in Seminaire du Laboratoire Logique, Algorithmique et Informatique Clermontois, Volume II (1989–1990), F. Gaillard and D. Richard (eds), 1991, pp. 1–25.

    Google Scholar 

  60. M. Mostowski 1995] M. Mostqwski, Quantifiers definable by second order means, Quantifiers II M. Krynicki, M. Mostowski, L.W. Szczerba (eds.) 1995 pp. 181214.

    Google Scholar 

  61. D. Mundici, Other quantifiers: An overview, in Model-Theoretic Logics, J. Barwise and S. Feferman (eds.), 1985, pp. 211–233.

    Google Scholar 

  62. J. Mycielski, The meaning of pure mathematics, Journal of Philosophical Logic 18 (1989), pp. 315–320.

    Article  Google Scholar 

  63. T. Patton, On Humberstone’s semantics for branching quantifiers, Mind 98 (1989), pp. 429–433.

    Article  Google Scholar 

  64. T. E. Patton, On the ontology of branching quantifiers, in Journal of Philosophical Logic 20 (1991), pp. 205–223.

    Google Scholar 

  65. D. Prawitz, Natural Deduction, Almquist and Wiksell, Stockholm, 1965.

    Google Scholar 

  66. W. V. O. Quine, On what there is, in From a Logical Point of View, Harvard University Press, Cambridge, Massachusetts, 1964.

    Google Scholar 

  67. W. V. O. Quine, Existence and quantification, in Ontological Relativity and Other Essays, Columbia University Press, New York, 1969, pp. 91–113.

    Google Scholar 

  68. W. V. O. Quine, Philosophy of Logic, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1970.

    Google Scholar 

  69. W. Rudin, Principles of Mathematical Analysis, McGraw-Hill Book Company, 1976.

    Google Scholar 

  70. G. Sandu and J. Vaanånen, Partially ordered connectives, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 37 (1992), pp. 363–372.

    Google Scholar 

  71. J. H. Schmerl and S. G. Simpson, On the role of Ramsey quantifiers in first order arithmetic, The Journal of Symbolic Logic 47 (1982), pp. 423–435.

    Article  Google Scholar 

  72. E. Stenius, Comments on Jaakko Hintikka’s paper “Quantifiers vs. Quantification Theory”, Dialectica 30 (1976), pp. 89–99.

    Article  Google Scholar 

  73. L. W. Szczerba, Interpretability of elementary theories, in Logic, Foundation of Mathematics and Computability Theory, Reidel Publ. Comp. Dordrecht, 1977, pp. 129–145.

    Google Scholar 

  74. G. Takeuti, Proof Theory, North-Holland Pub. Co., 1987 (first edition 1975).

    Google Scholar 

  75. B. A. Trakhtenbrot, Impossibility of an algorithm for the decision problem on finite classes, Doklady 70 (1950), pp. 569–572.

    Google Scholar 

  76. W. J. Walkoe, Jr., Finite partially-ordered quantification, The Journal of Symbolic Logic 35 (1970), pp. 535–555.

    Article  Google Scholar 

  77. D. Westerståhl, Branching generalized quantifiers and natural language, Generalized Quantifiers, P. Gärdenfors (ed.), D. Reidel Pub. Co., 1987, pp. 269–298.

    Google Scholar 

  78. D. Westerståhl, Quantifiers in natural language, in this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warsaw, Poland

    Michał Krynicki & Marcin Mostowski

Authors
  1. Michał Krynicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Mostowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Warsaw, Poland

    Michał Krynicki

  2. Department of Philosophy, University of Warsaw, Poland

    Marcin Mostowski

  3. Siedlce University, Poland

    Lesław W. Szczerba

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Krynicki, M., Mostowski, M. (1995). Henkin Quantifiers. In: Krynicki, M., Mostowski, M., Szczerba, L.W. (eds) Quantifiers: Logics, Models and Computation. Synthese Library, vol 248. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0522-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0522-6_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4539-3

  • Online ISBN: 978-94-017-0522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation