Pure Hilbert Algebras with Infimum
In [6], iH-algebras were introduced in order to indicate an equational version of the class of Hilbert algebras where each pair of elements has infimum. These authors also proved that this variety hasthe class of Curry's implicative semilattices ([9]) as a proper subvariety. On the other hand, in [4] a special class of Hilbert algebras associated with ordered sets, which they called order algebras, were investigated. These algebras were also studied in [1] under the name of pure Hilbert algebras.Bearing in mind the above results, in this paper we introduce the notion of pure Hilbert algebras with infimum (or ipH-algebras, for short). Furthermore, we characterize the lattice of ipH-congruences and we determine the subdirectly irreducible ipH-algebras. Besides, we prove that subdirectly irreducible ipH-algebras are alsosubdirectly irreducible iH-algebras.
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by these algebras. In particular we consider two different but related methods for constructing an algebra with one binary operation from an arbitrary ordered set with a top element. The two varieties generated by all these algebras are shown to be well-behaved in that they are locally finite, finitely based, and have an equationally definable order relation. We exhibit a bijection between the subdirectly irreducible algebras in each variety and the class of all ordered sets with top element. We determine the structure and cardinality of the free algebra on n-free generators and provide sharp bounds on the number of n-generated algebras in each variety. These enumeration results involve the number of quasi-orders on an n-element set.
Implicational formulas in intuitionistic logic
In [1] Diego showed that there are only finitely many nonequivalent formulas in n variables in the positive implicational propositional calculus P. He also gave a recursive construction of the corresponding algebra of formulas, the free Hilbert algebra In on n free generators. In the present paper we give an alternative proof of the finiteness of In , and another construction of free Hilbert algebras, yielding a normal form for implicational formulas. The main new result is that In is built up from n copies of a finite Boolean algebra. The proofs use Kripke models [2] rather than the algebraic techniques of [1]. Let V be a finite set of propositional variables, and let F(V) be the set of all formulas built up from V ⋃ {t} using → alone. The algebra defined on the equivalence classes , by setting is a free Hilbert algebra I(V) on the free generators . A set T ⊆ F(V) is a theory if ⊦ p A implies A ∈ T, and T is closed under modus ponens. For T a theory, T[A] is the theory {B ∣ A → B ∈ T}. A theory T is p-prime, where p ∈ V, if p ∉ T and, for any A ∈ F(V), A ∈ T or A → p ∈ T. A theory is prime if it is p-prime for some p. P p(V) denotes the set of p-prime theories in F(V), P(V) the set of prime theories. T ∈ P(V) is minimal if there is no theory in P(V) strictly contained in T. Where X = {A 1, …, An } is a finite set of formulas, let X → B be A 1 →····→·An → B (ϕ → B is B). A formula A is a p-formula if p is the right-most variable occurring in A, i.e. if A is of the form X → p.