Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Konstantinos Tsaprounis"'
Publikováno v:
Logic Journal of the IGPL. 31:68-95
Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of
Publikováno v:
Journal of Logic and Analysis. 13
We prove estimates for the cardinality of set-theoretic ultrapowers in terms of the cardinality of almost disjoint families. Such results are then applied to obtain estimates for the density of ultrapowers of Banach spaces. We focus on the change of
Autor:
Konstantinos Tsaprounis
Publikováno v:
The Journal of Symbolic Logic. 83:1112-1131
The hierarchies of C(n)-cardinals were introduced by Bagaria in [1] and were further studied and extended by the author in [18] and in [20]. The case of C(n)-extendible cardinals, and of their C(n)+-extendibility variant, is of particular interest si
Autor:
David Aspero, Konstantinos Tsaprounis
The familiar continuum R of real numbers is obtained by a well-known procedure which, starting with the set of natural numbers N=\omega, produces in a canonical fashion the field of rationals Q and, then, the field R as the completion of Q under Cauc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cca150b336d3eeb5e15f78c8d23e0fd0
https://ueaeprints.uea.ac.uk/id/eprint/66229/
https://ueaeprints.uea.ac.uk/id/eprint/66229/
Autor:
Konstantinos Tsaprounis
Publikováno v:
The Journal of Symbolic Logic. 80:587-608
The resurrection axioms are forms of forcing axioms that were introduced recently by Hamkins and Johnstone, who developed on earlier ideas of Chalons and Veličković. In this note, we introduce a stronger form of resurrection (which we callunbounded
Autor:
Konstantinos Tsaprounis
Publikováno v:
Archive for Mathematical Logic. 53:89-118
The C (n)-cardinals were introduced recently by Bagaria and are strong forms of the usual large cardinals. For a wide range of large cardinal notions, Bagaria has shown that the consistency of the corresponding C (n)-versions follows from the existen
Autor:
Konstantinos Tsaprounis
Publikováno v:
Archive for Mathematical Logic. 52:593-602
We give a characterization of extendibility in terms of embeddings between the structures H ? . By that means, we show that the GCH can be forced (by a class forcing) while preserving extendible cardinals. As a corollary, we argue that such cardinals
Publikováno v:
Archive for Mathematical Logic. 55(1-2)
Superstrong cardinals are never Laver indestructible. Similarly, almost huge cardinals, huge cardinals, superhuge cardinals, rank-into-rank cardinals, extendible cardinals, 1-extendible cardinals, 0-extendible cardinals, weakly superstrong cardinals,