Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. (...) We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

In the propositional modal treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general is similarly harmless. We (...) show that this is far from being the case, and there can be quite a big jump in complexity, even from decidable to the highly undecidable. Our undecidable logics can also be viewed as new fragments of first-order logic where adding equality changes a decidable fragment to undecidable. We prove our results by a novel application of counter machine problems. While our formalism apparently cannot force reliable counter machine computations directly, the presence of a unique diagonal in the models makes it possible to encode both lossy and insertion-error computations, for the same sequence of instructions. We show that, given such a pair of faulty computations, it is then possible to reconstruct a reliable run from them. (shrink)

It is known that every α-dimensional quasi polyadic equality algebra (QPEA α ) can be considered as an α-dimensional cylindric algebra satisfying the merrygo- round properties . The converse of this proposition fails to be true. It is investigated in the paper how to get algebras in QPEA from algebras in CA. Instead of QPEA the class of the finitary polyadic equality algebras (FPEA) is investigated, this class is definitionally equivalent to QPEA. It is shown, among others, that from every (...) algebra in a β-dimensional algebra can be obtained in QPEA β where , moreover the algebra obtained is representable in a sense. (shrink)

David Lewis holds that a single possible world can provide more than one way things could be. But what are possible worlds good for if they come apart from ways things could be? We can make sense of this if we go in for a metaphysical understanding of what the world is. The world does not include everything that is the case—only the genuine facts. Understood this way, Lewis's “cheap haecceitism” amounts to a kind of metaphysical anti-haecceitism: it says there (...) aren't any genuine facts about individuals over and above their qualitative roles. (shrink)

By quoting extensively from unpublished letters written by John von Neumann to Garret Birkhoff during the preparatory phase (in 1935) of their ground-breaking 1936 paper that established quantum logic, the main steps in the thought process leading to the 1936 Birkhoff–von Neumann paper are reconstructed. The reconstruction makes it clear why Birkhoff and von Neumann rejected the notion of quantum logic as the projection lattice of an infinite dimensional complex Hilbert space and why they postulated in their 1936 paper that (...) the quantum propositional system should be isomorphic to an abstract projective geometry. Looking at the paper now I see, that I forgot to say this, which should be said somewhere in the first §: That while common logics did apply to quantum mechanics, if the notion of simultaneous measurability is introduced as an auxiliary notion, we wished to construct a logical system, which applies directly to quantum mechanics – without any extraneous secondary notions like simultaneous measurability. And in order to have such a consequent, one-piece system of logics, we must change the classical class calculus of logics. (J. von Neumann to G. Birkhoff, November 21, 1935). (shrink)

We give a set of postulates for the minimal normal modal logicK + without negation or any kind of implication. The connectives are simply , , , . The postulates (and theorems) are all deducibility statements . The only postulates that might not be obvious are.

The standard Pawlak approach to rough set theory, as an approximation space consisting of a universe U and an equivalence (indiscernibility) relation R U x U, can be equivalently described by the induced preclusivity ("discernibility") relation U x U \ R, which is irreflexive and symmetric.We generalize the notion of approximation space as a pair consisting of a universe U and a discernibility or preclusivity (irreflexive and symmetric) relation, not necessarily induced from an equivalence relation. In this case the "elementary" (...) sets are not mutually disjoint, but all the theory of generalized rough sets can be developed in analogy with the standard Pawlak approach. On the power set of the universe, the algebraic structure of the quasi fuzzy-intuitionistic "classical" (BZ) lattice is introduced and the sets of all "closed" and of all "open" definable sets with the associated complete (in general nondistributive) ortholattice structures are singled out. (shrink)

We present an algebraic-style of semantics, which we call a content semantics, for quantified relevant logics based on the weak system BBQ. We show soundness and completeness for all quantificational logics extending BBQ and also treat reduced modelling for all systems containing BB d Q. The key idea of content semantics is that true entailments AB are represented under interpretation I as content containments, i.e. I(A)I(B) (or, the content of A contains that of B). This is opposed to the truth-functional (...) way which represents true entailments as truth-preservations over all set-ups (or worlds), i.e. (VaK) (if I(A, a) = T then I(B, a)= T). (shrink)

Online collection of papers by Devitt, Dretske, Guarino, Hochberg, Jackson, Petitot, Searle, Tye, Varzi and other leading thinkers on philosophy and the foundations of cognitive Science. Topics dealt with include: Wittgenstein and Cognitive Science, Content and Object, Logic and Foundations, Language and Linguistics, and Ontology and Mereology.

It is commonly believed that the role of context cannot be ignored in the analysis of conditionals, and counterfactuals in particular. On truth conditional accounts involving possible worlds semantics, conditionals have been analysed as expressions of relative necessity: “If A, then B” is true at some world w if B is true at all the A-worlds deemed relevant to the evaluation of the conditional at w. A drawback of this approach is that for the evaluation of conditionals with the same (...) antecedents at some world, the same worlds are deemed as relevant for all occasions of utterance. But surely this is inadequate, if shifts of contexts between occasions are to be accounted for. Both the linguistic and logical implications of this defect are discussed, and in order to overcome it a modification of David Lewis’ ordering semantics for counterfactuals is developed for a modified language. I follow Lewis by letting contexts determine comparative similarity assignments, and show that the addition of syntactic context parameters (context indices) to the language gives the freedom required to switch between sets of relevant antecedent worlds from occasion to occasion by choosing the corresponding similarity assignment accordingly. Thus an account that extends Lewis’ analysis of a language containing a single counterfactual connective > to a language containing infinitely many counterfactual connectives >_c, each indexed by a different context name c, overcomes the limitations of traditional analyses. Finally it is also shown that these traditional accounts can be recovered from the modified account if certain contextual restrictions are in place. -/- . (shrink)

This essay is about how the notion of “structure” in ontic structuralism might be made precise. More specifically, my aim is to make precise the idea that the structure of the world is given by the relations inhering in the world, in such a way that the relations are ontologically prior to their relata. The central claim is the following: one can do so by giving due attention to the relationships that hold between those relations, by making use of certain (...) notions from algebraic logic. (shrink)

Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEAα of representable quasi-polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi-polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEAn for equation image and equation imageequation image, k′ < ω are natural numbers, then Σ contains infinitely equations in which − occurs, one of (...) + or · occurs, a diagonal or a permutation with index l occurs, more than k cylindrifications and more than k′ variables occur. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

We prove several interpolation theorems for many-valued infinitary logic with quantifiers by studying expansions of MV-algebras in the spirit of polyadic and cylindric algebras. We prove for various reducts of polyadic MV-algebras of infinite dimensions that if is the free algebra in the given signature,, is in the subalgebra of generated by, is in the subalgebra of generated by and, then there exists an interpolant in the subalgebra generated by and such that. We call this a varying interpolation property because (...) the integer depends on the inequality. We also address cases where this interpolation property fails, but other weaker ones hold. One such interpolation theorem says that though an interpolant may not be found as above, an interpolant can always be found if finitely many universal quantifiers are applied to making it smaller and the same number of existential quantifiers are applied to making it bigger. This number of quantifiers also varies; it depends on the inequality. Se.. (shrink)

Looking at the operation of forming neat $\alpha $ -reducts as a functor, with $\alpha $ an infinite ordinal, we investigate when such a functor obtained by truncating $\omega $ dimensions, has a right adjoint. We show that the neat reduct functor for representable cylindric algebras does not have a right adjoint, while that of polyadic algebras is an equivalence. We relate this categorial result to several amalgamation properties for classes of representable algebras. We show that the variety of cylindric (...) algebras of infinite dimension, endowed with the merry go round identities, fails to have the amalgamation property answering a question of Németi’s. We also study two variants of the so-called cylindric polyadic algebras introduced by Ferenczi (all are reducts of polyadic equality algebras, that are also varieties). We show that one is more cylindric than polyadic, and that the other is more polyadic than cylindric. Our classification is determined by results on neat embeddings and amalgamation expressed from the point of view of category theory, thereby witnessing, and, indeed, further emphasizing, the dichotomy between the cylindric and polyadic paradigms. For example, the first class does not have the unique neat embedding property, fails to have the amalgamation property and the neat reduct functor does not have a right adjoint, while the second class has the unique neat emdedding property, the superamalgamation property and the neat reduct functor is strongly invertible. Other results, like first order definability of the class of neat reducts and the class of completely representable algebras, confirming our classification along these lines are presented. (shrink)

Theabstract variable binding calculus (VB-calculus) provides a formal frame-work encompassing such diverse variable-binding phenomena as lambda abstraction, Riemann integration, existential and universal quantification (in both classical and nonclassical logic), and various notions of generalized quantification that have been studied in abstract model theory. All axioms of the VB-calculus are in the form of equations, but like the lambda calculus it is not a true equational theory since substitution of terms for variables is restricted. A similar problem with the standard formalism (...) of the first-order predicate logic led to the development of the theory of cylindric and polyadic Boolean algebras. We take the same course here and introduce the variety of polyadic VB-algebras as a pure equational form of the VB-calculus. In one of the main results of the paper we show that every locally finite polyadic VB-algebra of infinite dimension is isomorphic to a functional polyadic VB-algebra that is obtained from a model of the VB-calculus by a natural coordinatization process. This theorem is a generalization of the functional representation theorem for polyadic Boolean algebras given by P. Halmos. As an application of this theorem we present a strong completeness theorem for the VB-calculus. More precisely, we prove that, for every VB-theory T that is obtained by adjoining new equations to the axioms of the VB-calculus, there exists a model D such that T s=t iff D s=t. This result specializes to a completeness theorem for a number of familiar systems that can be formalized as VB-calculi. For example, the lambda calculus, the classical first-order predicate calculus, the theory of the generalized quantifierexists uncountably many and a fragment of Riemann integration. (shrink)

This paper is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantifier logics. The paper has a survey character, too. The most frequently used algebras like cylindric-, relation-, polyadic-, and quasi-polyadic algebras are carefully introduced and intuitively explained for the nonspecialist. Their variants, connections with logic, abstract model theory, and further algebraic logics are also reviewed. Efforts were made to make the review part relatively comprehensive. In some (...) directions we tried to give an overview of the most recent results and research trends, too. (shrink)

In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In this paper, we show that if we replace in Codd’s relational algebra the product operator by the “semijoin” operator, then the resulting “semijoin algebra” is equivalent to the guarded fragment of first-order logic. We also define a fixed point extension of the semijoin algebra that corresponds to μGF.

The purpose of this paper is to lay out the algebraic approach to propositions and then to show how it can be implemented in new solutions to Frege's puzzle and a variety of related puzzles about content.

In this article we deal with Glivenko type theorems for intuitionistic modal logics over Prior's MIPC. We examine the problems which appear in proving Glivenko type theorems when passing from the intuitionistic propositional logic Intto MIPC. As a result we obtain two different versions of Glivenko's theorem for logics over MIPC. Since MIPCcan be thought of as a one-variable fragment of the intuitionistic predicate logic Q-Int, one of the versions of Glivenko's theorem for logics over MIPCis closely related to that (...) for intermediate predicate logics obtained by Umezawa [27] and Gabbay [15]. Another one is rather surprising. (shrink)

In this paper we investigate the class of MV-algebras equipped with two quantifiers which commute as a natural generalization of diagonal-free two-dimensional cylindric algebras. In the 40s, Tarski first introduced cylindric algebras in order to provide an algebraic apparatus for the study of classical predicate calculus. The diagonal–free two-dimensional cylindric algebras are special cylindric algebras. The treatment here of MV-algebras is done in terms of implication and negation. This allows us to simplify some results due to Di Nola and Grigolia (...) :125–139, 2004) related to the characterization of a quantifier in terms of some special sub-algebra associated to it. On the other hand, we present a topological duality for this class of algebras and we apply it to characterize the congruences of one algebra via certain closed sets. Finally, we study the subvariety of this class generated by a chain of length n + 1. We prove that the subvariety is semisimple and we characterize their simple algebras. Using a special functional algebra, we determine all the simple finite algebras of this subvariety. (shrink)

This paper is a contribution toward developing a theory of expansions of semi-Heyting algebras. It grew out of an attempt to settle a conjecture we had made in 1987. Firstly, we unify and extend strikingly similar results of [ 48 ] and [ 50 ] to the (new) equational class DHMSH of dually hemimorphic semi-Heyting algebras, or to its subvariety BDQDSH of blended dual quasi-De Morgan semi-Heyting algebras, thus settling the conjecture. Secondly, we give a criterion for a unary expansion (...) of semi-Heyting algebras to be a discriminator variety and give an algorithm to produce discriminator varieties. We then apply the criterion to exhibit an increasing sequence of discriminator subvarieties of BDQDSH . We also use it to prove that the variety DQSSH of dually quasi-Stone semi- Heyting algebras is a discriminator variety. Thirdly, we investigate a binary expansion of semi-Heyting algebras, namely the variety DblSH of double semi-Heyting algebras by characterizing its simples, and use the characterization to present an increasing sequence of discriminator subvarieties of DblSH . Finally, we apply these results to give bases for “small” subvarieties of BDQDSH , DQSSH , and DblSH. (shrink)

Dynamic algebras combine the classes of Boolean (B 0) and regular (R ; *) algebras into a single finitely axiomatized variety (B R ) resembling an R-module with scalar multiplication . The basic result is that * is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result (...) is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of prepositional dynamic logic, and yet another notion of regular algebra. (shrink)

Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the Jónsson and Tarski (...) representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality. (shrink)

This paper deals with the varieties of monadic Heyting algebras, algebraic models of intuitionistic modal logic MIPC. We investigate semisimple, locally finite, finitely approximated and splitting varieties of monadic Heyting algebras as well as varieties with the disjunction and the existence properties. The investigation of monadic Heyting algebras clarifies the correspondence between intuitionistic modal logics over MIPC and superintuitionistic predicate logics and provides us with the solutions of several problems raised by Ono [35].

In this paper we continue the investigation of monadic Heyting algebras which we started in [2]. Here we present the representation theorem for monadic Heyting algebras and develop the duality theory for them. As a result we obtain an adequate topological semantics for intuitionistic modal logics over MIPC along with a Kripke-type semantics for them. It is also shown the importance and the effectiveness of the duality theory for further investigation of monadic Heyting algebras and logics over MIPC.

This paper is a contribution to the algebraic logic of probabilistic models of Łukasiewicz predicate logic. We study the MV-states defined on polyadic MV-algebras and prove an algebraic many-valued version of Gaifman’s completeness theorem.

Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi ...

\ of monadic m-generalized Łukasiewicz algebras of order n -algebras), namely a generalization of monadic n-valued Łukasiewicz algebras. In this article, we determine the congruences and we characterized the subdirectly irreducible \-algebras. From this last result we proved that \ is a discriminator variety and as a consequence we characterized the principal congruences. In the last part of this paper we find an immersion of these algebras in a functional algebra and we proved that in the finite case they are (...) isomorphic. This last result allows to show a new functional representation for monadic n-valued Łukasiewicz algebras. Finally, we define the notions of \-algebra of fractions and maximal algebra of fractions and we prove the existence of a maximal \-algebra of fractions for an \-algebra. (shrink)

Monomodal logic has exactly two maximally normal logics, which are also the only quasi-normal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maximally normal logics that are not valid in any Kripke frame, or even in any complete modal algebra. We also construct continuum many quasi-normal Post complete logics that are not normal. The set of extensions (...) of S4.3 is radically altered by the addition of a constant: we use it to construct continuum many such normal extensions of S4.3, and continuum many non-normal ones, none of which have the finite model property. But for logics with weakly transitive frames there are only eight maximally normal ones, of which five extend K4 and three extend S4. (shrink)

In this paper we expand previous results obtained in [2] about the study of categorical equivalence between the category IRL 0 of integral residuated lattices with bottom, which generalize MV-algebras and a category whose objects are called c-differential residuated lattices. The equivalence is given by a functor ${{\mathsf{K}^\bullet}}$ , motivated by an old construction due to J. Kalman, which was studied by Cignoli in [3] in the context of Heyting and Nelson algebras. These results are then specialized to the case (...) of MV-algebras and the corresponding category ${MV^{\bullet}}$ of monadic MV-algebras induced by “Kalman’s functor” ${\mathsf{K}^\bullet}$ . Moreover, we extend the construction to ℓ-groups introducing the new category of monadic ℓ-groups together with a functor ${\Gamma ^\sharp}$ , that is “parallel” to the well known functor ${\Gamma}$ between ℓ and MV-algebras. (shrink)

It is shown that a locally finite polyadic algebra on an infinite set V of variables is a Boolean-algebra object, endowed with some internal supremum morphism, in the category of locally finite transformation sets on V. Then, this new categorical definition of polyadic algebras is used to simplify the theory of these algebras. Two examples are given: the construction of dilatations and the definition of terms and constants.

The notion of monadic three-valued ukasiewicz algebras was introduced by L. Monteiro ([12], [14]) as a generalization of monadic Boolean algebras. A. Monteiro ([9], [10]) and later L. Monteiro and L. Gonzalez Coppola [17] obtained a method for the construction of a three-valued ukasiewicz algebra from a monadic Boolea algebra. In this note we give the construction of a monadic three-valued ukasiewicz algebra from a Boolean algebra B where we have defined two quantification operations and * such that *x=*x (where (...) *x=-*-x). In this case we shall say that and * commutes. If B is finite and is an existential quantifier over B, we shall show how to obtain all the existential quantifiers * which commute with .Taking into account R. Mayet [3] we also construct a monadic three-valued ukasiewicz algebra from a monadic Boolean algebra B and a monadic ideal I of B. (shrink)

This paper reviews the impact of Rasiowa's well-known book on the evolution of algebraic logic during the last thirty or forty years. It starts with some comments on the importance and influence of this book, highlighting some of the reasons for this influence, and some of its key points, mathematically speaking, concerning the general theory of algebraic logic, a theory nowadays called Abstract Algebraic Logic. Then, a consideration of the diverse ways in which these key points can be generalized allows (...) us to survey some issues in the development of the field in the last twenty to thirty years. The last part of the paper reviews some recent lines of research that in some way transcend Rasiowa's approach. I hope in this way to give the reader a general view of Rasiowa's key position in the evolution of Algebraic Logic during the twentieth century. (shrink)

A discussion of the connections and differences between completeness and representation theorems in logic, with examples drawn from classical and modal logic, the logic of friendliness, and nonmonotonic reasoning.

Monomodal logic has exactly two maximally normal logics, which are also the only quasi-normal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maximally normal logics that are not valid in any Kripke frame, or even in any complete modal algebra. We also construct continuum many quasi-normal Post complete logics that are not normal. The set of extensions (...) of S4.3 is radically altered by the addition of a constant: we use it to construct continuum many such normal extensions of S4.3, and continuum many non-normal ones, none of which have the finite model property. But for logics with weakly transitive frames there are only eight maximally normal ones, of which five extend K4 and three extend S4. (shrink)

The present note is a reworking and streamlining of Daigneault and Monk's Representation Theory for Polyadic Algebras. MSC: 03G15.

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. GMV-algebras are a non-commutative generalization of MV-algebras and are an algebraic counterpart of the non-commutative Łukasiewicz infinite valued logic. We introduce monadic GMV-algebras and describe their connections to certain couples of GMV-algebras and to left adjoint mappings of canonical embeddings of GMV-algebras. Furthermore, functional MGMV-algebras are studied and polyadic GMV-algebras are introduced and discussed.

This paper considers the prospects for objectivity in reasoning strategies in response to empirical studies that apparently show systematic culture‐based differences in patterns of reasoning. I argue that there is at least one modest class of exceptions to the claim that there are alternative, equally warranted standards of good reasoning: the class that entails the solution of certain well‐structured problems which, suitably chosen, are common, or touchstone, to the sorts of culturally different viewpoints discussed. There is evidence that some cognitive (...) tasks are seen in much the same way across cultures, not least by virtue of the common run of experiences with the world of material objects in early childhood by creatures with similar cognitive endowments. These tasks thus present as similarly structured sets of claims that have similar priority: what is framed, and what is bracketed, or held constant in the background, is shown to be naturally common across cultures. As a consequence, a normative view of reasoning and, by implication, critical thinking can be defended. While this might be a modest sense of objectivity, the high level of intercultural articulation that is able to occur among people of different backgrounds suggests that it provides cognitive scaffolding for a lot of other reasoning tasks as well. (shrink)

The aim of the article is to outline the historical background and the present state of the methodology of deductive systems invented by Alfred Tarski in the thirties. Key notions of Tarski's methodology are presented and discussed through, the recent development of the original concepts and ideas.

The dual spaces of the free distributive lattices with a quantifier are constructed, generalizing Halmos' construction of the dual spaces of free monadic Boolean algebras.