A Way to Interpret Łukasiewicz Logic and Basic Logic

Fuzzy logics are in most cases based on an ad-hoc decision about the interpretation of the conjunction. If they are useful or not can typically be found out only by testing them with example data. Why we should use a specific fuzzy logic can in general not be made plausible. Since the difficulties arise from the use of additional, unmotivated structure with which the set of truth values is endowed, the only way to base fuzzy logics on firm ground is the development of alternative semantics to all of whose components we can associate a meaning. In this paper, we present one possible approach to justify ex post Łukasiewicz Logic as well as Basic Logic. The notion of ambiguity is central. Our framework consists of a Boolean or a Heyting algebra, respectively, endowed with an equivalence relation expressing ambiguity. The quotient set bears naturally the structure of an MV- or a BL-algebra, respectively, and thus can be used to interpret propositions of the mentioned logics.     

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     

Non-monotonic Probability Theory and Photon Polarization

A non-monotonic theory of probability is put forward and shown to have applicability in the quantum domain. It is obtained simply by replacing Kolmogorov’s positivity axiom, which places the lower bound for probabilities at zero, with an axiom that reduces that lower bound to minus one. Kolmogorov’s theory of probability is monotonic, meaning that the probability of A is less then or equal to that of B whenever A entails B. The new theory violates monotonicity, as its name suggests; yet, many standard theorems are also theorems of the new theory since Kolmogorov’s other axioms are retained. What is of particular interest is that the new theory can accommodate quantum phenomena (photon polarization experiments) while preserving Boolean operations, unlike Kolmogorov’s theory. Although non-standard notions of probability have been discussed extensively in the physics literature, they have received very little attention in the philosophical literature. One likely explanation for that difference is that their applicability is typically demonstrated in esoteric settings that involve technical complications. That barrier is effectively removed for non-monotonic probability theory by providing it with a homely setting in the quantum domain. Although the initial steps taken in this paper are quite substantial, there is much else to be done, such as demonstrating the applicability of non-monotonic probability theory to other quantum systems and elaborating the interpretive framework that is provisionally put forward here. Such matters will be developed in other works.     

On Varieties of Biresiduation Algebras

A biresiduation algebra is a 〈/,\,1〉-subreduct of an integral residuated lattice. These algebras arise as algebraic models of the implicational fragment of the Full Lambek Calculus with weakening. We axiomatize the quasi-variety B of biresiduation algebras using a construction for integral residuated lattices. We define a filter of a biresiduation algebra and show that the lattice of filters is isomorphic to the lattice of B-congruences and that these lattices are distributive. We give a finite basis of terms for generating filters and use this to characterize the subvarieties of B with EDPC and also the discriminator varieties. A variety generated by a finite biresiduation algebra is shown to be a subvariety of B. The lattice of subvarieties of B is investigated; we show that there are precisely three finitely generated covers of the atom. Mathematics Subject Classification (2000): 03G25, 06F35, 06B10, 06B20 Dedicated to the memory of Willem Johannes Blok     

Interpolation and Amalgamation; Pushing the Limits. Part II

This is the second part of the paper [Part I] which appeared in the previous issue of this journal.     

代数应用题视觉化表征的理论模型及影响因素

视觉化表征是代数应用题表征的一大类型, 在问题解决过程中起着重要作用。视觉化表征的理论主要有视觉-逻辑二维模型、理解-转换模型、表象表征理论和图式-图像表征论, 四种理论模型各有其特殊的方法学意义。代数应用题的视觉化表征主要受到题目视觉化程度和认知负载等刺激因素以及自我效能感等认知因素的影响, 最后, 本文指出了在代数应用题视觉化表征理论、研究方法和影响因素探索中的进步以及发展空间。     

Priestley Duality for Quasi-Stone Algebras

In this paper we describe the Priestley space of a quasi-Stone algebra and use it to show that the class of finite quasi-Stone algebras has the amalgamation property. We also describe the Priestley space of the free quasi-Stone algebra over a finite set. This revised version was published online in June 2006 with corrections to the Cover Date.