An o-minimal structure without mild parameterization

We prove, by explicit construction, that not all sets definable in polynomially bounded o-minimal structures have mild parameterization. Our methods do not depend on the bounds particular to the definition of mildness and therefore our construction is also valid for a generalized form of parameterization, which we call G-mild. Moreover, we present a cell decomposition result for certain o-minimal structures which may be of independent interest. This allows us to show how our construction can produce polynomially bounded, model complete expansions of the real ordered field which, in addition to lacking G-mild parameterization, nonetheless still have analytic cell decomposition.     

Wild theories with o-minimal open core

Let T be a consistent o-minimal theory extending the theory of densely ordered groups and let $T^{\prime }$ be a consistent theory. Then there is a complete theory $T^{?}$ extending T such that T is an open core of $T^{?}$, but every model of $T^{?}$ interprets a model of $T^{\prime }$. If $T^{\prime }$ is NIP, $T^{?}$ can be chosen to be NIP as well. From this we deduce the existence of an NIP expansion of the real field that has no distal expansion.     

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.     

Infinitely Peano differentiable functions in polynomially bounded o-minimal structures

Let R be an o-minimal expansion of a real closed field. We show that the definable infinitely Peano differentiable functions are smooth if and only if R is polynomially bounded.     

A characterization of free generating sets in MV-algebras

MV-algebras are a generalization of Boolean algebras. As is well known, a free generating set for a Boolean algebra is characterized by the following simple algebraic condition: whenever A and B are finite disjoint subsets of X then . Our aim in this note is to give a similar characterization of free generating sets in MV-algebras. Received January 30, 2005; accepted in final form March 13, 2007.     

An algebraic view of weaker forms of realcompactness

We study a property of frames which is akin to realcompactness and obtained by replacing the cozero part of a frame in the definition of realcompactness with its Booleanization. Unlike the case of realcompactness, which is defined only for completely regular frames, this new concept is defined for all frames. We also investigate a weaker variant of this notion, and note that in both cases the frame results extend their topological precursors. This paper is dedicated to Walter Taylor. Received September 29, 2004; accepted in final form May 14, 2005.     

Approximation of o-minimal maps satisfying a Lipschitz condition

Consider an o-minimal expansion of the real field. We show that definable Lipschitz continuous maps can be definably fine approximated by definable continuously differentiable Lipschitz maps whose Lipschitz constant is close to that of the original map.     

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.     

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.     

Remote points in products under CH

Assume CH. Let I be any index set, and let Xi, for i∈I, be a completely regular ccc topological space of weight ω₂. If X=_∏i∈IXi is ccc and non-pseudocompact, then X has remote points.     

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.     

Cut elimination and strong separation for substructural logics: An algebraic approach

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on (associative) substructural logics over the full Lambek Calculus (see, for example, Ono (2003) [34], Galatos and Ono (2006) [18], Galatos et al. (2007) [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic associated with and is algebraizable, with the variety of residuated lattice-ordered groupoids with unit serving as its equivalent algebraic semantics.Overcoming technical complications arising from the lack of associativity, we introduce a generalized version of a logical matrix and apply the method of quasicompletions to obtain an algebra and a quasiembedding from the matrix to the algebra. By applying the general result to specific cases, we obtain important logical and algebraic properties, including the cut elimination of and various extensions, the strong separation of , and the finite generation of the variety of residuated lattice-ordered groupoids with unit.     

A theory of recursive dimension for ordered sets

The classical theorem of R. P. Dilworth asserts that a partially ordered set of width n can be partitioned into n chains. Dilworth's theorem plays a central role in the dimension theory of partially ordered sets since chain partitions can be used to provide embeddings of partially ordered sets in the Cartesian product of chains. In particular, the dimension of a partially-ordered set never exceeds its width. In this paper, we consider analogous problems in the setting of recursive combinatorics where it is required that the partially ordered set and any associated partition or embedding be described by recursive functions. We establish several theorems providing upper bounds on the recursive dimension of a partially ordered set in terms of its width. The proofs are highly combinatorial in nature and involve a detailed analysis of a 2-person game in which one person builds a partially ordered set one point at a time and the other builds the partition or embedding.This paper was prepared while the authors were supported, in part, by NSF grant ISP-80-11451. In addition, the second author received support under NSF grant MCS-80-01778 and the third author received support under NSF grant MCS-82-02172.     

Algorithmic correspondence and canonicity for distributive modal logic

We define the algorithm ALBA for the language of the same distributive modal logic (DML) for which a Sahlqvist theorem was proved by Gehrke, Nagahashi, and Venema. Successful executions of ALBA compute the local first-order correspondents of input DML inequalities, and also guarantee their canonicity. The class of inequalities on which ALBA is successful is strictly larger than the newly introduced class of inductive inequalities, which in its turn properly extends the Sahlqvist inequalities of Gehrke et al. Evidence is given to the effect that, as their name suggests, inductive inequalities are the distributive counterparts of the inductive formulas of Goranko and Vakarelov in the classical setting.     

Vaught's conjecture for quite o-minimal theories

We study Vaught's problem for quite o-minimal theories. Quite o-minimal theories form a subclass of the class of weakly o-minimal theories preserving a series of properties of o-minimal theories. We investigate quite o-minimal theories having fewer than $2^{\omega }$ countable models and prove that the Exchange Principle for algebraic closure holds in any model of such a theory and also we prove binarity of these theories. The main result of the paper is that any quite o-minimal theory has either $2^{\omega }$ countable models or $6^a{3}^b$ countable models, where a and b are natural numbers.     

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.