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 .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Barwise, Admissible Sets and Structures, Springer-Verlag, BerlinHeidelberg-New York, 1975.
J. Barwise and S. Feferman (eds.), Model-Theoretical Logics, Springer-Verlag, Berlin-Heidelberg-New York, 1985.
S. Burris and R. Mckenzie, Decidability and Boolean representations, Memoirs of the American Mathematical Society 246 (1981).
S. Burris and H. P. Sankappanavar, A Cours in Universal Algebra, Springer-Verlag, Berlin-Heidelberg-New York, 1981.
L. Heindorf, Regular ideals and Boolean pairs, Zeitschrift für Mathematische Logik und Grundlagenforschung 30 (1984), pp. 547 - 560.
А. И. Кокорин, А. Г. Пинус, Вопросы разрешимости расширенных теорий, Успехи Математических Наук 33 (1978), pp. 49-84.
P. LinddtrÜm, First order predicate logic with generalized quantifiers, Theo-ria 32 (1966), pp. 186 - 195.
А. И. Малдев, К общей теории алгебраических систем, Математический сборинк (новая сериô)), 35 (77) (1954), pp. 3-20.
R. Mckenzie and M. Valoriote, The Structure of Decidable Locally Finite Varieties, Birkhäuser, Progress in Math. Series.
A. Mostowski, On generalization of quantifiers, Fundamenta Mathematicae 44 (1957), pp. 12 - 36.
Е. А. Палютни, О булевлых алгебрах имеющух категоричную теорию в логике 2-го поруадка, Алгебра и логика 10 (1971), pp.523-534.
А. Г. Пинус, Теории булеых алгебр в исчсчилжнии с квантором ?существует бескночно много?, Сибирский математический журнал 42 (1976), 1417-1421.
А. Г. Пинус, Исчисление с квантором элементарной эквивалентности Сибирский журнал 24 (1983), pp. 136-141.
А. Г. Пинус, О применении булеых степеней алгебраических систем, Сибирский математический журнал 26, (1985), pp. 117-125.
А. Г. Пинус, Конгруэнц-модулярные многообразя алгебр, Иркутск, Из-во Иркутского ун-са, 1986.
А. Г. Пинус, Исчисление с квантоморфности, Алгебраические системы, алгоритмические вопрсы и ЭВМ, Иркутск, Из-во Иркутского ун-та, 1986, pp. 102-121.
А. Г. Пинус, Теории 2-го порядка конгруенц-дистрибутивных многообразий, to appear.
M. O. Rabin, Definability of second-order theories and automate on infinite trees, Transactions of American Mathematical Society 141 (1969), pp. 1 - 35.
R. M. Robinson, Restricted set-theoretical definition in arithmetic, Pro- ceedings of the American Mathematical Society 9 (1958), pp. 238 - 242.
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.
M. Weese, Entscheidbarkeit der Theorie der Boolesch Algebren in Sprache mit Mâchtigkeitquantoren, Seminarbericht N4, Sektion Mathematik, Humboldt Universität, Berlin, 1977.
H. Werner, Discriminator Algebras, Akademà-Verlag, Berlin, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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