scholarly journals A Note on Congruences of Infinite Bounded Involution Lattices

2021 ◽  
Vol 31 (1) ◽  
pp. 51-78
Author(s):  
Claudia Muresan ◽  
Keyword(s):  
Ordered Set ◽  
Continuum Hypothesis ◽  
Sufficient Conditions ◽  
Bounded Lattice ◽  
Kleene Algebra ◽  
Generalized Continuum ◽  
Congruence Lattices ◽  
Ordered Algebras

We prove that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any number of congruences between 2 and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals as elements or as many ideals as subsets. Furthermore, when they have at most as many congruences as elements, these involution lattices and even pseudo-Kleene algebras can be chosen such that all their lattice congruences preserve their involutions, so that they have as many congruences as their lattice reducts. Under the Generalized Continuum Hypothesis, this means that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any number of congruences between 2 and its number of subsets, regardless of its number of ideals. Consequently, the same holds for antiortholattices, a class of paraorthomodular Brouwer-Zadeh lattices. Regarding the shapes of the congruence lattices of the lattice{ ordered algebras in question, it turns out that, as long as the number of congruences is not strictly larger than the number of elements, they can be isomorphic to any nonsingleton well-ordered set with a largest element of any of those cardinalities, provided its largest element is strictly join-irreducible in the case of bounded lattice-ordered algebras and, in the case of antiortholattices with at least 3 distinct elements, provided that the predecessor of the largest element of that well-ordered set is strictly join{irreducible, as well; of course, various constructions can be applied to these algebras to obtain congruence lattices with different structures without changing the cardinalities in question. We point out sufficient conditions for analogous results to hold in an arbitrary variety.

scholarly journals Isomorphic Universality and the Number of Pairwise Nonisomorphic Models in the Class of Banach Spaces

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Mirna Džamonja
Keyword(s):  
Banach Spaces ◽  
Continuum Hypothesis ◽  
Generalized Continuum

We develop the framework ofnatural spacesto study isomorphic embeddings of Banach spaces. We then use it to show that a sufficient failure of the generalized continuum hypothesis implies that the universality number of Banach spaces of a given density under a certain kind of positive embedding (very positive embedding) is high. An example of a very positive embedding is a positive onto embedding betweenC(K)andCLfor 0-dimensionalKandLsuch that the following requirement holds for allh≠0andf≥0inC(K): if0≤Th≤Tf, then there are constantsa≠0andbwith0≤a·h+b≤fanda·h+b≠0.

XII.—Quasi-residuated Mappings and Baer Assemblies

1971 ◽  
Vol 69 (2) ◽  
pp. 165-179
Author(s):  
T. S. Blyth ◽  
W. C. Hardy
Keyword(s):  
Ordered Set ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Minimum Element ◽  
Isotone Mappings ◽  
Necessary And Sufficient

SynopsisWe consider, for a given ordered set E with minimum element O, the semigroup Q of O-preserving isotone mappings on E and examine necessary and sufficient conditions under which an element fε Q is such that the left [resp. right] annihilator of f in Q is a principal left [resp. right] ideal of Q generated by a particular type of idempotent. The results obtained lead us to introduce the concept of a Baer assembly which we use to extend to the case of a semilattice the Baer semigroup co-ordinatization theory of lattices. We also derive a co-ordinatization of particular types of semilattice.

Ultraproducts which are not saturated

1967 ◽  
Vol 32 (1) ◽  
pp. 23-46 ◽  
Author(s):  
H. Jerome Keisler
Keyword(s):  
Predicate Logic ◽  
Continuum Hypothesis ◽  
First Order ◽  
Generalized Continuum ◽  
First Order Predicate Logic

In this paper we continue our study, begun in [5], of the connection between ultraproducts and saturated structures. IfDis an ultrafilter over a setI, andis a structure (i.e., a model for a first order predicate logicℒ), the ultrapower ofmoduloDis denoted byD-prod. The ultrapower is important because it is a method of constructing structures which are elementarily equivalent to a given structure(see Frayne-Morel-Scott [3]). Our ultimate aim is to find out what kinds of structure are ultrapowers of. We made a beginning in [5] by proving that, assuming the generalized continuum hypothesis (GCH), for each cardinalαthere is an ultrafilterDover a set of powerαsuch that for all structures,D-prodisα+-saturated.

On the inadequacy of inner models

1972 ◽  
Vol 37 (3) ◽  
pp. 569-571
Author(s):  
Andreas Blass
Keyword(s):  
Standard Model ◽  
Continuum Hypothesis ◽  
Axiom Of Choice ◽  
Precise Statement ◽  
Relative Consistency ◽  
Inner Models ◽  
Generalized Continuum ◽  
The Axiom Of Choice

The method of inner models, used by Gödel to prove the (relative) consistency of the axiom of choice and the generalized continuum hypothesis [2], cannot be used to prove the (relative) consistency of any statement which contradicts the axiom of constructibility (V = L). A more precise statement of this well-known fact is:(*)For any formula θ(x) of the language of ZF, there is an axiom α of the theory ZF + V ≠ L such that the relativization α(θ) is not a theorem of ZF.On p. 108 of [1], Cohen gives a proof of (*) in ZF assuming the existence of a standard model of ZF, and he indicates that this assumption can be avoided. However, (*) is not a theorem of ZF (unless ZF is inconsistent), because (*) trivially implies the consistency of ZF. What assumptions are needed to prove (*)? We know that the existence of a standard model implies (*) which, in turn, implies the consistency of ZF. Is either implication reversible?From our main result, it will follow that, if the converse of the first implication is provable in ZF, then ZF has no standard model, and if the converse of the second implication is provable in ZF, then so is the inconsistency of ZF. Thus, it is quite improbable that either converse is provable in ZF.

Sign in / Sign up

Export Citation Format

Share Document