Switch to: References

Add citations

You must login to add citations.
  1. Proof Theory and Algebra in Logic.Hiroakira Ono - 2019 - Singapore: Springer Singapore.
    This book offers a concise introduction to both proof-theory and algebraic methods, the core of the syntactic and semantic study of logic respectively. The importance of combining these two has been increasingly recognized in recent years. It highlights the contrasts between the deep, concrete results using the former and the general, abstract ones using the latter. Covering modal logics, many-valued logics, superintuitionistic and substructural logics, together with their algebraic semantics, the book also provides an introduction to nonclassical logic for undergraduate (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Bounded-Analytic Sequent Calculi and Embeddings for Hypersequent Logics.Agata Ciabattoni, Timo Lang & Revantha Ramanayake - 2021 - Journal of Symbolic Logic 86 (2):635-668.
    A sequent calculus with the subformula property has long been recognised as a highly favourable starting point for the proof theoretic investigation of a logic. However, most logics of interest cannot be presented using a sequent calculus with the subformula property. In response, many formalisms more intricate than the sequent calculus have been formulated. In this work we identify an alternative: retain the sequent calculus but generalise the subformula property to permit specific axiom substitutions and their subformulas. Our investigation leads (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Poset Products as Relational Models.Wesley Fussner - 2022 - Studia Logica 110 (1):95-120.
    We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and generalizes two semantics already appearing in the literature: Aguzzoli, Bianchi, and Marra’s temporal flow semantics for Hájek’s basic logic, and Lewis-Smith, Oliva, and Robinson’s semantics for intuitionistic Łukasiewicz logic. As a consequence of our general theory, we recover the soundness and completeness results of these prior studies in a uniform (...)
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Interpolation Via Translations.João Rasga, Walter Carnielli & Cristina Sernadas - 2009 - Mathematical Logic Quarterly 55 (5):515-534.
    A new technique is presented for proving that a consequence system enjoys Craig interpolation or Maehara interpolation based on the fact that these properties hold in another consequence system. This technique is based on the existence of a back and forth translation satisfying some properties between the consequence systems. Some examples of translations satisfying those properties are described. Namely a translation between the global/local consequence systems induced by fragments of linear logic, a Kolmogorov-Gentzen-Gödel style translation, and a new translation between (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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   3 citations  
  • Structural Completeness in Substructural Logics.J. S. Olson, J. G. Raftery & C. J. Van Alten - 2008 - Logic Journal of the IGPL 16 (5):453-495.
    Hereditary structural completeness is established for a range of substructural logics, mainly without the weakening rule, including fragments of various relevant or many-valued logics. Also, structural completeness is disproved for a range of systems, settling some previously open questions.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  • 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   11 citations  
  • Amalgamation Through Quantifier Elimination for Varieties of Commutative Residuated Lattices.Enrico Marchioni - 2012 - Archive for Mathematical Logic 51 (1-2):15-34.
    This work presents a model-theoretic approach to the study of the amalgamation property for varieties of semilinear commutative residuated lattices. It is well-known that if a first-order theory T enjoys quantifier elimination in some language L, the class of models of the set of its universal consequences ${\rm T_\forall}$ has the amalgamation property. Let ${{\rm Th}(\mathbb{K})}$ be the theory of an elementary subclass ${\mathbb{K}}$ of the linearly ordered members of a variety ${\mathbb{V}}$ of semilinear commutative residuated lattices. We show that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Topological Proofs of Some Rasiowa-Sikorski Lemmas.Robert Goldblatt - 2012 - Studia Logica 100 (1-2):175-191.
    We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Strong Negation in Intuitionistic Style Sequent Systems for Residuated Lattices.Michał Kozak - 2014 - Mathematical Logic Quarterly 60 (4-5):319-334.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • On Varieties of Biresiduation Algebras.C. J. van Alten - 2006 - Studia Logica 83 (1-3):425-445.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • ŁΠ Logic with Fixed Points.Luca Spada - 2008 - Archive for Mathematical Logic 47 (7-8):741-763.
    We study a system, μŁΠ, obtained by an expansion of ŁΠ logic with fixed points connectives. The first main result of the paper is that μŁΠ is standard complete, i.e., complete with regard to the unit interval of real numbers endowed with a suitable structure. We also prove that the class of algebras which forms algebraic semantics for this logic is generated, as a variety, by its linearly ordered members and that they are precisely the interval algebras of real closed (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Algebraic Kripke-Style Semantics for Relevance Logics.Eunsuk Yang - 2014 - Journal of Philosophical Logic 43 (4):803-826.
    This paper deals with one kind of Kripke-style semantics, which we shall call algebraic Kripke-style semantics, for relevance logics. We first recall the logic R of relevant implication and some closely related systems, their corresponding algebraic structures, and algebraic completeness results. We provide simpler algebraic completeness proofs. We then introduce various types of algebraic Kripke-style semantics for these systems and connect them with algebraic semantics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Algebraic Approach to the Disjunction Property of Substructural Logics.Daisuke Souma - 2007 - Notre Dame Journal of Formal Logic 48 (4):489-495.
    Some of the basic substructural logics are shown by Ono to have the disjunction property (DP) by using cut elimination of sequent calculi for these logics. On the other hand, this syntactic method works only for a limited number of substructural logics. Here we show that Maksimova's criterion on the DP of superintuitionistic logics can be naturally extended to one on the DP of substructural logics over FL. By using this, we show the DP for some of the substructural logics (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics Over FL.Nikolaos Galatos & Hiroakira Ono - 2006 - Studia Logica 83 (1-3):279-308.
    Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  • Constructive Logic with Strong Negation is a Substructural Logic. II.M. Spinks & R. Veroff - 2008 - Studia Logica 89 (3):401-425.
    The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew. The main result of Part I of this series [41] shows that the equivalent variety semantics of N and the equivalent variety semantics of NFL ew are term equivalent. In this paper, the term equivalence result of Part I [41] is lifted to the setting of deductive (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Constructive Logic with Strong Negation is a Substructural Logic. I.Matthew Spinks & Robert Veroff - 2008 - Studia Logica 88 (3):325-348.
    The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew . In this paper, it is shown that the equivalent variety semantics of N (namely, the variety of Nelson algebras) and the equivalent variety semantics of NFL ew (namely, a certain variety of FL ew -algebras) are term equivalent. This answers a longstanding question of Nelson [30]. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Proper Semantics for Substructural Logics, From a Stalker Theoretic Point of View.Sato Kentaro - 2008 - Studia Logica 88 (2):295-324.
    We study filters in residuated structures that are associated with congruence relations (which we call -filters), and develop a semantical theory for general substructural logics based on the notion of primeness for those filters. We first generalize Stone’s sheaf representation theorem to general substructural logics and then define the primeness of -filters as being “points” (or stalkers) of the space, the spectrum, on which the representing sheaf is defined. Prime FL-filters will turn out to coincide with truth sets under various (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties.Francesco Paoli, Matthew Spinks & Robert Veroff - 2008 - Logica Universalis 2 (2):209-233.
    We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail Abelian ℓ-groups, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • The Beth Property in Algebraic Logic.W. J. Blok & Eva Hoogland - 2006 - Studia Logica 83 (1-3):49-90.
    The present paper is a study in abstract algebraic logic. We investigate the correspondence between the metalogical Beth property and the algebraic property of surjectivity of epimorphisms. It will be shown that this correspondence holds for the large class of equivalential logics. We apply our characterization theorem to relevance logics and many-valued logics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Algebraic Proof Theory for Substructural Logics: Cut-Elimination and Completions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2012 - Annals of Pure and Applied Logic 163 (3):266-290.
  • Glivenko Theorems for Substructural Logics Over FL.Nikolaos Galatos & Hiroakira Ono - 2006 - Journal of Symbolic Logic 71 (4):1353 - 1384.
    It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the last part (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  • Generalized Ordinal Sums and Translations.Nikolaos Galatos - 2011 - Logic Journal of the IGPL 19 (3):455-466.
    We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of substructural logics. Our approach is algebraic and uses residuated lattices, the algebraic models for substructural logics. We generalize the notion of the ordinal sum of two residuated lattices and use it to obtain embeddings between subvariety lattices of certain residuated lattice varieties. As a special case we obtain the above mentioned embedding of the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Interpolation and Beth’s Property in Propositional Many-Valued Logics: A Semantic Investigation.Franco Montagna - 2006 - Annals of Pure and Applied Logic 141 (1):148-179.
    In this paper we give a rather detailed algebraic investigation of interpolation and Beth’s property in propositional many-valued logics extending Hájek’s Basic Logic [P. Hájek, Metamathematics of Fuzzy Logic, Kluwer, 1998], and we connect such properties with amalgamation and strong amalgamation in the corresponding varieties of algebras. It turns out that, while the most interesting extensions of in the language of have deductive interpolation, very few of them have Beth’s property or Craig interpolation. Thus in the last part of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Algebraic Proof Theory: Hypersequents and Hypercompletions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2017 - Annals of Pure and Applied Logic 168 (3):693-737.
  • Correspondences Between Gentzen and Hilbert Systems.J. G. Raftery - 2006 - Journal of Symbolic Logic 71 (3):903 - 957.
  • Equivalence of Consequence Relations: An Order-Theoretic and Categorical Perspective.Nikolaos Galatos & Constantine Tsinakis - 2009 - Journal of Symbolic Logic 74 (3):780-810.
    Equivalences and translations between consequence relations abound in logic. The notion of equivalence can be defined syntactically, in terms of translations of formulas, and order-theoretically, in terms of the associated lattices of theories. W. Blok and D. Pigozzi proved in [4] that the two definitions coincide in the case of an algebraizable sentential deductive system. A refined treatment of this equivalence was provided by W. Blok and B. Jónsson in [3]. Other authors have extended this result to the cases of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations