Switch to: References

Add citations

You must login to add citations.
  1. What is a Relevant Connective?Shawn Standefer - 2022 - Journal of Philosophical Logic 51 (4):919-950.
    There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Infinitary propositional relevant languages with absurdity.Guillermo Badia - 2017 - Review of Symbolic Logic 10 (4):663-681.
    Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" for the infinitary quantificational boolean logic L-infinity omega. holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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