Skip to main content

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

  • 129 Accesses

Abstract

Several classical twentieth century works in mathematical logic (e. g. by A. I. Malcev, A. Tarski and A. Robinson) have proved the significance of logic formalism, especially of first order predicate calculus, for studying different aspects of algebra. This formalism has become a working instrument of algebra. The attemps to formalize further aspects of algebraic systems on the one hand and a natural development of the theory of logical calculi on the other, gave three main extensions of first order classical calculus: second order logic and its different fragments, infinite languages, and languages with generalized quantifiers. Second order logic is better for reflecting typical algebraic notions and constructions. At the same time, as a more powerful language, it looses attractive properties of first order predicate calculus, such as: compactness, interpolation properties, axiomatizability, and others. Deeper understanding of this, following the development of the first order calculus resulted in the so-called abstract model theory. The abstract model theory, in turn, gave an impuls for developping the theory of generalized quantifiers. At the beginning, in the paper [10] of A. Mostowski, the languages with generalized quantifiers, have been constructed as tools for studying formalization of different aspects of particular algebraic theories. Later they have become a training field for checking ideas and hypotheses of abstract model theory. This is reflected in the general theory of generalized quantifiers of P. Lindström [7] and has resulted in such monsters as Q cf .

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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.

Similar content being viewed by others

References

  1. J. Barwise, Admissible Sets and Structures, Springer-Verlag, BerlinHeidelberg-New York, 1975.

    Book  Google Scholar 

  2. J. Barwise and S. Feferman (eds.), Model-Theoretical Logics, Springer-Verlag, Berlin-Heidelberg-New York, 1985.

    Google Scholar 

  3. S. Burris and R. Mckenzie, Decidability and Boolean representations, Memoirs of the American Mathematical Society 246 (1981).

    Google Scholar 

  4. S. Burris and H. P. Sankappanavar, A Cours in Universal Algebra, Springer-Verlag, Berlin-Heidelberg-New York, 1981.

    Book  Google Scholar 

  5. L. Heindorf, Regular ideals and Boolean pairs, Zeitschrift für Mathematische Logik und Grundlagenforschung 30 (1984), pp. 547 - 560.

    Article  Google Scholar 

  6. А. И. Кокорин, А. Г. Пинус, Вопросы разрешимости расширенных теорий, Успехи Математических Наук 33 (1978), pp. 49-84.

    Google Scholar 

  7. P. LinddtrÜm, First order predicate logic with generalized quantifiers, Theo-ria 32 (1966), pp. 186 - 195.

    Google Scholar 

  8. А. И. Малдев, К общей теории алгебраических систем, Математический сборинк (новая сериô)), 35 (77) (1954), pp. 3-20.

    Google Scholar 

  9. R. Mckenzie and M. Valoriote, The Structure of Decidable Locally Finite Varieties, Birkhäuser, Progress in Math. Series.

    Google Scholar 

  10. A. Mostowski, On generalization of quantifiers, Fundamenta Mathematicae 44 (1957), pp. 12 - 36.

    Google Scholar 

  11. Е. А. Палютни, О булевлых алгебрах имеющух категоричную теорию в логике 2-го поруадка, Алгебра и логика 10 (1971), pp.523-534.

    Google Scholar 

  12. А. Г. Пинус, Теории булеых алгебр в исчсчилжнии с квантором ?существует бескночно много?, Сибирский математический журнал 42 (1976), 1417-1421.

    Google Scholar 

  13. А. Г. Пинус, Исчисление с квантором элементарной эквивалентности Сибирский журнал 24 (1983), pp. 136-141.

    Google Scholar 

  14. А. Г. Пинус, О применении булеых степеней алгебраических систем, Сибирский математический журнал 26, (1985), pp. 117-125.

    Google Scholar 

  15. А. Г. Пинус, Конгруэнц-модулярные многообразя алгебр, Иркутск, Из-во Иркутского ун-са, 1986.

    Google Scholar 

  16. А. Г. Пинус, Исчисление с квантоморфности, Алгебраические системы, алгоритмические вопрсы и ЭВМ, Иркутск, Из-во Иркутского ун-та, 1986, pp. 102-121.

    Google Scholar 

  17. А. Г. Пинус, Теории 2-го порядка конгруенц-дистрибутивных многообразий, to appear.

    Google Scholar 

  18. M. O. Rabin, Definability of second-order theories and automate on infinite trees, Transactions of American Mathematical Society 141 (1969), pp. 1 - 35.

    Google Scholar 

  19. R. M. Robinson, Restricted set-theoretical definition in arithmetic, Pro- ceedings of the American Mathematical Society 9 (1958), pp. 238 - 242.

    Article  Google Scholar 

  20. M. Weese, The decidability of the theory of Boolean algebras with the quantifier ‘There exist infinitely many’, Proceedings of the American Mathematical Society 64 (1977), pp. 135 - 138.

    Google Scholar 

  21. M. Weese, Entscheidbarkeit der Theorie der Boolesch Algebren in Sprache mit Mâchtigkeitquantoren, Seminarbericht N4, Sektion Mathematik, Humboldt Universität, Berlin, 1977.

    Google Scholar 

  22. H. Werner, Discriminator Algebras, Akademà-Verlag, Berlin, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Pinus, A.G. (1995). Generalized Quantifiers in Algebra. In: Krynicki, M., Mostowski, M., Szczerba, L.W. (eds) Quantifiers: Logics, Models and Computation. Synthese Library, vol 249. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0524-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0524-0_11

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4540-9

  • Online ISBN: 978-94-017-0524-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics