Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Donder, R. Jensen, B. Koppelberg (1981)
Some applications of the core model
D. Mundici (1981)
Applications of Many-Sorted Robinson Consistency TheoremMath. Log. Q., 27
D. Mundici (1981)
Applications of many-sorted Robinson consistency theoremZ. Math. Logik, 27
J. Makowsky, S. Shelah (1979)
The theorems of Beth and Craig in abstract model theory. I. The abstract settingTransactions of the American Mathematical Society, 256
J. Flum (1975)
First-order logic and its extensions
C.C. Chang, J. Keisler (1977)
Model theory
J. Makowsky, S. Shelah, J. Stavi (1976)
δ-Logics and generalized quantifiersAnnals of Mathematical Logic, 10
S. Feferman (1975)
Two notes on abstract model theory. II. Languages for which, the set of valid sentences is semi-invariantly implicitly definableFundamenta Mathematicae, 89
S. Feferman (1974)
Two notes on abstract model theoryI. Fund. Math., 82
(1977)
Model theory (second edition)
K. Barwise (1974)
Axioms for abstract model theoryAnnals of Mathematical Logic, 7
Chen Chang, H. Keisler (1966)
Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics
S. Feferman (1974)
Two notes on abstract model theory. I. Properties invariant on the range of definable relations between structuresFundamenta Mathematicae, 82
J.A. Makowsky, S. Shelah (1979)
The theorems of Beth and Craig in abstract model theoryI. Trans. AMS, 256
D. Donder, R.B. Jensen, B.J. Koppelberg (1981)
Lecture Notes in Mathematics, Vol. 872
Let[Figure not available: see fulltext.] be the following statement: “for any infinite regularκ, for any uniform ultrafilterD onκ,D isλ-descendingly incomplete for all infiniteλ”.[Figure not available: see fulltext.] is weaker than ⌍0#. Assuming[Figure not available: see fulltext.] we prove the following: letL be a logic in which the class of sentences of typeτ is a set if so isτ; then: (I)L is compact iffL has JEP; (II)L satisfies Robinson Consistency Theorem iffL is compact and satisfies Craig Interpolation theorem; (III) if, in addition,L is single-sorted, thenL satisfies Robinson Consistency Theorem iffL has JEP#. JEP (resp. JEP#) are the natural generalizations for logicL of the familiar Joint Embedding Property of elementary (resp. complete) embeddings in first order logic. As a corollary, we characterize first order logic as the only logic having Löwenheim number equal toω together with JEP.
Archive for Mathematical Logic – Springer Journals
Published: Jan 20, 2006
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.