Zfc proves that the class of ordinals is not weakly compact for definable classes

&
Journal of Symbolic Logic 83 (1):146-164 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2017.75

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,945

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Chain conditions of products, and weakly compact cardinals.Assaf Rinot - 2014 - Bulletin of Symbolic Logic 20 (3):293-314,.
Pointwise definable models of set theory.Joel David Hamkins, David Linetsky & Jonas Reitz - 2013 - Journal of Symbolic Logic 78 (1):139-156.
Closed Maximality Principles and Generalized Baire Spaces.Philipp Lücke - 2019 - Notre Dame Journal of Formal Logic 60 (2):253-282.
The Monadic Theory of ω 1 2.Yuri Gurevich, Menachem Magidor & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (2):387-398.
Closed and unbounded classes and the härtig quantifier model.Philip D. Welch - 2022 - Journal of Symbolic Logic 87 (2):564-584.
Heights of Models of ZFC and the Existence of End Elementary Extensions II.Andrés Villaveces - 1999 - Journal of Symbolic Logic 64 (3):1111-1124.
The subset relation and 2‐stratified sentences in set theory and class theory.Zachiri McKenzie - 2023 - Mathematical Logic Quarterly 69 (1):77-91.
Weak Covering at Large Cardinals.Ralf ‐ Dieter Schindler - 1997 - Mathematical Logic Quarterly 43 (1):22-28.
A definable nonstandard model of the reals.Vladimir Kanovei & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (1):159-164.

Analytics

Added to PP
2018-05-03

Downloads
23 (#1,019,869)

6 months
8 (#499,904)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references