- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Countable approximations and Löwenheim-Skolem theorems
Annals of Mathematical Logic 11 (1):57 (1977)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
David W. Kueker. Löwenheim–Skolem and interpolation theorems in infinitary languages. Bulletin of the American Mathematical Society, vol. 78 , pp. 211–215. - K. Jon Barwise. Mostowski's collapsing function and the closed unbounded filter. Fundamenta mathematicae, vol. 82 no. 2 , pp. 95–103. - David W. Kueker. Countable approximations and Löwenheim–Skolem theorems. Annals of mathematical logic, vol. 11 , pp. 57–103. [REVIEW]Victor Harnik - 1986 - Journal of Symbolic Logic 51 (1):232-234.
Some Remarks on Finite Löwenheim‐Skolem Theorems.Martin Grohe - 1996 - Mathematical Logic Quarterly 42 (1):569-571.
A Topological Proof of the Löwenheim‐Skolem, Compactness, and Strong Completeness Theorems for Free Logic.Bas C. van Fraassen - 1968 - Mathematical Logic Quarterly 14 (13-17):245-254.
A Topological Proof of the Löwenheim‐Skolem, Compactness, and Strong Completeness Theorems for Free Logic.Bas C. van Fraassen - 1968 - Mathematical Logic Quarterly 14 (13‐17):245-254.
David W. Kueker. Generalized interpolation and definability. Annals of mathematical logic, vol. 1 no. 4 , pp. 423–468.E. G. K. Lopez-Escobar - 1974 - Journal of Symbolic Logic 39 (2):337-338.
There is no recursive link between the k-size of a model and its cardinality.R. Barker - 2002 - Annals of Pure and Applied Logic 118 (3):235-247.
The Löwenheim-Skolem theorem for Gödel logic.J. P. Aguilera - 2023 - Annals of Pure and Applied Logic 174 (4):103235.
The Downward Transfer of Elementary Satisfiability of Partition Logics.Y. Chen & E. Shen - 2000 - Mathematical Logic Quarterly 46 (4):477-488.
Analytics
Added to PP
2014-01-17
Downloads
35 (#651,090)
6 months
7 (#728,225)
2014-01-17
Downloads
35 (#651,090)
6 months
7 (#728,225)
Historical graph of downloads
Citations of this work
Squares, scales and stationary reflection.James Cummings, Matthew Foreman & Menachem Magidor - 2001 - Journal of Mathematical Logic 1 (01):35-98.
Higher indescribability and derived topologies.Brent Cody - 2023 - Journal of Mathematical Logic 24 (1).
On the size of closed unbounded sets.James E. Baumgartner - 1991 - Annals of Pure and Applied Logic 54 (3):195-227.
More game-theoretic properties of boolean algebras.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):11-29.
References found in this work
Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
Axioms for abstract model theory.K. Jon Barwise - 1974 - Annals of Mathematical Logic 7 (2-3):221-265.
Some Remarks on Infinitely Long Formulas.L. Henkin & Carol R. Karp - 1965 - Journal of Symbolic Logic 30 (1):96-97.
Infinitary analogs of theorems from first order model theory.Jerome Malitz - 1971 - Journal of Symbolic Logic 36 (2):216-228.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-2pm92 dc2