Displaying 621 – 640 of 724

Showing per page

Annihilators and deductive systems in commutative Hilbert algebras

Ivan Chajda, Radomír Halaš, Young Bae Jun (2002)

Commentationes Mathematicae Universitatis Carolinae

The properties of deductive systems in Hilbert algebras are treated. If a Hilbert algebra H considered as an ordered set is an upper semilattice then prime deductive systems coincide with meet-irreducible elements of the lattice Ded H of all deductive systems on H and every maximal deductive system is prime. Complements and relative complements of Ded H are characterized as the so called annihilators in H .

Annihilators in BCK-algebras

Radomír Halaš (2003)

Czechoslovak Mathematical Journal

We introduce the concepts of an annihilator and a relative annihilator of a given subset of a BCK-algebra 𝒜 . We prove that annihilators of deductive systems of BCK-algebras are again deductive systems and moreover pseudocomplements in the lattice 𝒟 ( A ) of all deductive systems on 𝒜 . Moreover, relative annihilators of C 𝒟 ( A ) with respect to B 𝒟 ( A ) are introduced and serve as relative pseudocomplements of C w.r.t. B in 𝒟 ( A ) .

Another ⋄-like principle

Michael Hrušák (2001)

Fundamenta Mathematicae

A new ⋄-like principle consistent with the negation of the Continuum Hypothesis is introduced and studied. It is shown that ¬ is consistent with CH and that in many models of = ω₁ the principle holds. As implies that there is a MAD family of size ℵ₁ this provides a partial answer to a question of J. Roitman who asked whether = ω₁ implies = ω₁. It is proved that holds in any model obtained by adding a single Laver real, answering a question of J. Brendle who asked whether = ω₁ in such models....

Another ordering of the ten cardinal characteristics in Cichoń's diagram

Jakob Kellner, Saharon Shelah, Anda R. Tănasie (2019)

Commentationes Mathematicae Universitatis Carolinae

It is consistent that 1 < add ( 𝒩 ) < add ( ) = 𝔟 < cov ( 𝒩 ) < non ( ) < cov ( ) = 2 0 . Assuming four strongly compact cardinals, it is consistent that 1 < add ( 𝒩 ) < add ( ) = 𝔟 < cov ( 𝒩 ) < non ( ) < cov ( ) < non ( 𝒩 ) < cof ( ) = 𝔡 < cof ( 𝒩 ) < 2 0 .

Another proof of a result of Jech and Shelah

Péter Komjáth (2013)

Czechoslovak Mathematical Journal

Shelah’s pcf theory describes a certain structure which must exist if ω is strong limit and 2 ω > ω 1 holds. Jech and Shelah proved the surprising result that this structure exists in ZFC. They first give a forcing extension in which the structure exists then argue that by some absoluteness results it must exist anyway. We reformulate the statement to the existence of a certain partially ordered set, and then we show by a straightforward, elementary (i.e., non-metamathematical) argument that such partially...

Currently displaying 621 – 640 of 724