Page 1

Displaying 1 – 9 of 9

Showing per page

Balanced congruences

Ivan Chajda, Günther Eigenthaler (2001)

Discussiones Mathematicae - General Algebra and Applications

Let V be a variety with two distinct nullary operations 0 and 1. An algebra 𝔄 ∈ V is called balanced if for each Φ,Ψ ∈ Con(𝔄), we have [0]Φ = [0]Ψ if and only if [1]Φ = [1]Ψ. The variety V is called balanced if every 𝔄 ∈ V is balanced. In this paper, balanced varieties are characterized by a Mal'cev condition (Theorem 3). Furthermore, some special results are given for varieties of bounded lattices.

Balanced d-lattices are complemented

Martin Goldstern, Miroslav Ploščica (2002)

Discussiones Mathematicae - General Algebra and Applications

We characterize d-lattices as those bounded lattices in which every maximal filter/ideal is prime, and we show that a d-lattice is complemented iff it is balanced iff all prime filters/ideals are maximal.

Bohr compactifications of discrete structures

Joan Hart, Kenneth Kunen (1999)

Fundamenta Mathematicae

We prove the following theorem: Given a⊆ω and 1 α < ω 1 C K , if for some η < 1 and all u ∈ WO of length η, a is Σ α 0 ( u ) , then a is Σ α 0 .We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: Σ 1 1 -Turing-determinacy implies the existence of 0 .

Bourbaki's Fixpoint Lemma reconsidered

Bernhard Banaschewski (1992)

Commentationes Mathematicae Universitatis Carolinae

A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chain-complete partially ordered sets is presented to obtain a condition for one closure system in a complete lattice L to be stable under another closure operator of L . This is then used to deal with coproducts and other aspects of frames.

Currently displaying 1 – 9 of 9

Page 1