1,720,986 research outputs found

    A Note on Natural Extensions in Abstract Algebraic Logic

    No full text
    Transfer theorems are central results in abstract algebraic logic that allow to generalize properties of the lattice of theories of a logic to any algebraic model and its lattice of filters. Their proofs sometimes require the existence of a natural extension of the logic to a bigger set of variables. Constructions of such extensions have been proposed in particular settings in the literature. In this paper we show that these constructions need not always work and propose a wider setting (including all finitary logics and those with countable language) in which they can still be used

    Implicational (semilinear) logics III: completeness properties

    No full text
    This paper presents an abstract study of completeness properties of non-classical logics with respect to matricial semantics. Given a class of reduced matrix models we define three completeness properties of increasing strength and characterize them in several useful ways. Some of these characterizations hold in absolute generality and others are for logics with generalized implication or disjunction connectives, as considered in the previous papers. Finally, we consider completeness with respect to matrices with a linear dense order and characterize it in terms of an extension property and a syntactical metarule. This is the final part of the investigation started and developed in the papers (Cintula and Noguera in Arch Math Logic 49(4):417–446, 2010; Arch Math Logic 53(3):353–372, 2016)

    Implicational (semilinear) logics II: additional connectives and characterizations of semilinearity

    No full text
    This is the continuation of the paper (Cintula and Noguera in Arch Math Log 49(4):417–446, 2010). We continue the abstract study of non-classical logics based on the kind of generalized implication connectives they possess and we focus on semilinear logics, i.e. those that are complete with respect to the class of models where the implication defines a linear order. We obtain general characterizations of semilinearity in terms of the intersection-prime extension property, the syntactical semilinearity metarule and the class of finitely subdirectly irreducible models. Moreover, we consider extensions of the language with lattice connectives and generalized disjunctions, study their interplay with implication and obtain axiomatizations and further descriptions of semilinear logics in terms of disjunctions and the proof by cases property

    A henkin-style proof of completeness for first-order algebraizable logics

    No full text
    This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an algebraic semantics L and a suitable disjunction) we axiomatize two natural first-order extensions L∀m and L∀ and prove that the former is complete with respect to all models over algebras from,L while the latter is complete with respect to all models over relatively finitely subdirectly irreducible algebras. While the first completeness result is relatively straightforward, the second requires non-trivial modifications of Henkin’s proof by making use of the disjunction connective. As a byproduct, we also obtain a form of Skolemization provided that the algebraic semantics admits regular completions. The relatively modest assumptions on the propositional side allow for a wide generalization of previous approaches by Rasiowa, Sikorski, Hájek, Horn, and others and help to illuminate the “essentially first-order” steps in the classical Henkin’s proof

    Implicational (semilinear) logics I: A new hierarchy

    No full text
    In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives they possess. It yields a new classification of logics expanding Leibniz hierarchy: the hierarchy of implicational logics. In this framework the notion of implicational semilinear logic can be naturally introduced as a property of the implication, namely a logic L is an implicational semilinear logic iff it has an implication such that L is complete w.r.t. the matrices where the implication induces a linear order, a property which is typically satisfied by well-known systems of fuzzy logic. The hierarchy of implicational logics is then restricted to the semilinear case obtaining a classification of implicational semilinear logics that encompasses almost all the known examples of fuzzy logics and suggests new directions for research in the field. © Springer-Verlag 2010

    Logic and Implication: An Introduction to the General Algebraic Study of Non-Classical Logics

    No full text
    This monograph presents a general theory of weakly implicative logics, a family covering a vast number of non-classical logics studied in the literature, concentrating mainly on the abstract study of the relationship between logics and their algebraic semantics. It can also serve as an introduction to (abstract) algebraic logic, both propositional and first-order, with special attention paid to the role of implication, lattice and residuated connectives, and generalized disjunctions. Based on their recent work, the authors develop a powerful uniform framework for the study of non-classical logics. In a self-contained and didactic style, starting from very elementary notions, they build a general theory with a substantial number of abstract results. The theory is then applied to obtain numerous results for prominent families of logics and their algebraic counterparts, in particular for superintuitionistic, modal, substructural, fuzzy, and relevant logics. The book may be of interest to a wide audience, especially students and scholars in the fields of mathematics, philosophy, computer science, or related areas, looking for an introduction to a general theory of non-classical logics and their algebraic semantics

    The Proof by Cases Property and its Variants in Structural Consequence Relations

    No full text
    This paper is a contribution to the study of the rôle of disjunction in Abstract Algebraic Logic. Several kinds of (generalized) disjunctions, usually defined using a suitable variant of the proof by cases property, were introduced and extensively studied in the literature mainly in the context of finitary logics. The goals of this paper are to extend these results to all logics, to systematize the multitude of notions of disjunction (both those already considered in the literature and those introduced in this paper), and to show several interesting applications allowed by the presence of a suitable disjunction in a given logic. © 2013 Springer Science+Business Media Dordrecht

    Neighborhood semantics for modal many-valued logics

    Full text link
    The majority of works on modal many-valued logics consider Kripke-style possible worlds frames as the principal semantics despite their well-known axiomatizability issues when considering non-Boolean accessibility relations. The present work explores a more general semantical picture, namely a many-valued version of the classical neighborhood semantics. We present it in two levels of generality. First, we work with modal languages containing only the two usual unary modalities, define neighborhood frames over algebras of the logic FLew with operators, and show their relation with the usual Kripke semantics (this is actually the highest level of generality where one can give a straightforward definition of the Kripke-style semantics). Second, we define generalized neighborhood frames for arbitrary modal languages over a given class of algebras for an arbitrary protoalgebraic logic and, assuming certain additional conditions, axiomatize the logic of all such frames (which generalizes the completeness theorem of the classical modal logic E with respect to classical neighborhood frames)

    An abstract approach to fuzzy logics: Implicational semilinear logics

    No full text
    This paper presents a new abstract framework to deal in a uniform way with the increasing variety of fuzzy logics studied in the literature. By means of notions and techniques from Abstract Algebraic Logic, we perform a study of non-classical logics based on the kind of generalized implication connectives they possess. It yields the new hierarchy of implicational logics. In this framework the notion of implicational semilinear logic can be naturally introduced as a property of the implication, namely a logic L is an impli-cational semilinear logic iff it has an implication such that L is complete w.r.t. the matrices where the implication induces a linear order, a property which is typically satisfied by well-known systems of fuzzy logic. The hierarchy of implicational logics is then restricted to the semilinear case obtaining a classification of implicational semilinear logics that encompasses almost all the known examples of fuzzy logics and suggests new directions for research in the field

    Modal logics of uncertainty with two-layer syntax: A general completeness theorem

    No full text
    Modal logics with two syntactical layers (both governed by classical logic) have been proposed as logics of uncertainty following Hamblin's seminal idea of reading the modal operator □φ as 'probably φ', meaning that the probability of φ is bigger than a given threshold. An interesting departure from that (classical) paradigm has been introduced by Hájek with his fuzzy probability logic when, while still keeping classical logic as interpretation of the lower syntactical layer, he proposed to use Łukasiewicz logic in the upper one, so that the truth degree of □φ could be directly identified with the probability of φ. Later, other authors have used the same formalism with different kinds of uncertainty measures and other pairs of logics, allowing for a treatment of uncertainty of vague events (i.e. also changing the logic in the lower layer). The aim of this paper is to provide a general framework for two-layer modal logics that encompasses all the previously studied two-layer modal fuzzy logics, provides a general axiomatization and a semantics of measured Kripke frames, and prove a general completeness theorem. © 2014 Springer-Verlag
    corecore