Representations of monadic <Emphasis Type="Italic">MV</Emphasis> -algebras

Representations of monadic MV -algebra, the characterization of locally finite monadic MV -algebras, with axiomatization of them, definability of non-trivial monadic operators on finitely generated free MV -algebras are given. Moreover, it is shown that finitely generated m-relatively complete subalgebra of finitely generated free MV -algebra is projective.     

Communication and Strong Compositionality

Ordinary semantic compositionality (meaning of whole determined from meanings of parts plus composition) can serve to explain how a hearer manages to assign an appropriate meaning to a new sentence. But it does not serve to explain how the speaker manages to find an appropriate sentence for expressing a new thought. For this we would need a principle of inverse compositionality, by which the expression of a complex content is determined by the expressions of it parts and the mode of composition. But this presupposes that contents have constituent structure, and this cannot be taken for granted. However, it can be proved that if a certain principle of substitutivity is valid for a particular language, then the meanings expressed by its sentences can justifiably be treated as structured. In its simplest form, this principle says that if in a complex expression a constituent is replaced by another constituent with a different meaning, the new complexhas a meaning different from the original. This principle is again inversely related to the normal compositional principle of substitutivity. The combination of ordinary and inverse compositionality is here called strong compositionality. The proof is carried out in the algebraic framework developed by Wilfrid Hodges and Dag Westerståhl.     

Thurstonian modeling of ranking data via mean and covariance structure analysis

Although Thurstonian models provide an attractive representation of choice behavior, they have not been extensively used in ranking applications since only recently efficient estimation methods for these models have been developed. These, however, require the use of special-purpose estimation programs, which limits their applicability. Here we introduce a formulation of Thurstonian ranking models that turns an idiosyncratic estimation problem into an estimation problem involving mean and covariance structures with dichotomous indicators. Well-known standard solutions for the latter can be readily applied to this specific problem, and as a result any Thurstonian model for ranking data can be fitted using existing general purpose software for mean and covariance structure analysis. Although the most popular programs for covariance structure analysis (e.g., LISREL and EQS) cannot be presently used to estimate Thurstonian ranking models, other programs such as MECOSA already exist that can be straightforwardly used to estimate these models.This paper is based on the author's doctoral dissertation. Ulf Böckenholt was my advisor. The author is indebted to Ulf Böckenholt for his comments on a previous version of this paper and to Gerhard Arminger for his extensive support on the use of MECOSA. The final stages of this research took place while the author was at the Department of Statistics and Econometrics, Universidad Carlos III de Madrid. Conversations with my colleague there, Adolfo Hernández, helped to greatly improve this paper.     

The Finite Model Property for the Implicational Fragment of IPC Without Exchange and Contraction

The aim of this paper is to show that the implicational fragment BKof the intuitionistic propositional calculus (IPC) without the rules of exchange and contraction has the finite model property with respect to the quasivariety of left residuation algebras (its equivalent algebraic semantics). It follows that the variety generated by all left residuation algebras is generated by the finite left residuation algebras. We also establish that BKhas the finite model property with respect to a class of structures that constitute a Kripke-style relational semantics for it. The results settle a question of Ono and Komori [OK85]. This revised version was published online in June 2006 with corrections to the Cover Date.     

Semi-DeMorgan algebras

Semi-DeMorgan algebras are a common generalization of DeMorgan algebras and pseudocomplemented distributive lattices. A duality for them is developed that builds on the Priestley duality for distributive lattices. This duality is then used in several applications. The subdirectly irreducible semi-DeMorgan algebras are characterized. A theory of partial diagrams is developed, where properties of algebras are tied to the omission of certain partial diagrams from their duals. This theory is then used to find and give axioms for the largest variety of semi-DeMorgan algebras with the congruence extension property.Semi-deMorgan algebras include demi-p-lattices, the topic of H. Gaitan's contribution to this special edition. D. Hobby's results were obtained independently.     

Classifying ℵo-Categorical Theories II: The Existence of Finitely Axiomatizable Proper Class II Theories

Clark and Krauss [1977] presents a classification of complete, satisfiable and _o-categorical theories in first order languages with finite non-logical vocabularies. In 1988 the first author modified this classification and raised three questions about the distribution of finitely axiomatizable theories. This paper answers two of those questions.     

Homogeneous and Universal Dedekind Algebras

A Dedekind algebra is an order pair (B, h) where B is a non-empty set and h is a similarity transformation on B. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ₀ isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type which occur in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. It is shown that configuration signatures can be used to characterize the homogeneous, universal and homogeneous-universal Dedekind algebras. This characterization is used to prove various results about these subclasses of Dedekind algebras.     

Type Logics and Pregroups

We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid. Special Issue Categorial Grammars and Pregroups Edited by Wojciech Buszkowski and Anne Preller