Free Boolean algebras over unions of two well orderings

Given a partially ordered set P there exists the most general Boolean algebra which contains P as a generating set, called the free Boolean algebra over P. We study free Boolean algebras over posets of the form P=P₀∪P₁, where P₀, P₁ are well orderings. We call them nearly ordinal algebras.Answering a question of Maurice Pouzet, we show that for every uncountable cardinal κ there are κ² pairwise non-isomorphic nearly ordinal algebras of cardinality κ.Topologically, free Boolean algebras over posets correspond to compact 0-dimensional distributive lattices. In this context, we classify all closed sublattices of the product (ω₁+1)×(ω₁+1), showing that there are only ℵ₁ many types. In contrast with the last result, we show that there are ℵ₁² topological types of closed subsets of the Tikhonov plank (ω₁+1)×(ω+1).     

Aglianò-Montagna type decomposition of linear pseudo hoops and its applications

We decompose every linear pseudo hoop as an Aglianò-Montagna type of ordinal sum of linear Wajsberg pseudo hoops which are either negative cones of linear ?-groups or intervals in linear unital ?-groups with strong unit. We apply the decomposition to present a new proof that every linear pseudo BL-algebra and consequently every representable pseudo BL-algebra is good. Moreover, we show that every maximal filter and every value of a linear pseudo hoop is normal, and every σ-complete linear pseudo hoop is commutative.     

Quotient-reflective and bireflective subcategories of the category of preordered sets

In previous papers, the notions of “closedness” and “strong closedness” in set-based topological categories were introduced. In this paper, we give the characterization of closed and strongly closed subobjects of an object in the category Prord of preordered sets and show that they form appropriate closure operators which enjoy the basic properties like idempotency (weak) hereditariness, and productivity.We investigate the relationships between these closure operators and the well-known ones, the up- and down-closures. As a consequence, we characterize each of T₀, T₁, and T₂ preordered sets and show that each of the full subcategories of each of T₀, T₁, T₂ preordered sets is quotient-reflective in Prord. Furthermore, we give the characterization of each of pre-Hausdorff preordered sets and zero-dimensional preordered sets, and show that there is an isomorphism of the full subcategory of zero-dimensional preordered sets and the full subcategory of pre-Hausdorff preordered sets. Finally, we show that both of these subcategories are bireflective in Prord.     

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.     

Lexicographically ordered trees

We characterize trees whose lexicographic ordering produces an order isomorphic copy of some sets of real numbers, or an order isomorphic copy of some set of ordinal numbers. We characterize trees whose lexicographic ordering is order complete, and we investigate lexicographically ordered ω-splitting trees that, under the open-interval topology of their lexicographic orders, are of the first Baire category. Finally we collect together some folklore results about the relation between Aronszajn trees and Aronszajn lines, and use earlier results of the paper to deduce some topological properties of Aronszajn lines.     

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).     

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.     

Modules over quantaloids: Applications to the isomorphism problem in algebraic logic and π-institutions

We solve the isomorphism problem in the context of abstract algebraic logic and of π-institutions, namely the problem of when the notions of syntactic and semantic equivalence among logics coincide. The problem is solved in the general setting of categories of modules over quantaloids. We introduce closure operators on modules over quantaloids and their associated morphisms. We show that, up to isomorphism, epis are morphisms associated with closure operators. The notions of (semi-)interpretability and (semi-)representability are introduced and studied. We introduce cyclic modules, and provide a characterization for cyclic projective modules as those having a g-variable. Finally, we explain how every π-institution induces a module over a quantaloid, and thus the theory of modules over quantaloids can be considered as an abstraction of the theory of π-institutions.     

Cleavability over ordinals

In this paper we show that if X is an infinite compactum cleavable over an ordinal, then X must be homeomorphic to an ordinal. X must also therefore be a LOTS. This answers two fundamental questions in the area of cleavability. We also leave it as an open question whether cleavability of an infinite compactum X over an ordinal λ implies X is embeddable into λ.     

Boolean inequations

In this paper we consider Boolean inequations i.e. the inequations of the form f(X)≠0, where f is a Boolean function. The basic idea in this paper is: the inequation f(X)≠0 means that there exists p such that f(X)=p and p≠0. We give the formula which determines all the solutions of Boolean inequation.     

On the dimension of ordered sets with the 2-cutset property

An ordered setP is said to have 2-cutset property if, for every elementx ofP, there is a setS of elements ofP which are noncomparable tox, with |S|?2, such that every maximal chain inP meets {x}∪S. We consider the following question: Does there exist ordered sets with the 2-cutset property which have arbitrarily large dimension? We answer the question in the negative by establishing the following two results.Theorem: There are positive integersc andd such that every ordered setP with the 2-cutset property can be represented asP=X∪Y, whereX is an ordinal sum of intervals ofP having dimension ?d, andY is a subset ofP having width ?c. Corollary: There is a positive integern such that every ordered set with the 2-cutset property has dimension ?n.     

State-morphism MV-algebras

We present a stronger variation of state MV-algebras, recently presented by T. Flaminio and F. Montagna, which we call state-morphism MV-algebras. Such structures are MV-algebras with an internal notion, a state-morphism operator. We describe the categorical equivalences of such (state-morphism) state MV-algebras with the category of unital Abelian ?-groups with a fixed state operator and present their basic properties. In addition, in contrast to state MV-algebras, we are able to describe all subdirectly irreducible state-morphism MV-algebras.     

n-closure systems and n-closure operators

It is very well known and permeating the whole of mathematics that a closure operator on a given set gives rise to a closure system, whose constituent sets form a complete lattice under inclusion, and vice-versa. Recent work of Wille on triadic concept analysis and subsequent work by the author on polyadic concept analysis led to the introduction of complete trilattices and complete n-lattices, respectively, that generalize complete lattices and capture the order-theoretic structure of the collection of concepts associated with polyadic formal contexts. In the present paper, polyadic closure operators and polyadic closure systems are introduced and they are shown to be in a relationship similar to the one that exists between ordinary (dyadic) closure operators and ordinary (dyadic) closure systems. Finally, the algebraic case is given some special consideration. This paper is dedicated to Walter Taylor. Received March 10, 2005; accepted in final form March 7, 2006.     

Star partial order on B(H)

Let H be an infinite-dimensional complex Hilbert space and let B(H) be the algebra of all bounded linear operators on (H). In the paper the equivalent definition of the star partial order on B(H), using selfadjoint idempotent operators, is introduced. Also some properties of the generalized concept of order relations on B(H), defined with the help of idempotent operators, are investigated.     

Coordinatization of ordinal structures

Dependencies between attributes in ordinal data contexts are algebraically described. Suitable conditions are analysed which allow coordinatizations of ordinal contexts (ordinal structures) by ordered n-quasigroups, ordered abelian groups, and ordered fields. The presented development offers a new approach to conjoint measurement.     

Fixed points of products and the strong fixed point property

This problem motivates the present work: If ordered sets X and Y both have the fixed point property for order preserving maps has their product as well? Here we present a related condition — the so-called strong fixed point property — which arises from naive attempts to solve the problem. We are concerned with determining the nature and extent of this property. Several questions are raised concerning its relation to the fixed point property and other conditions such as dismantlability and contractibility.     

Generalized ordinal sums and the decidability of BL-chains

We present a general construction of a family of ordinal sums of a sequence of structures and prove an elimination theorem for the class of ordinal sums in an expanded language. From this we deduce the decidability of the class of -ordinal sums of models of a decidable theory T. As an application of this result we prove that the theory of BL-chains is decidable.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived June 9, 2002; accepted in final form June 19, 2003.     

A structure theorem for posets admitting a “strong” chain partition:: A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)

Suppose a finite poset P is partitioned into three non-empty chains so that, whenever p, q∈P lie in distinct chains and p<q, then every other element of P is either above p or below q.In 1985, the following conjecture was made by David Daykin and Jacqueline Daykin: such a poset may be decomposed into an ordinal sum of posets such that, for 1?i?n, one of the following occurs:

(1)

R_i is disjoint from one of the chains of the partition; or

(2)

if p, q∈R_i are in distinct chains, then they are incomparable.

The conjecture is related to a question of R. L. Graham's concerning probability correlation inequalities for linear extensions of finite posets.In 1996, a proof of the Daykin-Daykin conjecture was announced (by two other mathematicians), but their proof needs to be rectified.In this note, a generalization of the conjecture is proven that applies to finite or infinite posets partitioned into a (possibly infinite) number of chains with the same property. In particular, it is shown that a poset admits such a partition if and only if it is an ordinal sum of posets, each of which is either a width 2 poset or else a disjoint sum of chains. A forbidden subposet characterization of these partial orders is also obtained.     

MacNeille completions of lattice expansions

There are two natural ways to extend an arbitrary map between (the carriers of) two lattices, to a map between their MacNeille completions. In this paper we investigate which properties of lattice maps are preserved under these constructions, and for which kind of maps the two extensions coincide. Our perspective involves a number of topologies on lattice completions, including the Scott topologies and topologies that are induced by the original lattice. We provide a characterization of the MacNeille completion in terms of these induced topologies. We then turn to expansions of lattices with additional operations, and address the question of which equational properties of such lattice expansions are preserved under various types of MacNeille completions that can be defined for these algebras. For a number of cases, including modal algebras and residuated (ortho)lattice expansions, we provide reasonably sharp sufficient conditions on the syntactic shape of equations that guarantee preservation. Generally, our results show that the more residuation properties the primitive operations satisfy, the more equations are preserved. Received August 21, 2005; accepted in final form October 17, 2006.     

Free algebras in varieties of BL-algebras generated by a chain.

In this paper we describe finitely generated free algebras in varieties of BL-algebras generated by one BL-chain which is an ordinal sum of a finite MV-chain and a generalized BL-chain. We also give some particular examples of these free algebras.