Switch to: References

Add citations

You must login to add citations.
  1. A Lindström-style theorem for finitary propositional weak entailment languages with absurdity.Guillermo Badia - 2016 - Logic Journal of the IGPL 24 (2):115-137.
    Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having the finite occurrence property, preservation under relevant directed bisimulations and the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.
    Download  
     
    Export citation  
     
    Bookmark  
  • Current Trends in Substructural Logics.Katalin Bimbó - 2015 - Journal of Philosophical Logic 44 (6):609-624.
    This paper briefly overviews some of the results and research directions. In the area of substructural logics from the last couple of decades. Substructural logics are understood here to include relevance logics, linear logic, variants of Lambek calculi and some other logics that are motivated by the idea of omitting some structural rules or making other structural changes in LK, the original sequent calculus for classical logic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the decidability of implicational ticket entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
    The implicational fragment of the logic of relevant implication, $R_\to$ is known to be decidable. We show that the implicational fragment of the logic of ticket entailment, $T_\to$ is decidable. Our proof is based on the consecution calculus that we introduced specifically to solve this 50-year old open problem. We reduce the decidability problem of $T_\to$ to the decidability problem of $R_\to$. The decidability of $T_\to$ is equivalent to the decidability of the inhabitation problem of implicational types by combinators over (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • J. Michael Dunn on Information Based Logics.Katalin Bimbo (ed.) - 2016 - Cham, Switzerland: Springer.
    This book celebrates and expands on J. Michael Dunn’s work on informational interpretations of logic. Dunn, in his Ph.D. thesis, introduced a semantics for first-degree entailments utilizing the idea that a sentence can provide positive or negative information about a topic, possibly supplying both or neither. He later published a related interpretation of the logic R-mingle, which turned out to be one of the first relational semantics for a relevance logic. An incompatibility relation between information states lends itself to a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An alternative Gentzenisation of RW+∘.Mirjana Ilić - 2016 - Mathematical Logic Quarterly 62 (6):465-480.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some relevance logics from the point of view of relational semantics.Katalin Bimbó - 2016 - Logic Journal of the IGPL 24 (3):268-287.
    Download  
     
    Export citation  
     
    Bookmark  
  • Combinatory logic.Katalin Bimbó - 2009 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • In memoriam: J. Michael Dunn, 1941–2021.Katalin Bimbó - 2021 - Bulletin of Symbolic Logic 27 (4):519-525.
    Download  
     
    Export citation  
     
    Bookmark  
  • A cut-free sequent calculus for relevant logic RW.M. Ili & B. Bori I. - 2014 - Logic Journal of the IGPL 22 (4):673-695.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A note on the system GRW with the intensional contraction rule.Mirjana Ilić & Branislav Boričić - 2021 - Logic Journal of the IGPL 29 (3):333-339.
    In Ilić and Boričić, the right-handed cut-free sequent calculus $GRW$ for the contraction-less relevant logic $RW$ is defined. In this paper, we show that the enlargement of the system $GRW$ with the structural rule of intensional contraction presents the sequent system for the principal relevant logic $R$ but the rule of cut cannot be eliminated in $GRW+$.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Cut-Elimination Proof in Positive Relevant Logic with Necessity.Mirjana Ilić - 2020 - Studia Logica 109 (3):607-638.
    This paper presents a sequent calculus for the positive relevant logic with necessity and a proof that it admits the elimination of cut.
    Download  
     
    Export citation  
     
    Bookmark   1 citation