Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Mostowski, A. Tarski (1949)
Arithmetical classes and types of well-ordered systemsBull. Amer. Math. Soc., 55
W. Sierpinski (1958)
Cardinal and Ordinal Numbers
R. Vaught (1964)
The completeness of logic with the added quantifier "there are uncountable many"Fundamenta Mathematicae, 54
A. Tarski (1936)
Grundzüge des Systemenkalküls IIFundamenta Mathematicae, 26
A. Ehrenfeucht (1961)
An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 49
A. Mostowski (1957)
On a generalization of quantifiersStudies in logic and the foundations of mathematics, 93
M. O. Rabin (1969)
Decidability of second-order theories and automata on infinite treesTrans. Amer. Math. Soc., 141
H. Läuchli, J. Leonard (1966)
On the elementary theory of linear orderFundamenta Mathematicae, 59
J. Bell, A. Slomson (1969)
Models and Ultraproducts: An Introduction.
H. Keisler (1970)
Logic with the quantifier “there exist uncountably many”Annals of Mathematical Logic, 1
M. Rabin (1968)
Decidability of second-order theories and automata on infinite treesBulletin of the American Mathematical Society, 74
A. Mostowski (1957)
On a generalization of quantifiersFund. Math., 44
Archive for Mathematical Logic – Springer Journals
Published: Jul 16, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.