Results 311 to 320 of about 138,756 (354)
Some of the next articles are maybe not open access.
Cost-Guided Cardinality Estimation: Focus Where it Matters
2020 IEEE 36th International Conference on Data Engineering Workshops (ICDEW), 2020The increasing prevalence of machine learning techniques has resulted in many works attempting to replace cardinality estimation, a core component of relational query optimizers, with learned models.
Parimarjan Negi +5 more
semanticscholar +1 more source
Journal of Symbolic Logic, 1965
In this paper, by a function of ordinals we understand a function which is defined for all ordinals and each of whose value is an ordinal. In [7] (also cf. [8] or [9]) we defined recursive functions and predicates of ordinals, following Kleene's definition on natural numbers.
openaire +2 more sources
In this paper, by a function of ordinals we understand a function which is defined for all ordinals and each of whose value is an ordinal. In [7] (also cf. [8] or [9]) we defined recursive functions and predicates of ordinals, following Kleene's definition on natural numbers.
openaire +2 more sources
Cardinal Characteristics on Large Cardinals
2021Das Studium von Kardinalzahlcharakteristiken auf regulären überabzählbaren Kardinalzahlen hat in den letzten zehn Jahren erheblich an Popularität gewonnen. Die Verallgemeinerungen des Cantor- und Baire-Raums auf reguläre überabzählbare Kardinalzahlen kappa induzieren auf natürliche Weise Verallgemeinerungen der zugehörigen Kardinalzahlcharakteristiken.
openaire +1 more source
Mathematical Logic Quarterly, 2016
In this note, we start with the notion of a superhuge cardinal and strengthen it by requiring that the elementary embeddings witnessing this property are, in addition, sufficiently superstrong above their target . This modification leads to a new large cardinal which we call ultrahuge.
openaire +1 more source
In this note, we start with the notion of a superhuge cardinal and strengthen it by requiring that the elementary embeddings witnessing this property are, in addition, sufficiently superstrong above their target . This modification leads to a new large cardinal which we call ultrahuge.
openaire +1 more source
Mathematical Logic Quarterly, 2008
AbstractA cardinal κ is tall if for every ordinal θ there is an embedding j: V → M with critical point κ such that j (κ) > θ and Mκ ⊆ M. Every strong cardinal is tall and every strongly compact cardinal is tall, but measurable cardinals are not necessarily tall.
openaire +2 more sources
AbstractA cardinal κ is tall if for every ordinal θ there is an embedding j: V → M with critical point κ such that j (κ) > θ and Mκ ⊆ M. Every strong cardinal is tall and every strongly compact cardinal is tall, but measurable cardinals are not necessarily tall.
openaire +2 more sources
On the Cardinality of Urysohn Spaces
Canadian Mathematical Bulletin, 1988AbstractIn this paper some cardinal inequalities for Urysohn spaces are established. In particular the following two theorems are proved:(i)If where [A]θ denotes the θ-closed hull of A, i.e., the smallest θ-closed subset of X containing A;(ii), where aL(X, X) is the smallest cardinal number m such that for every open cover of X there is a subfamily ...
ANGELO BELLA, CAMMAROTO, Filippo
openaire +4 more sources
Rowbottom cardinals and Jonsson cardinals are almost the same
Journal of Symbolic Logic, 1973Each of the various “large cardinal” axioms currently studied in set theory owes its inspiration to concrete phenomena in various fields. For example, the statement of the well-known compactness theorem for first-order logic can be generalized in various ways to infinitary languages to yield definitions of compact cardinals, and the reflection ...
openaire +1 more source
On the Cardinality of Relations
2006This paper will discuss and characterise the cardinality of boolean (crisp) and fuzzy relations. The main result is a Dedekind inequality for the cardinality, which enables us to manipulate the cardinality of the composites of relations. As applications a few relational proofs for the basic theorems on graph matchings, and fundamentals about network ...
openaire +1 more source
The Composition of Complex Cardinals
Journal of Semantics, 2006This paper proposes an analysis of the syntax and semantics of complex cardinal numerals, which involve multiplication (two hundred) and/or addition (twentythree). It is proposed that simplex cardinals have the semantic type of modifiers (AEAEe, tae, AEe, taeae).
Ionin, Tania, Matushansky, Ora
openaire +2 more sources
GENERICITY AND LARGE CARDINALS
Journal of Mathematical Logic, 2005We lift Jensen's coding method into the context of Woodin cardinals. By a theorem of Woodin, any real which preserves a "strong witness" to Woodinness is set-generic. We show however that there are class-generic reals which are not set-generic but preserve Woodinness, using "weak witnesses".
openaire +1 more source