Results 11 to 20 of about 36,156 (297)

WOODIN FOR STRONG COMPACTNESS CARDINALS [PDF]

open access: yesThe Journal of Symbolic Logic, 2019
AbstractWoodin and Vopěnka cardinals are established notions in the large cardinal hierarchy and it is known that Vopěnka cardinals are the Woodin analogue for supercompactness. Here we give the definition of Woodin for strong compactness cardinals, the Woodinised version of strong compactness, and we prove an analogue of Magidor’s identity crisis ...
Dimopoulos, Stamatis
openaire   +7 more sources

Determinacy in strong cardinal models [PDF]

open access: yesThe Journal of Symbolic Logic, 2011
AbstractWe give limits defined in terms of abstract pointclasses of the amount of determinacy available in certain canonical inner models involving strong cardinals. We show for example:Theorem A. Det(-IND) ⇒ there exists an inner model with a strong cardinal.Theorem B.
P. D. Welch
openaire   +3 more sources

Strong cardinals in the core model

open access: yesAnnals of Pure and Applied Logic, 1997
The paper studies strong cardinals in the core model. The present paper (quoting the authors) is not concerned with pushing at the boundaries of known core models. Nor is it relevant to sharpening the tools from Steel, or any of the covering theorems, or correctness results.
Kai Hauser, Greg Hjorth
openaire   +2 more sources

Some remarks on cardinal properties of topological spaces

open access: yesApplied General Topology
The aim of this paper is to present new proofs of selected inequalities between cardinal invariants. The novelty relies on the application of some theorems on strong sequences.
Joanna Jureczko
doaj   +3 more sources

σ-collectionwise Hausdorffness at singular strong limit cardinals

open access: yesTopology and its Applications, 2006
A topological space \(Y\) is called separated if there is a function \(y\mapsto U_y\) such that for all \(y,y'\in Y\), \(U_y\) is open, \(y\in U_y\), and if \(U_y\neq U_{y'}\), then \(U_y\cap U_{y'} = \emptyset\). A space \(X\) is called \(\kappa\)-collectionwise Hausdorff (\(\kappa\)-\(\sigma\)-collectionwise Hausdorff) if every closed discrete ...
Kemoto, Nobuyuki
openaire   +3 more sources

How far is almost strong compactness from strong compactness [PDF]

open access: yes, 2023
Bagaria and Magidor introduced the notion of almost strong compactness, which is very close to the notion of strong compactness. Boney and Brooke-Taylor asked whether the least almost strongly compact cardinal is strongly compact.
Jiachen Yuan   +3 more
core   +1 more source

F-cardinal conflicts in conflict-based search [PDF]

open access: yes, 2020
Conflict-Based Search (CBS) is a leading algorithm for optimal Multi-Agent Path Finding (MAPF) which features strong performance. In CBS, one conflict in a high-level node is resolved to generate two child nodes, until a node with no conflicts is found ...
Boyarski, Eli   +4 more
core   +2 more sources

Strong tree properties for small cardinals [PDF]

open access: yesThe Journal of Symbolic Logic, 2013
AbstractAn inaccessible cardinal κ is supercompact when (κ, λ)-ITP holds for all λ ≥ κ. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where for every n ≥ 2 and μ ≥ ℕn, we have (ℕn, μ)-ITP.
openaire   +7 more sources

Cardinal Composition [PDF]

open access: yes, 2022
The thesis of Weak Unrestricted Composition says that every pair of objects has a fusion. This thesis has been argued by Contessa (Analysis 72(3):455–457, 2012) and Smith (Erkenntnis 84(1):41–55, 2019) to be compatible with the world being junky and ...
Lisa Vogt   +3 more
core   +1 more source

$n$-factorization Property of Bilinear Mappings [PDF]

open access: yesSahand Communications in Mathematical Analysis, 2020
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:X\times Y\to Z$, depended on  a natural number $n$ and a cardinal number $\kappa$; which is called $n$-factorization property of level $\kappa$.
Sedigheh Barootkoob
doaj   +1 more source

Home - About - Disclaimer - Privacy