References
Bell, J. L., Slomson, A. B.: Models and ultraproducts: An introduction. North-Holland, Amsterdam, 1969.
Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories, Fund. Math.49 (1961), 129–141.
Fraisse, R.: Sur le classification des systems de relations. Pub. Sci. de l'Université d'Alger I, No. I, Juin 1954.
Keisler, H. J.: Logic with the quantifier “there exist uncountably many”. Annals of Math. Logic,1 (1970), 1–94.
Lauchli, H., Leonard, J.: On the elementary theory of linear order. Fund. Math.49 (1966) 109–116.
Lipner, L. D.: Some aspects of generalized quantifiers. Ph. D. Thesis, Berkeley, 1970.
Mostowski, A.: On a generalization of quantifiers. Fund. Math.44 (1957), 12–36.
Mostowski, A., Tarski, A.: Arithmetical classes and types of well-ordered systems. Bull. Amer. Math. Soc.55 (1949), 65.
Rabin, M. O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc.141 (1969), 1–35.
Sierpinski, W.: Cardinal and ordinal numbers. Panstowe Wydawnictwo Naukowe, Warsaw, 1958.
Tarski, A.: Grundzüge des Systemenkalkül, II. Fund. Math.26 (1936), 283–301.
Vaught, R. L.: The completeness of logic with the added quantifier “there are uncountably many”. Fund. Math.54 (1964), 303–304.
Vinner, S.: Some results in Fuhrken's language, II. dupicated abstract.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Slomson, A.B. Generalized quantifiers and well orderings. Arch math Logik 15, 57–73 (1972). https://doi.org/10.1007/BF02019776
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02019776