Switch to: References

Add citations

You must login to add citations.
  1. Logical Friendliness and Sympathy in Logic.David C. Makinson - 2005 - In J. Y. Beziau (ed.), Logica Universalis. Birkhäuser Verlog. pp. 191--205.
    Defines and examines a notion of logical friendliness, a broadening of the familiar notion of classical consequence. Also reviews familiar notions and operations with which friendliness makes contact, providing a new light in which they may be seen.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Judgment Aggregation in Nonmonotonic Logic.Xuefeng Wen - 2018 - Synthese 195 (8):3651-3683.
    Judgment aggregation studies how to aggregate individual judgments on logically correlated propositions into collective judgments. Different logics can be used in judgment aggregation, for which Dietrich and Mongin have proposed a generalized model based on general logics. Despite its generality, however, all nonmonotonic logics are excluded from this model. This paper argues for using nonmonotonic logic in judgment aggregation. Then it generalizes Dietrich and Mongin’s model to incorporate a large class of nonmonotonic logics. This generalization broadens the theoretical boundaries of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Structuring the Universe of Universal Logic.Vladimir L. Vasyukov - 2007 - Logica Universalis 1 (2):277-294.
    . How, why and what for we should combine logics is perfectly well explained in a number of works concerning this issue. But the interesting question seems to be the nature and the structure of the general universe of possible combinations of logical systems. Adopting the point of view of universal logic in the paper the categorical constructions are introduced which along with the coproducts underlying the fibring of logics describe the inner structure of the category of logical systems. It (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Representations of Structural Closure Operators.José Gil-Férez - 2011 - Archive for Mathematical Logic 50 (1-2):45-73.
    We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a similar characterization for structural representations we introduce the notions of a graduation and a graded variable of an M-set. We show that several deductive systems, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • On an Axiomatic System for the Logic of Linearly Ordered BCI-Matrices.San-min Wang & Dao-Wu Pei - 2012 - Archive for Mathematical Logic 51 (3-4):285-297.
    The logic FBCI given by linearly ordered BCI-matrices is known not to be an axiomatic extension of the well-known BCI logic. In this paper we axiomatize FBCI by adding a recursively enumerable set of schemes of inference rules to BCI and show that there is no finite axiomatization for FBCI.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Nikolaos Galatos.Hiroakira Ono - 2006 - Studia Logica 83 (1-3):1-32.
    No categories
     
    Export citation  
     
    Bookmark  
  • Model-Theoretic Investigations Into Consequence Operation (Cn) in Quantum Logics: An Algebraic Approach.Piotr Wilczek - unknown
    In this paper, we present the fundamentals of the so-called algebraic approach to propositional quantum logics. We define the set of formulae describing quantum reality as a free algebra freely generated by the set of quantum proportional variables. We define the general notion of logic as a structural consequence operation. Next, we introduce the concept of logical matrices understood as a model of quantum logics.We give the definitions of two quantum consequence operations defined in these models.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Constructible Models of Orthomodular Quantum Logics.Piotr Wilczek - unknown
    We continue in this article the abstract algebraic treatment of quantum sentential logics Wil. The Notions borrowed from the field of Model Theory and Abstract Algebraic Logic - AAL (i.e., consequence relation, variety, logical matrix, deductive filter, reduced product, ultraproduct, ultrapower, Frege relation, Leibniz congruence, Suszko congruence, Leibniz operator) are applied to quantum logics. We also proved several equivalences between state property systems (Jauch-Piron-Aerts line of investigations) and AAL treatment of quantum logics (corollary 18 and 19). We show that there (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Cut Elimination and Strong Separation for Substructural Logics: An Algebraic Approach.Nikolaos Galatos & Hiroakira Ono - 2010 - Annals of Pure and Applied Logic 161 (9):1097-1133.
    We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on substructural logics over the full Lambek Calculus [34], Galatos and Ono [18], Galatos et al. [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic associated (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • Proof Systems for the Coalgebraic Cover Modality.Marta Bílková, Alessandra Palmigiano & Yde Venema - 2008 - In Guido Governatori, Ian Hodkinson & Yde Venema (eds.), Advances in Modal Logic, Volume 6. CSLI Publications. pp. 1-21.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Categorical Abstract Algebraic Logic: Gentzen Π ‐Institutions and the Deduction‐Detachment Property.George Voutsadakis - 2005 - Mathematical Logic Quarterly 51 (6):570-578.
    Given a π -institution I , a hierarchy of π -institutions I is constructed, for n ≥ 1. We call I the n-th order counterpart of I . The second-order counterpart of a deductive π -institution is a Gentzen π -institution, i.e. a π -institution associated with a structural Gentzen system in a canonical way. So, by analogy, the second order counterpart I of I is also called the “Gentzenization” of I . In the main result of the paper, it (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Conserving Involution in Residuated Structures.Ai-ni Hsieh & James G. Raftery - 2007 - Mathematical Logic Quarterly 53 (6):583-609.
    This paper establishes several algebraic embedding theorems, each of which asserts that a certain kind of residuated structure can be embedded into a richer one. In almost all cases, the original structure has a compatible involution, which must be preserved by the embedding. The results, in conjunction with previous findings, yield separative axiomatizations of the deducibility relations of various substructural formal systems having double negation and contraposition axioms. The separation theorems go somewhat further than earlier ones in the literature, which (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Categorical Abstract Algebraic Logic: Structurality, Protoalgebraicity, and Correspondence.George Voutsadakis - 2009 - Mathematical Logic Quarterly 55 (1):51-67.
    The notion of an ℐ -matrix as a model of a given π -institution ℐ is introduced. The main difference from the approach followed so far in CategoricalAlgebraic Logic and the one adopted here is that an ℐ -matrix is considered modulo the entire class of morphisms from the underlying N -algebraic system of ℐ into its own underlying algebraic system, rather than modulo a single fixed -logical morphism. The motivation for introducing ℐ -matrices comes from a desire to formulate (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Categorical Abstract Algebraic Logic: The Categorical Suszko Operator.George Voutsadakis - 2007 - Mathematical Logic Quarterly 53 (6):616-635.
    Czelakowski introduced the Suszko operator as a basis for the development of a hierarchy of non-protoalgebraic logics, paralleling the well-known abstract algebraic hierarchy of protoalgebraic logics based on the Leibniz operator of Blok and Pigozzi. The scope of the theory of the Leibniz operator was recently extended to cover the case of, the so-called, protoalgebraic π-institutions. In the present work, following the lead of Czelakowski, an attempt is made at lifting parts of the theory of the Suszko operator to the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Inconsistency Lemmas in Algebraic Logic.James G. Raftery - 2013 - Mathematical Logic Quarterly 59 (6):393-406.
  • The Simplest Protoalgebraic Logic.Josep Maria Font - 2013 - Mathematical Logic Quarterly 59 (6):435-451.
  • A Finite Model Property for RMImin.Ai-ni Hsieh & James G. Raftery - 2006 - Mathematical Logic Quarterly 52 (6):602-612.
    It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMImin has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMImin is decidable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Two Fragments with Negation and Without Implication of the Logic of Residuated Lattices.Félix Bou, Àngel García-Cerdaña & Ventura Verdú - 2006 - Archive for Mathematical Logic 45 (5):615-647.
    The logic of (commutative integral bounded) residuated lattices is known under different names in the literature: monoidal logic [26], intuitionistic logic without contraction [1], H BCK [36] (nowadays called by Ono), etc. In this paper we study the -fragment and the -fragment of the logical systems associated with residuated lattices, both from the perspective of Gentzen systems and from that of deductive systems. We stress that our notion of fragment considers the full consequence relation admitting hypotheses. It results that this (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Proof by Cases Property and its Variants in Structural Consequence Relations.Petr Cintula & Carles Noguera - 2013 - Studia Logica 101 (4):713-747.
    This paper is a contribution to the study of the rôle of disjunction inAlgebraic 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), (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Supervenience, Dependence, Disjunction.Lloyd Humberstone - forthcoming - Logic and Logical Philosophy:1.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  • Implicational (Semilinear) Logics I: A New Hierarchy. [REVIEW]Petr Cintula & Carles Noguera - 2010 - Archive for Mathematical Logic 49 (4):417-446.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Categorical Abstract Algebraic Logic: Algebraic Semantics for (Documentclass{Article}Usepackage{Amssymb}Begin{Document}Pagestyle{Empty}$Bf{Pi }$End{Document})‐Institutions.George Voutsadakis - 2013 - Mathematical Logic Quarterly 59 (3):177-200.
  • Categorical Abstract Algebraic Logic: The Diagram and the Reduction Operator Lemmas.George Voutsadakis - 2007 - Mathematical Logic Quarterly 53 (2):147-161.
    The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first-order structure by constants is presented. Furthermore, analogs of the Diagram Lemma and the Reduction Operator Lemma from the theory of equality-free first-order structures are provided in the framework of structure systems. (© 2007 WILEY-VCH (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • The Poset of All Logics I: Interpretations and Lattice Structure.R. Jansana & T. Moraschini - 2021 - Journal of Symbolic Logic 86 (3):935-964.
    A notion of interpretation between arbitrary logics is introduced, and the poset $\mathsf {Log}$ of all logics ordered under interpretability is studied. It is shown that in $\mathsf {Log}$ infima of arbitrarily large sets exist, but binary suprema in general do not. On the other hand, the existence of suprema of sets of equivalential logics is established. The relations between $\mathsf {Log}$ and the lattice of interpretability types of varieties are investigated.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Leo Esakia on Duality in Modal and Intuitionistic Logics.Guram Bezhanishvili (ed.) - 2014 - Dordrecht, Netherland: Springer.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Restricted Rules of Inference and Paraconsistency.Sankha S. Basu & Mihir K. Chakraborty - forthcoming - Logic Journal of the IGPL.
    In this paper, we study two companions of a logic, viz., the left variable inclusion companion and the restricted rules companion, their nature and interrelations, especially in connection with paraconsistency. A sufficient condition for the two companions to coincide has also been proved. Two new logical systems—intuitionistic paraconsistent weak Kleene logic and paraconsistent pre-rough logic —are presented here as examples of logics of left variable inclusion. IPWK is the left variable inclusion companion of intuitionistic propositional logic and is also the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Is There a Neutral Metalanguage?Rea Golan - 2019 - Synthese 198 (Suppl 20):4831-4858.
    Logical pluralists are committed to the idea of a neutral metalanguage, which serves as a framework for debates in logic. Two versions of this neutrality can be found in the literature: an agreed upon collection of inferences, and a metalanguage that is neutral as such. I discuss both versions and show that they are not immune to Quinean criticism, which builds on the notion of meaning. In particular, I show that the first version of neutrality is sub-optimal, and hard to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Contextual Deduction Theorems.J. G. Raftery - 2011 - Studia Logica 99 (1-3):279-319.
    Logics that do not have a deduction-detachment theorem (briefly, a DDT) may still possess a contextual DDT —a syntactic notion introduced here for arbitrary deductive systems, along with a local variant. Substructural logics without sentential constants are natural witnesses to these phenomena. In the presence of a contextual DDT, we can still upgrade many weak completeness results to strong ones, e.g., the finite model property implies the strong finite model property. It turns out that a finitary system has a contextual (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Logics with Disjunction and Proof by Cases.San-min Wang & Petr Cintula - 2008 - Archive for Mathematical Logic 47 (5):435-446.
    This paper is a contribution to the general study of consequence relations which contain (definable) connective of “disjunction”. Our work is centered around the “proof by cases property”, we present several of its equivalent definitions, and show some interesting applications, namely in constructing axiomatic systems for intersections of logics and recognizing weakly implicative fuzzy logics among the weakly implicative ones.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the Infinite-Valued Łukasiewicz Logic That Preserves Degrees of Truth.Josep Maria Font, Àngel J. Gil, Antoni Torrens & Ventura Verdú - 2006 - Archive for Mathematical Logic 45 (7):839-868.
    Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Weakly Implicative (Fuzzy) Logics I: Basic Properties. [REVIEW]Petr Cintula - 2006 - Archive for Mathematical Logic 45 (6):673-704.
    This paper presents two classes of propositional logics (understood as a consequence relation). First we generalize the well-known class of implicative logics of Rasiowa and introduce the class of weakly implicative logics. This class is broad enough to contain many “usual” logics, yet easily manageable with nice logical properties. Then we introduce its subclass–the class of weakly implicative fuzzy logics. It contains the majority of logics studied in the literature under the name fuzzy logic. We present many general theorems for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  • Algebraizable Logics with a Strong Conjunction and Their Semi-Lattice Based Companions.Ramon Jansana - 2012 - Archive for Mathematical Logic 51 (7-8):831-861.
    The best known algebraizable logics with a conjunction and an implication have the property that the conjunction defines a meet semi-lattice in the algebras of their algebraic counterpart. This property makes it possible to associate with them a semi-lattice based deductive system as a companion. Moreover, the order of the semi-lattice is also definable using the implication. This makes that the connection between the properties of the logic and the properties of its semi-lattice based companion is strong. We introduce a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Categorical Abstract Algebraic Logic: Referential Algebraic Semantics.George Voutsadakis - 2013 - Studia Logica 101 (4):849-899.
    Wójcicki has provided a characterization of selfextensional logics as those that can be endowed with a complete local referential semantics. His result was extended by Jansana and Palmigiano, who developed a duality between the category of reduced congruential atlases and that of reduced referential algebras over a fixed similarity type. This duality restricts to one between reduced atlas models and reduced referential algebra models of selfextensional logics. In this paper referential algebraic systems and congruential atlas systems are introduced, which abstract (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Leibniz-Linked Pairs of Deductive Systems.Josep Maria Font & Ramon Jansana - 2011 - Studia Logica 99 (1-3):171-202.
    A pair of deductive systems (S,S’) is Leibniz-linked when S’ is an extension of S and on every algebra there is a map sending each filter of S to a filter of S’ with the same Leibniz congruence. We study this generalization to arbitrary deductive systems of the notion of the strong version of a protoalgebraic deductive system, studied in earlier papers, and of some results recently found for particular non-protoalgebraic deductive systems. The necessary examples and counterexamples found in the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Selfextensional Logics with a Distributive Nearlattice Term.Luciano J. González - 2019 - Archive for Mathematical Logic 58 (1-2):219-243.
    We define when a ternary term m of an algebraic language \ is called a distributive nearlattice term -term) of a sentential logic \. Distributive nearlattices are ternary algebras generalising Tarski algebras and distributive lattices. We characterise the selfextensional logics with a \-term through the interpretation of the DN-term in the algebras of the algebraic counterpart of the logics. We prove that the canonical class of algebras associated with a selfextensional logic with a \-term is a variety, and we obtain (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Algebraic Analysis of Demodalised Analytic Implication.Antonio Ledda, Francesco Paoli & Michele Pra Baldi - 2019 - Journal of Philosophical Logic 48 (6):957-979.
    The logic DAI of demodalised analytic implication has been introduced by J.M. Dunn as a variation on a time-honoured logical system by C.I. Lewis’ student W.T. Parry. The main tenet underlying this logic is that no implication can be valid unless its consequent is “analytically contained” in its antecedent. DAI has been investigated both proof-theoretically and model-theoretically, but no study so far has focussed on DAI from the viewpoint of abstract algebraic logic. We provide several different algebraic semantics for DAI, (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  • Epimorphism Surjectivity in Varieties of Heyting Algebras.T. Moraschini & J. J. Wannenburg - 2020 - Annals of Pure and Applied Logic 171 (9):102824.
    It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety generated by the Rieger-Nishimura lattice, and all of its (locally finite) subvarieties that contain the original counter-example K . It is known that, whenever a variety of Heyting algebras has finite depth, then it has surjective epimorphisms. In contrast, we show that (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Extension Properties and Subdirect Representation in Abstract Algebraic Logic.Tomáš Lávička & Carles Noguera - 2018 - Studia Logica 106 (6):1065-1095.
    This paper continues the investigation, started in Lávička and Noguera : 521–551, 2017), of infinitary propositional logics from the perspective of their algebraic completeness and filter extension properties in abstract algebraic logic. If follows from the Lindenbaum Lemma used in standard proofs of algebraic completeness that, in every finitary logic, intersection-prime theories form a basis of the closure system of all theories. In this article we consider the open problem of whether these properties can be transferred to lattices of filters (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Semi-Intuitionistic Logic with Strong Negation.Juan Manuel Cornejo & Ignacio Viglizzo - 2018 - Studia Logica 106 (2):281-293.
    Motivated by the definition of semi-Nelson algebras, a propositional calculus called semi-intuitionistic logic with strong negation is introduced and proved to be complete with respect to that class of algebras. An axiomatic extension is proved to have as algebraic semantics the class of Nelson algebras.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A New Hierarchy of Infinitary Logics in Abstract Algebraic Logic.Carles Noguera & Tomáš Lávička - 2017 - Studia Logica 105 (3):521-551.
    In this article we investigate infinitary propositional logics from the perspective of their completeness properties in abstract algebraic logic. It is well-known that every finitary logic is complete with respect to its relatively subdirectly irreducible models. We identify two syntactical notions formulated in terms of intersection-prime theories that follow from finitarity and are sufficient conditions for the aforementioned completeness properties. We construct all the necessary counterexamples to show that all these properties define pairwise different classes of logics. Consequently, we obtain (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Categorical Abstract Algebraic Logic: More on Protoalgebraicity.George Voutsadakis - 2006 - Notre Dame Journal of Formal Logic 47 (4):487-514.
    Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic π-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from the sentential framework to the π-institution (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Categorical Abstract Algebraic Logic: Models of Π-Institutions.George Voutsadakis - 2005 - Notre Dame Journal of Formal Logic 46 (4):439-460.
    An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic aspects and results from the (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Categorical Abstract Algebraic Logic: Truth-Equational $Pi$-Institutions.George Voutsadakis - 2015 - Notre Dame Journal of Formal Logic 56 (2):351-378.
    Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Admissible Rules and the Leibniz Hierarchy.James G. Raftery - 2016 - Notre Dame Journal of Formal Logic 57 (4):569-606.
    This paper provides a semantic analysis of admissible rules and associated completeness conditions for arbitrary deductive systems, using the framework of abstract algebraic logic. Algebraizability is not assumed, so the meaning and significance of the principal notions vary with the level of the Leibniz hierarchy at which they are presented. As a case study of the resulting theory, the nonalgebraizable fragments of relevance logic are considered.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Logics of Left Variable Inclusion and Płonka Sums of Matrices.S. Bonzio, T. Moraschini & M. Pra Baldi - 2020 - Archive for Mathematical Logic (1-2):49-76.
    The paper aims at studying, in full generality, logics defined by imposing a variable inclusion condition on a given logic \. We prove that the description of the algebraic counterpart of the left variable inclusion companion of a given logic \ is related to the construction of Płonka sums of the matrix models of \. This observation allows to obtain a Hilbert-style axiomatization of the logics of left variable inclusion, to describe the structure of their reduced models, and to locate (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Capturing Consequence.Alexander Paseau - 2019 - Review of Symbolic Logic 12 (2):271-295.
    First-order formalisations are often preferred to propositional ones because they are thought to underwrite the validity of more arguments. We compare and contrast the ability of some well-known logics—these two in particular—to formally capture valid and invalid arguments. We show that there is a precise and important sense in which first-order logic does not improve on propositional logic in this respect. We also prove some generalisations and related results of philosophical interest. The rest of the article investigates the results’ philosophical (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Behavioral Algebraization of da Costa's C-Systems.Carlos Caleiro & Ricardo Gonçalves - 2009 - Journal of Applied Non-Classical Logics 19 (2):127-148.
    It is well-known that da Costa's C-systems of paraconsistent logic do not admit a Blok-Pigozzi algebraization. Still, an algebraic flavored semantics for them has been proposed in the literature, namely using the class of so-called da Costa algebras. However, the precise connection between these semantic structures and the C-systems was never established at the light of the theory of algebraizable logics. In this paper we propose to study the C-systems from an algebraic point of view, and to fill in this (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Comparison Between Monoidal and Substructural Logics.Clayton Peterson - 2016 - Journal of Applied Non-Classical Logics 26 (2):126-159.
    Monoidal logics were introduced as a foundational framework to analyse the proof theory of deontic logic. Building on Lambek’s work in categorical logic, logical systems are defined as deductive systems, that is, as collections of equivalence classes of proofs satisfying specific rules and axiom schemata. This approach enables the classification of deductive systems with respect to their categorical structure. When looking at their proof theory, however, one can see that there are similarities between monoidal and substructural logics. The purpose of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Canonical Extensions for Congruential Logics with the Deduction Theorem.Mai Gehrke, Ramon Jansana & Alessandra Palmigiano - 2010 - Annals of Pure and Applied Logic 161 (12):1502-1519.
    We introduce a new and general notion of canonical extension for algebras in the algebraic counterpart of any finitary and congruential logic . This definition is logic-based rather than purely order-theoretic and is in general different from the definition of canonical extensions for monotone poset expansions, but the two definitions agree whenever the algebras in are based on lattices. As a case study on logics purely based on implication, we prove that the varieties of Hilbert and Tarski algebras are canonical (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Possible Worlds in Use.Andrzej Indrzejczak - 2011 - Studia Logica 99 (1-3):229-248.
    The paper is a brief survey of the most important semantic constructions founded on the concept of possible world. It is impossible to capture in one short paper the whole variety of the problems connected with manifold applications of possible worlds. Hence, after a brief explanation of some philosophical matters I take a look at possible worlds from rather technical standpoint of logic and focus on the applications in formal semantics. In particular, I would like to focus on the fruitful (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark