Generalizations of Boolean products for lattice-ordered algebras

It is shown that the Boolean center of complemented elements in a bounded integral residuated lattice characterizes direct decompositions. Generalizing both Boolean products and poset sums of residuated lattices, the concepts of poset product, Priestley product and Esakia product of algebras are defined and used to prove decomposition theorems for various ordered algebras. In particular, we show that FL_w-algebras decompose as a poset product over any finite set of join irreducible strongly central elements, and that bounded n-potent GBL-algebras are represented as Esakia products of simple n-potent MV-algebras.     

On amalgamation of reducts of polyadic algebras

Following research initiated by Tarski, Craig and Németi, and further pursued by Sain and others, we show that for certain subsets G of w, G polyadic algebras have the strong amalgamation property. G polyadic algebras are obtained by restricting the (similarity type and) axiomatization of -dimensional polyadic algebras to finite quantifiers and substitutions in G. Using algebraic logic, we infer that some theorems of Beth, Craig and Robinson hold for certain proper extensions of first order logic (without equality).     

Embedding theorems for classes of GBL-algebras

The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBL-algebras). In particular it is shown that every n-potent GBL-algebra is embedded in a poset product of finite n-potent MV-chains, and every normal GBL-algebra is embedded in a poset product of totally ordered GMV-algebras. Representable normal GBL-algebras have poset product embeddings where the poset is a root system. We also give a Conrad-Harvey-Holland-style embedding theorem for commutative GBL-algebras, where the poset factors are the real numbers extended with −∞. Finally, an explicit construction of a generic commutative GBL-algebra is given, and it is shown that every normal GBL-algebra embeds in the conucleus image of a GMV-algebra.     

Lattice-theoretic properties of algebras of logic

In the theory of lattice-ordered groups, there are interesting examples of properties — such as projectability — that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic. For a class of integral residuated lattices that includes Heyting algebras and semi-linear residuated lattices, we prove that a member of such is projectable iff the order dual of each subinterval [a,1]$[a,1]$ is a Stone lattice. We also show that an integral GMV algebra is projectable iff it can be endowed with a positive Gödel implication. In particular, a ΨMV or an MV algebra is projectable iff it can be endowed with a Gödel implication. Moreover, those projectable involutive residuated lattices that admit a Gödel implication are investigated as a variety in the expanded signature. We establish that this variety is generated by its totally ordered members and is a discriminator variety.     

Topo-canonical completions of closure algebras and Heyting algebras

We introduce and investigate topo-canonical completions of closure algebras and Heyting algebras. We develop a duality theory that is an alternative to Esakia’s duality, describe duals of topo-canonical completions in terms of the Salbany and Banaschewski compactifications, and characterize topo-canonical varieties of closure algebras and Heyting algebras. Consequently, we show that ideal completions preserve no identities of Heyting algebras. We also characterize definable classes of topological spaces. Received January 20, 2006; accepted in final form September 12, 2006.     

Canonical extensions of double quasioperator algebras: An algebraic perspective on duality for certain algebras with binary operations

The context for this paper is a class of distributive lattice expansions, called double quasioperator algebras (DQAs). The distinctive feature of these algebras is that their operations preserve or reverse both join and meet in each coordinate. Algebras of this type provide algebraic semantics for certain non-classical propositional logics. In particular, MV-algebras, which model the ?ukasiewicz infinite-valued logic, are DQAs.Varieties of DQAs are here studied through their canonical extensions. A variety of this type having additional operations of arity at least 2 may fail to be canonical; it is already known, for example, that the variety of MV-algebras is not. Non-canonicity occurs when basic operations have two distinct canonical extensions and both are necessary to capture the structure of the original algebra. This obstruction to canonicity is different in nature from that customarily found in other settings. A generalized notion of canonicity is introduced which is shown to circumvent the problem. In addition, generalized canonicity allows one to capture on the canonical extensions of DQAs the algebraic operations in such a way that the laws that these obey may be translated into first-order conditions on suitable frames. This correspondence may be seen as the algebraic component of duality, in a way which is made precise.In many cases of interest, binary residuated operations are present. An operation h which, coordinatewise, preserves ∨ and 0 lifts to an operation which is residuated, even when h is not. If h also preserves binary meet then the upper adjoints behave in a functional way on the frames.     

Injectives in residuated algebras

Injectives in several classes of structures associated with logic are characterized. Among the classes considered are residuated lattices, MTL-algebras, IMTL-algebras, BL-algebras, NM-algebras and bounded hoops.     

A Gentzen system for involutive residuated lattices

We establish a cut-free Gentzen system for involutive residuated lattices and provide an algebraic proof of completeness. As a result we conclude that the equational theory of involutive residuated lattices is decidable. The connection to noncommutative linear logic is outlined. Received July 22, 2004; accepted in final form July 19, 2005.     

On the structure of generalized BL-algebras

A generalized BL - algebra (or GBL-algebra for short) is a residuated lattice that satisfies the identities . It is shown that all finite GBL-algebras are commutative, hence they can be constructed by iterating ordinal sums and direct products of Wajsberg hoops. We also observe that the idempotents in a GBL-algebra form a subalgebra of elements that commute with all other elements. Subsequently we construct subdirectly irreducible noncommutative integral GBL-algebras that are not ordinal sums of generalized MV-algebras. We also give equational bases for the varieties generated by such algebras. The construction provides a new way of order-embedding the lattice of -group varieties into the lattice of varieties of integral GBLalgebras. The results of this paper also apply to pseudo-BL algebras. This paper is dedicated to Walter Taylor. Received March 7, 2005; accepted in final form July 25, 2005.     

Stone duality and Gleason covers through de Vries duality

We introduce zero-dimensional de Vries algebras and show that the category of zero-dimensional de Vries algebras is dually equivalent to the category of Stone spaces. This shows that Stone duality can be obtained as a particular case of de Vries duality. We also introduce extremally disconnected de Vries algebras and show that the category of extremally disconnected de Vries algebras is dually equivalent to the category of extremally disconnected compact Hausdorff spaces. As a result, we give a simple construction of the Gleason cover of a compact Hausdorff space by means of de Vries duality. We also discuss the insight that Stone duality provides in better understanding of de Vries duality.     

Archimedeanness and the MacNeille completion of pseudoeffect algebras and po-groups

Pseudoeffect (PE-) algebras are partial algebras differing from effect algebras in that they need not satisfy the commutativity assumption. PE-algebras typically arise from intervals of po-groups; this applies in particular to all those which satisfy a certain Riesz property.In this paper, we discuss the property of archimedeanness for PE-algebras on the one hand and for po-groups on the other hand. We prove that under the assumption of suphomogeneity, archimedeanness holds for a PE-algebra with the Riesz property if and only if it holds for its representing group. The algebra is in that case commutative. This result is established by using the technique of MacNeille completion. We give the exact condition for this completion to exist, and we clearly exhibit the role played by archimedeanness and by sup-homogeneity.     

On extensions of countable filterbases to ultrafilters and ultrafilter compactness

We show in the Zermelo-Fraenkel set theory ZF without the axiom of choice:

1. Given an infinite set X, the Stone space S(X) is ultrafilter compact.

2. For every infinite set X, every countable filterbase of X extends to an ultra-filter i? for every infinite set X, S(X) is countably compact.

3. ω has a free ultrafilter i? every countable, ultrafilter compact space is countably compact.

   We also show the following:

4. There are a permutation model 𝒩 and a set X ∈ 𝒩 such that X has no free ultrafilters and S(X) is not compact but S(X) is countably compact and every countable filterbase of X extends to an ultrafilter.

5. It is relatively consistent with ZF that every countable filterbase of ω extends to an ultrafilter but there exists a countable filterbase of ? which does not extend to an ultrafilter. Hence, it is relatively consistent with ZF that ? has free ultrafilters but there exists a countable filterbase of ? which does not extend to an ultrafilter.

     

Local algebras in the representation of MV-algebras

In this paper we present several results about local MV-algebras, extending existing results given for MV-chains. The role of local MV-algebras in sheaf representation and weak boolean product is stressed and the relationship of local MV-algebras with varieties of MV-algebras is analyzed. Presented by S. Pulmannova. Received November 11, 2005; accepted in final form December 20, 2005.     

Weak effect algebras

Weak effect algebras are based on a commutative, associative and cancellative partial addition; they are moreover endowed with a partial order which is compatible with the addition, but in general not determined by it. Every BL-algebra, i.e. the Lindenbaum algebra of a theory of Basic Logic, gives rise to a weak effect algebra; to this end, the monoidal operation is restricted to a partial cancellative operation. We examine in this paper BL-effect algebras, a subclass of the weak effect algebras which properly contains all weak effect algebras arising from BL-algebras. We describe the structure of BL-effect algebras in detail. We thus generalise the well-known structure theory of BL-algebras. Namely, we show that BL-effect algebras are subdirect products of linearly ordered ones and that linearly ordered BL-effect algebras are ordinal sums of generalised effect algebras. The latter are representable by means of linearly ordered groups. This research was partially supported by the German Science Foundation (DFG) as part of the Collaborative Research Center “Computational Intelligence” (SFB 531).     

Axiomatization of identity-free equations valid in relation algebras

A finite axiom set for the identity-free equations valid in relation algebras is given. This is a simplification of the one given by Jónsson, and confirms a conjecture of Tarski. An axiom set for the identity-free equations valid in the representable relation algebras is given, too. We show that in the class of representable relation algebras, both the operation of taking converse and the identity constant are finitely axiomatizable (over the rest of the operations).Dedicated to the memory of Alan DayPresented by J. Sichler.     

Generalizing realizability and Heyting models for constructive set theory

This article presents a common generalization of the two main methods for obtaining class models of constructive set theory. Heyting models are a generalization of the Boolean models for classical set theory which are a variant of forcing, while realizability is a decidedly constructive method that has first been developed for number theory by Kleene and was later very fruitfully adapted to constructive set theory. In order to achieve the generalization, a new kind of structure (applicative topologies) is introduced, which contains both elements of formal topology and applicative structures. This approach not only deepens the understanding of class models and leads to more efficiency in proofs about these kinds of models, but also makes it possible to prove new results about the two special cases that were not known before and to construct new models.     

POWER STRUCTURES AND LOGIC

ABSTRACT

This paper generalizes the concept of a power alge bra to that of a power structure, and gives three application of power structures to logic.     

The depth of ultraproducts of Boolean algebras

We show that if μ is a compact cardinal then the depth of ultraproducts of less than μ many Boolean algebras is at most μ plus the ultraproduct of the depths of those Boolean algebras. Received May 18, 2004; accepted in final form December 9, 2004.