Automata transformations of prefix decidable and decidable by Buchi superwords

We show that the set of prefix decidable superwords is closed under finite automata and asynchronous automata transformations. We prove that structures of degrees of finite automata and asynchronous automata transformations contain an atom which consists of prefix decidable superwords with undecidable monadic theory (or undecidable by Buchi). Also we prove that the structure of degrees of asynchronous automata transformations contains an atom which consists of superwords with decidable monadic theory (decidable by Buchi).     

Distributive residuated frames and generalized bunched implication algebras

We show that all extensions of the (non-associative) Gentzen system for distributive full Lambek calculus by simple structural rules have the cut elimination property. Also, extensions by such rules that do not increase complexity have the finite model property, hence many subvarieties of the variety of distributive residuated lattices have decidable equational theories. For some other extensions, we prove the finite embeddability property, which implies the decidability of the universal theory, and we show that our results also apply to generalized bunched implication algebras. Our analysis is conducted in the general setting of residuated frames.     

Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties

The aim of this paper is to prove that every finitely generated, arithmetical variety of finite type, in which every subdirectly irreducible algebra has linearly ordered congruences has a decidable first order theory of its finite members. The proof is based on a representation of finite algebras from such varieties by some quotients of special subdirect products in which sets of indices are partially ordered into dual trees. Then the result of M. O. Rabin about decidability of the monadic second order theory of two successors is applied.Presented by Stanley Burris.     

Varieties with decidable finite algebras II: Permutability

This paper is a continuation of [3]. Congruence permutability is shown to be a necessary condition for a locally finite congruence distributive variety to have a decidable first order theory of its finite algebras. This is a positive answer to Problem 6 of S. Burns and H. P. Sankappanavar [2]. Moreover this allows us to give a full characterization of finitely generated congruence distributive varieties of finite type with decidable first order theories of their finite members.Presented by Stanley Burris.     

Finite distributive lattices and the splitting property

We show that a finite distributive lattice has the splitting property - every maximal antichain splits into two parts so that the lattice is the union of the upset of one part and the downset of the other - if and only if it is a Boolean lattice or is one of three other lattices. We also introduce a measure of "how splitting" a finite distributive lattice is, and investigate it. Received June 13, 2001; accepted in final form July 1, 2002.     

Uniquely Complemented Posets

We study complementation in bounded posets. It is known and easy to see that every complemented distributive poset is uniquely complemented. The converse statement is not valid, even for lattices. In the present paper we provide conditions that force a uniquely complemented poset to be distributive. For atomistic resp. atomic posets as well as for posets satisfying the descending chain condition we find sufficient conditions in the form of so-called LU-identities. It turns out that for finite posets these conditions are necessary and sufficient.     

Varieties with decidable finite algebras I: Linearity

The aim of this paper is to prove that every congruence distributive variety containing a finite subdirectly irreducible algebra whose congruences are not linearly ordered has an undecidable first order theory of its finite members. This fills a gap which kept us from the full characterization of the finitely generated, arithmetical varieties (of finite type) having a decidable first order theory of their finite members. Progress on finding this characterization was made in the papers [14] and [15].Presented by Stanley Burris.     

Antichain Cutsets of Strongly Connected Posets

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected d-uniform hypergraphs.     

Monadic Algebras with finite degree

A monadic algebraA has finite degreen ifA/M has at most 2 ⁿ elements for every maximal idealM ofA and this bound is obtained for someM. Every countable monadic algebra with a finite degree is isomorphic to an algebra Γ(X, S) whereX is a Boolean space andS is a subsheaf of a constant sheaf with a finite simple stalk. This representation is used to prove that every proper equational class of monadic algebras has a decidable first-order theory.     

Boolean Topological Distributive Lattices and Canonical Extensions

This paper presents a unified account of a number of dual category equivalences of relevance to the theory of canonical extensions of distributive lattices. Each of the categories involved is generated by an object having a two-element underlying set; additional structure may be algebraic (lattice or complete lattice operations) or relational (order) and, in either case, topology may or may not be included. Among the dualities considered is that due to B. Banaschewski between the categories of Boolean topological bounded distributive lattices and the category of ordered sets. By combining these dualities we obtain new insights into canonical extensions of distributive lattices. The second author was supported by Slovak grants VEGA 1/3026/06 and APVV-51-009605.     

On the Dual Ramsey Property for Finite Distributive Lattices

The class of finite distributive lattices, as many other natural classes of structures, does not have the Ramsey property. It is quite common, though, that after expanding the structures with appropriately chosen linear orders the resulting class has the Ramsey property. So, one might expect that a similar result holds for the class of all finite distributive lattices. Surprisingly, Kechris and Soki? have proved in 2012 that this is not the case: no expansion of the class of finite distributive lattices by linear orders satisfies the Ramsey property. In this paper we prove that the class of finite distributive lattices does not have the dual Ramsey property either. However, we are able to derive a dual Ramsey theorem for finite distributive lattices endowed with a particular linear order. Both results are consequences of the recently observed fact that categorical equivalence preserves the Ramsey property.     

Bigeneration in complete lattices and principal separation in ordered sets

By a recent observation of Monjardet and Wille, a finite distributive lattice is generated by its doubly irreducible elements iff the poset of all join-irreducible elements has a distributive MacNeille completion. This fact is generalized in several directions, by dropping the finiteness condition and considering various types of bigeneration via arbitrary meets and certain distinguished joins. This leads to a deeper investigation of so-called L-generators resp. C-subbases, translating well-known notions of topology to order theory. A strong relationship is established between bigeneration by (minimal) L-generators and so-called principal separation, which is defined in order-theoretical terms but may be regarded as a strong topological separation axiom. For suitable L, the complete lattices with a smallest join-dense L-subbasis consisting of L-primes are the L-completions of principally separated posets.     

On decidability of the decomposability problem for finite theories

We consider the decomposability problem for elementary theories, i.e. the problem of deciding whether a theory has a nontrivial representation as a union of two (or several) theories in disjoint signatures. For finite universal Horn theories, we prove that the decomposability problem is $ \sum _1^0 $ \sum _1^0 -complete and, thus, undecidable. We also demonstrate that the decomposability problem is decidable for finite theories in signatures consisting only of monadic predicates and constants.     

Primes,irreducibles and extremal lattices

This paper studies certain types of join and meet-irreducibles called coprimes and primes. These elements can be used to characterize certain types of lattices. For example, a lattice is distributive if and only if every join-irreducible is coprime. Similarly, a lattice is meet-pseudocomplemented if and only if each atom is coprime. Furthermore, these elements naturally decompose lattices into sublattices so that often properties of the original lattice can be deduced from properties of the sublattice. Not every lattice has primes and coprimes. This paper shows that lattices which are long enough must have primes and coprimes and that these elements and the resulting decompositions can be used to study such lattices.The length of every finite lattice is bounded above by the minimum of the number of meet-irreducibles (meet-rank) and the number of join-irreducibles (join-rank) that it has. This paper studies lattices for which length=join-rank or length=meet-rank. These are called p-extremal lattices and they have interesting decompositions and properties. For example, ranked, p-extremal lattices are either lower locally distributive (join-rank=length), upper locally distributive (meet-rank=length) or distributive (join-rank=meet-rank=length). In the absence of the Jordan-Dedekind chain condition, p-extremal lattices still have many interesting properties. Of special interest are the lattices that satisfy both equalities. Such lattices are called extremal; this class includes distributive lattices and the associativity lattices of Tamari. Even though they have interesting decompositions, extremal lattices cannot be characterized algebraically since any finite lattice can be embedded as a subinterval into an extremal lattice. This paper shows how prime and coprime elements, and the poset of irreducibles can be used to analyze p-extremal and other types of lattices.The results presented in this paper are used to deduce many key properties of the Tamari lattices. These lattices behave much like distributive lattices even though they violate the Jordan-Dedekind chain condition very strongly having maximal chains that vary in length from N-1 to N(N-1)/2 where N is a parameter used in the construction of these lattices.     

Some results on Green’s relations for monoids presented by monadic string-rewriting systems

For finite monadic string-rewriting systems that are confluent and for finite special string-rewriting systems that are λ -confluent it is shown that the R -class and the L -class of a string can be characterized by a regular set of irreducible strings. It follows that for these systems the relation D is decidable. Actually it is shown that this relation is decidable in polynomial time.     

Some Results on Green''s Relations for Monoids Presented by Monadic String-Rewriting Systems

For finite monadic string-rewriting systems that are confluent and for finite special string-rewriting systems that are λ -confluent it is shown that the R -class and the L -class of a string can be characterized by a regular set of irreducible strings. It follows that for these systems the relation D is decidable. Actually it is shown that this relation is decidable in polynomial time.     

Reducible classes of finite lattices

In this paper we study a notion of reducibility in finite lattices. An element x of a (finite) lattice L satisfying certain properties is deletable if L-x is a lattice satisfying the same properties. A class of lattices is reducible if each lattice of this class admits (at least) one deletable element (equivalently if one can go from any lattice in this class to the trivial lattice by a sequence of lattices of the class obtained by deleting one element in each step). First we characterize the deletable elements in a pseudocomplemented lattice what allows to prove that the class of pseudocomplemented lattices is reducible. Then we characterize the deletable elements in semimodular, modular and distributive lattices what allows to prove that the classes of semimodular and locally distributive lattices are reducible. In conclusion the notion of reducibility for a class of lattices is compared with some other notions like the notion of order variety.     

Decomposition of partial orders

A decomposition theory for partial orders which arises from the split decomposition of submodular functions is introduced. As a consequence of this theory, any partial order has a unique decomposition consisting of indecomposable partial orders and certain highly decomposable partial orders. The highly decomposable partial orders are completely characterized. As a special case of partial orders, we consider lattices and distributive lattices. It occurs, that the highly decomposable distributive lattices are precisely the Boolean lattices.     

There are no infinite order polynomially complete lattices, after all

If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some finite power has an antichain of size . Hence there are no infinite opc lattices. However, the existence of strongly amorphous sets implies (in ZF) the existence of infinite opc lattices. Received November 2, 1998; accepted in final form March 19, 1999.     

Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.