Profinite Heyting Algebras and Profinite Completions of Heyting Algebras

2009 ◽  
Vol 16 (1) ◽  
pp. 29-47
Author(s):  
Guram Bezhanishvili ◽  
Patrick J. Morandi
Keyword(s):  
Boolean Algebra ◽  
Distributive Lattice ◽  
Heyting Algebra ◽  
Boolean Algebras ◽  
Distributive Lattices ◽  
Heyting Algebras ◽  
Profinite Completion ◽  
Bounded Distributive Lattice ◽  
Recent Developments ◽  
Profinite Completions

Abstract This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to the profinite completion of a Heyting algebra (resp. bounded distributive lattice). This results in simple examples of profinite bounded distributive lattices that are not isomorphic to the profinite completion of any bounded distributive lattice. We also show that each profinite Boolean algebra is isomorphic to the profinite completion of some Boolean algebra. It is still an open question whether each profinite Heyting algebra is isomorphic to the profinite completion of some Heyting algebra.

Frontal operators in distributive lattices with a generalized implication

2015 ◽  
Vol 08 (03) ◽  
pp. 1550039
Author(s):  
Sergio A. Celani ◽  
Hernán J. San Martín
Keyword(s):  
Distributive Lattice ◽  
Unary Operation ◽  
Duke Math ◽  
Distributive Lattices ◽  
Heyting Algebras ◽  
Bounded Distributive Lattice ◽  
Modal Lattices ◽  
Weak Heyting Algebras ◽  
San Martín

We introduce a family of extensions of bounded distributive lattices. These extensions are obtained by adding two operations: an internal unary operation, and a function (called generalized implication) that maps pair of elements to ideals of the lattice. A bounded distributive lattice with a generalized implication is called gi-lattice in [J. E. Castro and S. A. Celani, Quasi-modal lattices, Order 21 (2004) 107–129]. The main goal of this paper is to introduce and study the category of frontal gi-lattices (and some subcategories of it). This category can be seen as a generalization of the category of frontal weak Heyting algebras (see [S. A. Celani and H. J. San Martín, Frontal operators in weak Heyting algebras, Studia Logica 100(1–2) (2012) 91–114]). In particular, we study the case of frontal gi-lattices where the generalized implication is defined as the annihilator (see [B. A. Davey, Some annihilator conditions on distributive lattices, Algebra Universalis 4(1) (1974) 316–322; M. Mandelker, Relative annihilators in lattices, Duke Math. J. 37 (1970) 377–386]). We give a Priestley’s style duality for each one of the new classes of structures considered.

scholarly journals Maximal subalgebras of Heyting algebras

1986 ◽  
Vol 29 (3) ◽  
pp. 359-365 ◽  
Author(s):  
M. E. Adams
Keyword(s):  
Distributive Lattice ◽  
Binary Operation ◽  
Heyting Algebra ◽  
Heyting Algebras ◽  
Maximal Subalgebras ◽  
Bounded Distributive Lattice ◽  
Proposition 8

AHeyting algebra is an algebra H;∨,∧ →, 0,1) of type (2,2,2,0,0) for which H;∨,∧,0,1) is a bounded distributive lattice and → is the binary operation of relative pseudocomplementation (i.e., for a,b,c∈H,ac ∧≦birr c≦a→b). Associated with every subalgebra of a Heyting algebra is a separating set. Those corresponding to maximal subalgebras are characterized in Proposition 8 and, subsequently, are used in an investigation of Heyting algebras.

scholarly journals Imbedding Infinitely Distributive Lattices Completely Isomorphically Into Boolean Algebras

1959 ◽  
Vol 15 ◽  
pp. 71-81 ◽  
Author(s):  
Nenosuke Funayama
Keyword(s):  
Boolean Algebra ◽  
Distributive Lattice ◽  
Boolean Algebras ◽  
The Other ◽  
Distributive Lattices ◽  
Algebra 1 ◽  
Infinite Distributivity ◽  
Distributive Law ◽  
Finite Sums ◽  
Finite Products

It is well known that any distributive lattice can be imbedded in a Boolean algebra ([1], [2], [4] and others). This imbedding is in general only finitely isomorphic in the sense that the imbedding preserves finite sums (supremums) and finite products (infimums) (but not necessarily infinite ones). Indeed, in order to be able to be imbedded into a Boolean algebra completely isomorphically (i.e. preserving every supremum and infimum) a distributive lattice L must satisfy the infinite distributive law, as the infinite distributivity holds in Boolean algebras. The main purpose of this paper is to prove that the converse is also true, that is, any infinitely distributive lattice can be imbedded completely isomorphically in a Boolean algebra (Theorem 6). Since we show, on the other hand, that any relatively complemented distribu tive lattice is infinitely distributive (Theorem 2), Theorem 6 implies that every relatively complemented distributive lattice can be imbedded completely isomorphically in a Boolean algebra (Theorem 4).

scholarly journals Bitopological duality for distributive lattices and Heyting algebras

2010 ◽  
Vol 20 (3) ◽  
pp. 359-393 ◽  
Author(s):  
GURAM BEZHANISHVILI ◽  
NICK BEZHANISHVILI ◽  
DAVID GABELAIA ◽  
ALEXANDER KURZ
Keyword(s):  
Boolean Algebras ◽  
Distributive Lattices ◽  
Heyting Algebras ◽  
Priestley Spaces ◽  
Spectral Spaces ◽  
Algebraic Concepts ◽  
Stone Spaces

We introduce pairwise Stone spaces as a bitopological generalisation of Stone spaces – the duals of Boolean algebras – and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important in the study of distributive lattices. We also give new bitopological and spectral dualities for Heyting algebras, thereby providing two new alternatives to Esakia's duality.

Yap Hian Poh. Postulational study of an axiom system of Boolean algebra. Majallah Tahunan 'Ilmu Pasti—Shu Hsüeh Nien K'an—Bulletin of Mathematical Society of Nanyang University (1960), pp. 94–110. - R. M. Dicker. A set of independent axioms for Boolean algebra. Proceedings of the London Mathematical Society, ser. 3 vol. 13 (1963), pp. 20–30. - P. J. van Albada. A self-dual system of axioms for Boolean algebra. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A vol. 67 (1964), pp. 377–381; also Indagationes mathematicae, vol. 26 (1964), pp. 377–381. - Antonio Diego and Alberto Suárez. Two sets of axioms for Boolean algebras. Portugaliae mathematica, vol. 23 nos. 3–4 (for 1964, pub. 1965), pp. 139–145. (Reprinted from Notas de lógica matemática no. 16, Instituto de Matemática, Universidad Nacional del Sur, Bahía Blanca 1964, 13 pp.) - P. J. van Albada. Axiomatique des algèbres de Boole. Bulletin de la Société Mathématique de Belgique, vol. 18 (1966), pp. 260–272. - Lawrence J. Dickson. A short axiomatic system for Boolean algebra. Pi Mu Epsilon journal, vol. 4 no. 6 (1967), pp. 253–257. - Leroy J. Dickey. A shorter axiomatic system for Boolean algebra. Pi Mu Epsilon journal, vol. 4 no. 8 (1968), p. 336. - Chinthayamma . Independent postulate sets for Boolean algebra. Pi Mu Epsilon journal, vol. 4 no. 9 (1968), pp. 378–379. - Kiyoshi Iséki. A simple characterization of Boolean rings. Proceedings of the Japan Academy, vol. 44 (1968), pp. 923–924. - Sakiko Ôhashi. On definitions of Boolean rings and distributive lattices. Proceedings of the Japan Academy, vol. 44 (1968), pp. 1015–1017.

1973 ◽  
Vol 38 (4) ◽  
pp. 658-660
Author(s):  
Donald H. Potts
Keyword(s):  
Boolean Algebra ◽  
London Mathematical Society ◽  
Axiom System ◽  
Dual System ◽  
Boolean Algebras ◽  
Axiomatic System ◽  
Mathematical Society ◽  
Distributive Lattices ◽  
Boolean Rings

scholarly journals Finitely Presented Heyting Algebras

1998 ◽  
Vol 5 (30) ◽  
Author(s):  
Carsten Butz
Keyword(s):  
Simple Proof ◽  
Heyting Algebra ◽  
Distributive Lattices ◽  
Heyting Algebras ◽  
Model Property ◽  
Disjunction Property ◽  
Irreducible Elements ◽  
Finite Set ◽  
Finite Distributive Lattices ◽  
Finitely Presented

In this paper we study the structure of finitely presented Heyting<br />algebras. Using algebraic techniques (as opposed to techniques from proof-theory) we show that every such Heyting algebra is in fact co- Heyting, improving on a result of Ghilardi who showed that Heyting algebras free on a finite set of generators are co-Heyting. Along the way we give a new and simple proof of the finite model property. Our main technical tool is a representation of finitely presented Heyting algebras in terms of a colimit of finite distributive lattices. As applications we construct explicitly the minimal join-irreducible elements (the atoms) and the maximal join-irreducible elements of a finitely presented Heyting algebra in terms of a given presentation. This gives as well a new proof of the disjunction property for intuitionistic propositional logic.<br />Unfortunately not very much is known about the structure of Heyting algebras, although it is understood that implication causes the complex structure of Heyting algebras. Just to name an example, the free Boolean algebra on one generator has four elements, the free Heyting algebra on one generator is infinite.<br />Our research was motivated a simple application of Pitts' uniform interpolation theorem [11]. Combining it with the old analysis of Heyting algebras free on a finite set of generators by Urquhart [13] we get a faithful functor J : HAop<br />f:p: ! PoSet; sending a finitely presented Heyting algebra to the partially ordered set of its join-irreducible elements, and a map between Heyting algebras to its leftadjoint<br />restricted to join-irreducible elements. We will explore on the induced duality more detailed in [5]. Let us briefly browse through the contents of this paper: The first section<br />recapitulates the basic notions, mainly that of the implicational degree of an element in a Heyting algebra. This is a notion relative to a given set of generators. In the next section we study nite Heyting algebras. Our contribution is a simple proof of the nite model property which names in particular a canonical family of nite Heyting algebras into which we can<br />embed a given finitely presented one.<br />In Section 3 we recapitulate the standard duality between nite distributive lattices and nite posets. The `new' feature here is a strict categorical<br />formulation which helps simplifying some proofs and avoiding calculations. In the following section we recapitulate the description given by Ghilardi [8]<br />on how to adjoin implications to a nite distributive lattice, thereby not destroying a given set of implications. This construction will be our major technical ingredient in Section 5 where we show that every nitely presented<br />Heyting algebra is co-Heyting, i.e., that the operation (−) n (−) dual to implication is dened. This result improves on Ghilardi's [8] that this is true<br />for Heyting algebras free on a finite set of generators. Then we go on analysing the structure of finitely presented Heyting algebras<br />in Section 6. We show that every element can be expressed as a finite join of join-irreducibles, and calculate explicitly the maximal join-irreducible elements in such a Heyting algebra (in terms of a given presentation). As a consequence we give a new proof of the disjunction property for propositional intuitionistic logic. As well, we calculate the minimal join-irreducible elements, which are nothing but the atoms of the Heyting algebra. Finally, we show how all this material can be used to express the category of finitely presented Heyting algebras as a category of fractions of a certain category with objects morphism between finite distributive lattices.

scholarly journals Lattices whose ideal lattice is Stone

1983 ◽  
Vol 26 (1) ◽  
pp. 107-112 ◽  
Author(s):  
R. Beazer
Keyword(s):  
Distributive Lattice ◽  
Dual Space ◽  
Sufficient Conditions ◽  
Distributive Lattices ◽  
Stone Algebra ◽  
Ideal Lattice ◽  
Topological Duality ◽  
Bounded Distributive Lattice ◽  
Image Position ◽  
The Ideal

An elementary fact about ideal lattices of bounded distributive lattices is that they belong to the equational class ℬω of all distributive p-algebras (distributive lattices with pseudocomplementation). The lattice of equational subclasses of ℬω is known to be a chainof type (ω+l, where ℬ0 is the class of Boolean algebras and ℬ1 is the class of Stone algebras. G. Grätzer in his book [7] asks after a characterisation of those bounded distributive lattices whose ideal lattice belongs to ℬ (n≧1). The answer to the problem for the case n = 0 is well known: the ideal lattice of a bounded lattice L is Boolean if and only if L is a finite Boolean algebra. D. Thomas [10] recently solved the problem for the case n = 1 utilising the order-topological duality theory for bounded distributive lattices and in [5] W. Bowen obtained another proof of Thomas's result via a construction of the dual space of the ideal lattice of a bounded distributive lattice from its dual space. In this paper we give a short, purely algebraic proof of Thomas's result and deduce from it necessary and sufficient conditions for the ideal lattice of a bounded distributive lattice to be a relative Stone algebra.

scholarly journals De Morgan Functions and Free De Morgan Algebras

2014 ◽  
Vol 47 (2) ◽  
Author(s):  
Yu. M. Movsisyan ◽  
V. A. Aslanyan ◽  
Alex Manoogian
Keyword(s):  
Boolean Algebra ◽  
Distributive Lattice ◽  
Boolean Functions ◽  
Bounded Lattice ◽  
De Morgan Algebra ◽  
Bounded Distributive Lattice ◽  
Monotone Boolean Functions ◽  
Free Generators ◽  
De Morgan Algebras

AbstractIt is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone Boolean functions of n variables. In this paper, we introduce the concept of De Morgan function and prove that the free De Morgan algebra on n free generators is isomorphic to the De Morgan algebra of De Morgan functions of n variables. This is a solution of the problem suggested by B. I. Plotkin.

Sign in / Sign up

Export Citation Format

Share Document