Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe possible values of critical points between varieties of lattices
125
0
0.0
(
0
)
Authors
Pierre Gillibert
Ask ChatGPT about the research
No Arabic abstract
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of W contains a prime interval, we prove that there exists a bounded lattice A in V with at most aleph 2 elements such that Conc(A) is not isomorphic to Conc(B) for any B in W. The bound aleph 2 is optimal. As a corollary of our results, there are continuum many congruence classes of locally finite varieties of (bounded) modular lattices.
rate research
Read More
We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be locally finite varieties of algebras such that for each finite algebra A in V there are, up to isomorphism, only finitely many B in W such that A and B have isomorphic congruence lattices, and every such B is finite. If Conc(V) is not contained in Conc(W), then there exists a semilattice of cardinality aleph 2 in Conc(V)-Conc(W). Our result extends to quasivarieties of first-order structures, with finitely many relation symbols, and relative congruence lattices. In particular, if W is a finitely generated variety of algebras, then this occurs in case W omits the tame congruence theory types 1 and 5; which, in turn, occurs in case W satisfies a nontrivial congruence identity. The bound aleph 2 is sharp.
We denote by Conc(A) the semilattice of compact congruences of an algebra A. Given a variety V of algebras, we denote by Conc(V) the class of all semilattices isomorphic to Conc(A) for some A in V. Given varieties V1 and V2 varieties of algebras, the critical point of V1 under V2, denote by crit(V1;V2) is the smalest cardinality of a semilattice in Conc(V1) but not in Conc(V2). Given a finitely generated variety V of modular lattices, we obtain an integer l, depending of V, such that crit(V;Var(Sub F^n)) is at least aleph_2 for any n > 1 and any field F. In a second part, we prove that crit(Var(Mn);Var(Sub F^3))=aleph_2, for any finite field F and any integer n such that 1+card F< n. Similarly crit(Var(Sub F^3);Var(Sub K^3))=aleph_2, for all finite fields F and K such that card F>card K.
Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is the only truth value preserved by the inferences of the logic. In this paper we introduce another logic associated with K, namely the logic that preserves degrees of truth, in the sense that it preserves lower bounds of truth values in inferences. We study this second logic mainly from the point of view of abstract algebraic logic. We determine its algebraic models and we classify it in the Leibniz and the Frege hierarchies: we show that it is always fully selfextensional, that for most varieties K it is non-protoalgebraic, and that it is algebraizable if and only K is a variety of generalized Heyting algebras, in which case it coincides with the logic that preserves truth. We also characterize the new logic in three ways: by a Hilbert style axiomatic system, by a Gentzen style sequent calculus, and by a set of conditions on its closure operator. Concerning the relation between the two logics, we prove that the truth preserving logic is the purely inferential extension of the one that preserves degrees of truth with either the rule of Modus Ponens or the rule of Adjunction for the fusion connective.
For a class V of algebras, denote by Conc(V) the class of all semilattices isomorphic to the semilattice Conc(A) of all compact congruences of A, for some A in V. For classes V1 and V2 of algebras, we denote by crit(V1,V2) the smallest cardinality of a semilattice in Conc(V1) which is not in Conc(V2) if it exists, infinity otherwise. We prove a general theorem, with categorical flavor, that implies that for all finitely generated congruence-distributive varieties V1 and V2, crit(V1,V2) is either finite, or aleph_n for some natural number n, or infinity. We also find two finitely generated modular lattice varieties V1 and V2 such that crit(V1,V2)=aleph_1, thus answering a question by J. Tuma and F. Wehrung.
It is proved that epimorphisms are surjective in a range of varieties of residuated structures, including all varieties of Heyting or Brouwerian algebras of finite depth, and all varieties consisting of Goedel algebras, relative Stone algebras, Sugihara monoids or positive Sugihara monoids. This establishes the infinite deductive Beth definability property for a corresponding range of substructural logics. On the other hand, it is shown that epimorphisms need not be surjective in a locally finite variety of Heyting or Brouwerian algebras of width 2. It follows that the infinite Beth property is strictly stronger than the so-called finite Beth property, confirming a conjecture of Blok and Hoogland.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
