We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein’s theorem solves a particular instance of this interpolation problem on a distributive lattice L with least and greatest elements 0 and 1, resp.: Given a function f : {0, 1}n → L, there exists a lattice polynomial function p : Ln → L such that p|{...

For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows: Theorem. Let E be a quasi-ordering on a finite set P . Then the following conditions are equivalent: (i) There exists a finite lattice L such that 〈J(L),EL〉 is iso...

Some well-known algebras of logic or other algebraic models of non-classical reasoning, such as MV-algebras or orthomodular lattices, can be regarded as lattices with antitone involutions, i.e., bounded lattices with the property that all principal filters (or ideals) are equipped with antitone involutions. This simple observation is behind the so-called “basic algebras” that were introduced in...

The problem of imbedding an abstract distributive lattice in a Boolean algebra by an algebraic extension was suggested to the writer by M. H. Stone in 1933. Hausdorfff had already given a solution of this problem for the case where the given distributive lattice was a ring of point sets. A solution for the abstract case was presented by the writer to the Harvard Mathematical Colloquium (1934), ...

The aim of the present paper is to define the localization BL-algebra of a BL-algebra A with respect to a topology F on A. In the last part of the paper is proved that the maximal BL-algebra of quotients (defined in [5]) and the BLalgebra of fractions relative to a ∧-closed system (defined in [4]) are BL-algebras of localization. A remarkable construction in ring theory is the localization ring...

A nearlattice is a meet semilattice A in which every initial segment Ap := {x : x ≤ p} happens to be a join semilattice (hence, a lattice) with respect to the natural ordering of A. If all lattices Ap are distributive, the nearlattice itself is said to be distributive. It is known that a distributive nearlattice can be represented as a nearlattice of sets. We call an algebra (A,∧,∨) of type (2,...

A semimodular lattice L of finite length will be called an almost-geometric lattice, if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.

If κ < λ are such that κ is both supercompact and indestructible under κ-directed closed forcing which is also (κ+,∞)-distributive and λ is 2λ supercompact, then by [3, Theorem 5], {δ < κ | δ is δ+ strongly compact yet δ isn’t δ+ supercompact} must be unbounded in κ. We show that the large cardinal hypothesis on λ is necessary by constructing a model containing a supercompact cardinal κ in whic...

Stone algebras have been characterized by Chen and Grätzer in terms of triples (B;D;'), whereD is a distributive lattice with 1; B is a Boolean algebra, and ' is a bounded lattice homomorphism from B into the lattice of …lters of D: If D is bounded, the construction of these characterizing triples is much simpler, since the homomorphism ' can be replaced by one from B into D itself. The triple ...

We prove that the skeleton of a product of finitely many finite distributive lattices is isomorphic to the product of skeletons of its factors. Thus, it is possible to construct finite distributive lattices with a given directly reducible skeleton by reducing the problem to the skeleton factors. Although not all possible lattices can be obtained this way, we show that it works for the smallest ...