Page 1

Displaying 1 – 7 of 7

Showing per page

Cardinal and ordinal arithmetics of n -ary relational systems and n -ary ordered sets

Jiří Karásek (1998)

Mathematica Bohemica

The aim of this paper is to define and study cardinal (direct) and ordinal operations of addition, multiplication, and exponentiation for n -ary relational systems. n -ary ordered sets are defined as special n -ary relational systems by means of properties that seem to suitably generalize reflexivity, antisymmetry, and transitivity from the case of n = 2 or 3. The class of n -ary ordered sets is then closed under the cardinal and ordinal operations.

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence ϕ if ϕ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if β is characterized by a Scott sentence, then 2 β + β is (homogeneously) characterized by a Scott sentence, for all 0 < β₁ < ω₁....

Compacta are maximally G δ -resolvable

István Juhász, Zoltán Szentmiklóssy (2013)

Commentationes Mathematicae Universitatis Carolinae

It is well-known that compacta (i.e. compact Hausdorff spaces) are maximally resolvable, that is every compactum X contains Δ ( X ) many pairwise disjoint dense subsets, where Δ ( X ) denotes the minimum size of a non-empty open set in X . The aim of this note is to prove the following analogous result: Every compactum X contains Δ δ ( X ) many pairwise disjoint G δ -dense subsets, where Δ δ ( X ) denotes the minimum size of a non-empty G δ set in X .

Currently displaying 1 – 7 of 7

Page 1