We show that every function f: A × B → A × B, where |A| ≤ 3 and |B| < ω, can be represented as a composition f₁ ∘ f₂ ∘ f₃ ∘ f₄ of four axial functions, where f₁ is a vertical function. We also prove that for every finite set A of cardinality at least 3, there exist a finite set B and a function f: A × B → A × B such that f ≠ f₁ ∘ f₂ ∘ f₃ ∘ f₄ for any axial functions f₁, f₂, f₃, f₄, whenever f₁ is a horizontal function.
In this paper, we introduce six basic types of composition of ternary relations, four of which are associative. These compositions are based on two types of composition of a ternary relation with a binary relation recently introduced by Zedam et al. We study the properties of these compositions, in particular the link with the usual composition of binary relations through the use of the operations of projection and cylindrical extension.
We introduce two generalized condensation principles: Local Club Condensation and Stationary Condensation. We show that while Strong Condensation (a generalized condensation principle introduced by Hugh Woodin) is inconsistent with an ω₁-Erdős cardinal, Stationary Condensation and Local Club Condensation (which should be thought of as weakenings of Strong Condensation) are both consistent with ω-superstrong cardinals.
If G is a countable group containing a copy of F₂ then the conjugacy equivalence relation on subgroups of G attains the maximal possible complexity.
Silver’s fundamental dichotomy in the classical theory of Borel reducibility states that any Borel (or even co-analytic) equivalence relation with uncountably many classes has a perfect set of classes. The natural generalisation of this to the generalised Baire space for a regular uncountable κ fails in Gödel’s L, even for κ-Borel equivalence relations. We show here that Silver’s dichotomy for κ-Borel equivalence relations in for uncountable regular κ is however consistent (with GCH), assuming...
A subset of a Polish space X is called universally small if it belongs to each ccc σ-ideal with Borel base on X. Under CH in each uncountable Abelian Polish group G we construct a universally small subset A₀ ⊂ G such that |A₀ ∩ gA₀| = for each g ∈ G. For each cardinal number κ ∈ [5,⁺] the set A₀ contains a universally small subset A of G with sharp packing index equal to κ.
In this paper, the ordinal sum construction methods of implications on bounded lattices are studied. Necessary and sufficient conditions of an ordinal sum for obtaining an implication are presented. New ordinal sum construction methods on bounded lattices which generate implications are discussed. Some basic properties of ordinal sum implications are studied.
In this paper, two construction methods have been proposed for uni-nullnorms on any bounded lattices. The difference between these two construction methods and the difference from the existing construction methods have been demonstrated and supported by an example. Moreover, the relationship between our construction methods and the existing construction methods for uninorms and nullnorms on bounded lattices are investigated. The charactertics of null-uninorms on bounded lattice are given and a...