Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Flum (1972)
Die Automorphismenmenge der Modelle einerL Q -TheorieArch. Math. Logik Grundlagenforsch., 15
J. Flum (1972)
Hanf numbers and well-ordering numbersArchiv für mathematische Logik und Grundlagenforschung, 15
J. Baumgartner, P. Komjáth (1981)
Boolean algebras in which every chain and antichain is countableFundamenta Mathematicae, 111
J.A. Makowsky (1985)
Model-theoretic logics
J. Barwise, K. Kunen (1971)
Hanf numbers for fragments of ℶh(A)Israel Journal of Mathematics, 10
W. Hodges (1984)
Ordered Sets and Their Applications
C. Charretton, M. Pouzet (1983)
Chains in Ehrenfeucht Mostowski modelsFundamenta Mathematicae, 118
J. Baumgartner (1976)
A new class of order typesAnnals of Mathematical Logic, 9
W. Hodges (1984)
Models Built on Linear OrderingsNorth-holland Mathematics Studies, 99
M. Magidor, J.J. Malitz (1977)
Compact extensions ofL(Q) (1a)Ann. Math. Logic, 11
R. Bonnet (1980)
Very strongly rigid Boolean algebras continuum discrete set condition countable antichain condition (I)algebra universalis, 11
C.C. Chang, H.J. Keisler (1990)
Model Theory
J. Flum (1972)
Die Automorphismenmengen der Modelle einerLQx-TheorieArchiv für mathematische Logik und Grundlagenforschung, 15
R. Bonnet (1980)
Very strongly rigid Boolean algebrasAlgebra Univers., 11
A. Ehrenfeucht, A. Mostowski (1956)
Models of axiomatic theories admitting automorphismsFundamenta Mathematicae, 43
H. Ebbinghaus (1971)
On models with large automorphism groupsArchiv für mathematische Logik und Grundlagenforschung, 14
Chen Chang, H. Keisler (1966)
Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics
S. Shelah (1981)
On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elementsNotre Dame J. Formal Log., 22
M. Magidor, J. Malitz (1977)
Compact extensions of L(Q) (part 1a)Annals of Mathematical Logic, 11
Leslie Tharp (1974)
Continuity and elementary logicJournal of Symbolic Logic, 39
J.A. Makowsky (1975)
Logic Colloquium '73
S. Todorcevic (1987)
Partitioning pairs of countable ordinalsActa Mathematica, 159
E. López-Escobar (1966)
On defining well-orderingsFundamenta Mathematicae, 59
J. Makowsky (1975)
Securable Quantifiers, κ-Unions and Admissible SetsStudies in logic and the foundations of mathematics, 80
We consider a class of Lindström extensions of first-order logic which are susceptible to a natural Skolemization procedure. In these logics Ehrenfeucht Mostowski (EM) functors for theories with arbitrarily large models can be obtained under suitable restrictions. Characteristic dependencies between algebraic properties of the quantifiers and the maximal domains of EM functors are investigated.
Archive for Mathematical Logic – Springer Journals
Published: Mar 23, 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.