An Infinitary Extension of Jankov’s Theorem

It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra B, A is embeddable into a quotient algebra of B, if and only if Jankov’s formula χ _A for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal number κ, we present Jankov’s theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible complete κ-Heyting algebras and κ-infinitary logic, where a κ-Heyting algebra is a Heyting algebra A with # ≥  κ and κ-infinitary logic is the infinitary logic such that for any set Θ of formulas with # Θ ≥  κ, ∨Θ and ∧Θ are well defined formulas.     

Inquisitive Heyting Algebras

In this paper we introduce a class of inquisitive Heyting algebras as algebraic structures that are isomorphic to algebras of finite antichains of bounded implicative meet semilattices. It is argued that these structures are suitable for algebraic semantics of inquisitive superintuitionistic logics, i.e. logics of questions based on intuitionistic logic and its extensions. We explain how questions are represented in these structures (prime elements represent declarative propositions, non-prime elements represent questions, join is a question-forming operation) and provide several alternative characterizations of these algebras. For instance, it is shown that a Heyting algebra is inquisitive if and only if its prime filters and filters generated by sets of prime elements coincide and prime elements are closed under relative pseudocomplement. We prove that the weakest inquisitive superintuitionistic logic is sound with respect to a Heyting algebra iff the algebra is what we call a homomorphic p-image of some inquisitive Heyting algebra. It is also shown that a logic is inquisitive iff its Lindenbaum–Tarski algebra is an inquisitive Heyting algebra.

     

Priestley duality for some subalgebra lattices

Priestley duality can be used to study subalgebras of Heyting algebras and related structures. The dual concept is that of congruence on the dual space and the congruence lattice of a Heyting space is dually isomorphic to the subalgebra lattice of the dual algebra. In this paper we continue our investigation of the congruence lattice of a Heyting space that was undertaken in [10], [8] and [12]. Our main result is a characterization of the modularity of this lattice (Theorem 2.12). Partial results about its complementedness are also given, and among other things a characterization of those finite Heyting algebras with a complemented subalgebra lattice (Theorem 3.5).     

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.     

A Coalgebraic View of Heyting Duality

We give a coalgebraic view of the restricted Priestley duality between Heyting algebras and Heyting spaces. More precisely, we show that the category of Heyting spaces is isomorphic to a full subcategory of the category of all -coalgebras, based on Boolean spaces, where is the functor which maps a Boolean space to its hyperspace of nonempty closed subsets. As an appendix, we include a proof of the characterization of Heyting spaces and the morphisms between them.     

Fatal Heyting Algebras and Forcing Persistent Sentences

Hamkins and L?we proved that the modal logic of forcing is S4.2. In this paper, we consider its modal companion, the intermediate logic KC and relate it to the fatal Heyting algebra H _ZFC of forcing persistent sentences. This Heyting algebra is equationally generic for the class of fatal Heyting algebras. Motivated by these results, we further analyse the class of fatal Heyting algebras.     

Nelson algebras through Heyting ones: I

The main aim of the present paper is to explain a nature of relationships exist between Nelson and Heyting algebras. In the realization, a topological duality theory of Heyting and Nelson algebras based on the topological duality theory of Priestley ([15], [16]) for bounded distributive lattices are applied. The general method of construction of spaces dual to Nelson algebras from a given dual space to Heyting algebra is described (Thm 2.3). The algebraic counterpart of this construction being a generalization of the Fidel-Vakarelov construction ([6], [25]) is also given (Thm 3.6). These results are applied to compare the equational category N of Nelson algebras and some its subcategories (and their duals) with the equational category H of Heyting algebras (and its dual). It is proved (Thm 4.1) that the category N is topological over the category H. The main results of this article are a part of theses of the author's doctoral dissertation at the Nicholas Copernicus University in 1984 (cpmp. [24]).Research partially supported by Polish Government Grant CPBP 08-15.     

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.     

Birkhoff-like sheaf representation for varieties of lattice expansions

Given a variety we study the existence of a class such that S1 every A can be represented as a global subdirect product with factors in and S2 every non-trivial A is globally indecomposable. We show that the following varieties (and its subvarieties) have a class satisfying properties S1 and S2: p-algebras, distributive double p-algebras of a finite range, semisimple varieties of lattice expansions such that the simple members form a universal class (bounded distributive lattices, De Morgan algebras, etc) and arithmetical varieties in which the finitely subdirectly irreducible algebras form a universal class (f-rings, vector groups, Wajsberg algebras, discriminator varieties, Heyting algebras, etc). As an application we obtain results analogous to that of Nachbin saying that if every chain of prime filters of a bounded distributive lattice has at most length 1, then the lattice is Boolean.We wish to thank Lic. Alfredo Guerin and Dr. Daniel Penazzi for helping us with linguistics aspects. We are indebted to the referee for several helpful suggestions. We also wish to thank Professor Mick Adams for providing us with several reprints and useful e-mail information on the subject.Suported by CONICOR and SECyT (UNC).     

Products of Classes of Residuated Structures

The central result of this paper provides a simple equational basis for the join, IRLLG, of the variety LG of lattice-ordered groups (-groups) and the variety IRL of integral residuated lattices. It follows from known facts in universal algebra that IRLLG=IRL×LG. In the process of deriving our result, we will obtain simple axiomatic bases for other products of classes of residuated structures, including the class IRL×_s LG, consisting of all semi-direct products of members of IRL by members of LG. We conclude the paper by presenting a general method for constructing such semi-direct products, including wreath products.     

On Some Compatible Operations on Heyting Algebras

We study some operations that may be defined using the minimum operator in the context of a Heyting algebra. Our motivation comes from the fact that 1) already known compatible operations, such as the successor by Kuznetsov, the minimum dense by Smetanich and the operation G by Gabbay may be defined in this way, though almost never explicitly noted in the literature; 2) defining operations in this way is equivalent, from a logical point of view, to two clauses, one corresponding to an introduction rule and the other to an elimination rule, thus providing a manageable way to deal with these operations. Our main result is negative: all operations that arise turn out to be Heyting terms or the mentioned already known operations or operations interdefinable with them. However, it should be noted that some of the operations that arise may exist even if the known operations do not. We also study the extension of Priestley duality to Heyting algebras enriched with the new operations.     

Dominions in quasivarieties of universal algebras

The dominion of a subalgebra H in an universal algebra A (in a class ) is the set of all elements such that for all homomorphisms if f, g coincide on H, then a^f = a^g. We investigate the connection between dominions and quasivarieties. We show that if a class is closed under ultraproducts, then the dominion in is equal to the dominion in a quasivariety generated by . Also we find conditions when dominions in a universal algebra form a lattice and study this lattice.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

An Approach to Glivenko’s Theorem in Algebraizable Logics

In a classical paper [15] V. Glivenko showed that a proposition is classically demonstrable if and only if its double negation is intuitionistically demonstrable. This result has an algebraic formulation: the double negation is a homomorphism from each Heyting algebra onto the Boolean algebra of its regular elements. Versions of both the logical and algebraic formulations of Glivenko’s theorem, adapted to other systems of logics and to algebras not necessarily related to logic can be found in the literature (see [2, 9, 8, 14] and [13, 7, 14]). The aim of this paper is to offer a general frame for studying both logical and algebraic generalizations of Glivenko’s theorem. We give abstract formulations for quasivarieties of algebras and for equivalential and algebraizable deductive systems and both formulations are compared when the quasivariety and the deductive system are related. We also analyse Glivenko’s theorem for compatible expansions of both cases. Presented by Jacek Malinowski     

MV-Algebras and Quantum Computation

We introduce a generalization of MV algebras motivated by the investigations into the structure of quantum logical gates. After laying down the foundations of the structure theory for such quasi-MV algebras, we show that every quasi-MV algebra is embeddable into the direct product of an MV algebra and a “flat” quasi-MV algebra, and prove a completeness result w.r.t. a standard quasi-MV algebra over the complex numbers. Presented by Heinrich Wansing     

Not Every Splitting Heyting or Interior Algebra is Finitely Presentable

We give an example of a variety of Heyting algebras and of a splitting algebra in this variety that is not finitely presentable. Moreover, we show that the corresponding splitting pair cannot be defined by any finitely presentable algebra. Also, using the G?del-McKinsey-Tarski translation and the Blok-Esakia theorem, we construct a variety of Grzegorczyk algebras with similar properties.     

Disjunctive Quantum Logic in Dynamic Perspective

In Coecke (2002) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application towards dynamic quantum logic, namely in describing the temporal indeterministic propagation of actual properties of physical systems. This paper can as such by conceived as an addendum to Quantum Logic in Intuitionistic Perspective that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement.     

Optimal natural dualities for varieties of Heyting algebras

The techniques of natural duality theory are applied to certain finitely generated varieties of Heyting algebras to obtain optimal dualities for these varieties, and thereby to address algebraic questions about them. In particular, a complete characterisation is given of the endodualisable finite subdirectly irreducible Heyting algebras. The procedures involved rely heavily on Priestley duality for Heyting algebras.     

数学学业不良初中生的工作记忆特点：领域普遍性还是特殊性?

研究选取上海111名(男生48名, 女生63名, 平均年龄11.97岁)初中学生(数学学业不良学生55名与数学学业优秀学生56名), 根据国家数学课程标准, 将数学划分为数与代数、空间与几何两部分, 又从空间与几何领域中选取初一数学学业知识点—— 轴对称和中心对称图形, 分析在不同内容知识领域的解答过程中所涉及的工作记忆成分。结果发现：(1)数与代数学习需要中央执行系统、视觉-空间模板、语音环路三个成分的共同作用; 空间与几何学习主要受到视觉-空间模板和中央执行系统的影响, 但不存在语音环路的影响。(2)对轴对称与中心对称图形任务的成绩影响最大的是视觉-空间模板, 其次是中央执行系统, 语音环路对该任务作用不明显。两个研究说明工作记忆在初中不同年级的各类数学学业任务中具有不同的作用, 中央执行系统和视觉-空间模板相对更具有普遍性作用, 语音环路具有特殊性作用, 并且随着年龄增高, 视觉－空间模板对数学学业任务的作用更为突显。     

Heyting Mereology as a Framework for Spatial Reasoning

In this paper it is shown that Heyting and Co-Heyting mereological systems provide a convenient conceptual framework for spatial reasoning, in which spatial concepts such as connectedness, interior parts, (exterior) contact, and boundary can be defined in a natural and intuitively appealing way. This fact refutes the wide-spread contention that mereology cannot deal with the more advanced aspects of spatial reasoning and therefore has to be enhanced by further non-mereological concepts to overcome its congenital limitations. The allegedly unmereological concept of boundary is treated in detail and shown to be essentially affected by mereological considerations. More precisely, the concept of boundary turns out to be realizable in a variety of different mereologically grounded versions. In particular, every part K of a Heyting algebra H gives rise to a well-behaved K-relative boundary operator.