Abstract
Among the second-order quantifiers ranging over relations satisfying a first-order sentence, there are four for which any other one is bi-interpretable with one of them: the trivial, monadic, permutational, and full second order.
Similar content being viewed by others
References
Bell, J. L. and A. B. Slomson,Models and Ultraproducts, North Holland, 1969.
P. Erdös and R. Rado,Intersection theorems for systems of sets, J. London Math. Soc.44 (1969), 467–479.
Ju. L. Ershov,Undecidability of theories of symmetric and simple finite groups, Dokl. Akad. Nauk SSSR158, (1964) 777–779.
Ju. L. Ershov.New examples of undecidability of theories, Algebra i Logika5 (1966), 37–47.
R. McKenzie,On elementary types of symmetric groups, Algebra Universalis1 (1971), 13–20.
M. D. Morley and R. L. Vaught,Homogeneous universal models, Math. Scand.11 (1962), 37–57.
A. G. Pinus,On elementary definability of symmetric group and lattices of equivalences, Algebra Universalis to appear.
M. O. Rabin,A simple method for undecidability proofs, Proc. 1964 Int. Congress for Logic, North Holland, 1965, pp. 58–68.
F. D. Ramsey,On a problem of formal logic, Proc. London Math. Soc.30 (1929), 338–384.
S. Shelah,There are just four possible second-order quantifiers and on permutation groups, Notices Amer. Math. Soc.19 (1972), A-717.
S. Shelah,First order theory of permutations groups, Israel J. Math.14 (1973), 149–162; andErrata to “First order theory of permutations groups”, Israel J. Math.15 (in press).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shelah, S. There are just four second-order quantifiers. Israel J. Math. 15, 282–300 (1973). https://doi.org/10.1007/BF02787572
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02787572