Zobrazeno 1 - 10
of 1 374
pro vyhledávání: '"Constructible universe"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Matthews, Richard, Rathjen, Michael
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without Infinity. Foll
Externí odkaz:
http://arxiv.org/abs/2206.08283
Publikováno v:
The Journal of Symbolic Logic, 2019 Dec 01. 84(4), 1403-1421.
Externí odkaz:
https://www.jstor.org/stable/26873309
Publikováno v:
J. symb. log. 84 (2019) 1403-1421
We answer several questions posed by Hamkins and Leahy concerning the implicitly constructible universe, Imp. Specifically, we show that it is relatively consistent with ZFC that Imp satisfies the negation of CH, that Imp is not HOD, and that Imp sat
Externí odkaz:
http://arxiv.org/abs/1702.07947
Autor:
Fleissner, William
Publikováno v:
Proceedings of the American Mathematical Society, 1974 Nov 01. 46(2), 294-298.
Externí odkaz:
https://www.jstor.org/stable/2039914
Autor:
WALSH, SEAN
Publikováno v:
The Journal of Symbolic Logic, 2016 Jun 01. 81(2), 605-628.
Externí odkaz:
http://www.jstor.org/stable/43864314
Publikováno v:
In Annals of Pure and Applied Logic April 2018 169(4):312-332
Autor:
Walsh, Sean
Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension schema ar
Externí odkaz:
http://arxiv.org/abs/1407.3861
We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$. Equivalentl
Externí odkaz:
http://arxiv.org/abs/1512.06101
Autor:
Hamkins, Joel David
Publikováno v:
Journal of Mathematical Logic, vol. 13, iss. 2, p. 1350006, 2013
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is elementary f
Externí odkaz:
http://arxiv.org/abs/1207.0963