Zobrazeno 1 - 10
of 246
pro vyhledávání: '"Prewellordering"'
Autor:
Sargsyan, Grigor
Working under $AD$, we investigate the length of prewellorderings given by the iterates of $\M_{2k+1}$, which is the minimal proper class mouse with $2k+1$ many Woodin cardinals. In particular, we answer some questions from \cite{Hjorth01} (the discu
Externí odkaz:
http://arxiv.org/abs/1301.4925
Publikováno v:
Lecture Notes in Mathematics ISBN: 9783540102885
Let ω = (0,1,2,...) be the set of natural numbers and R = ω^ω the set of all functions from ω into ω, or for simplicity reals. A product space is of the form X = X_1 x X_2 x ... x X_k, where X_1 = ω or R. Subsets of these product spaces are cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b33d64fd71e1e45fef6b8dfade6790b2
https://doi.org/10.1017/cbo9781139028073.008
https://doi.org/10.1017/cbo9781139028073.008
Autor:
J. P. Aguilera
Publikováno v:
The Journal of Symbolic Logic. 86:1555-1583
Extending Aanderaa's classical result that $\pi^1_1
Comment: 21 pages. This version: March 2019
Comment: 21 pages. This version: March 2019
Autor:
Shi, Xianghui
Publikováno v:
The Journal of Symbolic Logic, 2009 Jun 01. 74(2), 579-596.
Externí odkaz:
https://www.jstor.org/stable/40378080
Publikováno v:
Fixed Point Theory. 18:663-672
Autor:
Klaus Grue, Chantal Berline
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2016, 614, pp.1-62. ⟨10.1016/j.tcs.2015.11.028⟩
Theoretical Computer Science, Elsevier, 2016, 614, pp.1-62. ⟨10.1016/j.tcs.2015.11.028⟩
Includes TOC détaillée, index et appendices; International audience; This paper presents a subtantially simplified axiomatization of Map Theory and proves the consistency of this axiomatization in ZFC under the assumption that there exists an inacc
Publikováno v:
Soft Computing. 15:1023-1038
Three ways for generating the optimal transitive approximations or a suboptimal transitive approximation are given in this paper. The first one can obtain all the optimal transitive approximations for any proximity relation. However, trying to find a
Autor:
George Kafkoulis
Publikováno v:
Archive for Mathematical Logic. 43:193-213
Under the assumption that there exists an elementary embedding (henceforth abbreviated as and in particular under we prove a Coding Lemma for and find certain versions of it which are equivalent to strong regularity of cardinals below . We also prove
Autor:
Benedikt Löwe
Publikováno v:
Order, 22, 85-92. Springer Netherlands
We define a global order of norms using strongly optimal strategies in Blackwell games and prove that it is a prewellordering under the assumption of the Axiom of Blackwell determinacy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c65e9f35604fc40333bae7b5f58300ca
https://dare.uva.nl/personal/pure/en/publications/a-global-wellordering-of-norms-defined-via-blackwell-games(c7b242af-b02f-4a16-a30b-f0beafa6907a).html
https://dare.uva.nl/personal/pure/en/publications/a-global-wellordering-of-norms-defined-via-blackwell-games(c7b242af-b02f-4a16-a30b-f0beafa6907a).html
Autor:
Xianghui Shi
Publikováno v:
J. Symbolic Logic 74, iss. 2 (2009), 579-596
We show that it is relatively consistent with ZFC that there is aprojective wellfounded relation with rank higher than all projective prewellorderings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ca981e5275b9ee980647c0b428883cf
http://projecteuclid.org/euclid.jsl/1243948328
http://projecteuclid.org/euclid.jsl/1243948328