5 found
Sort by:
  1. Sam Butchart & Susan Rogerson, Algebraizing A→.
    Abelian Logic is a paraconsistent logic discovered independently by Meyer and Slaney [10] and Casari [2]. This logic is also referred to as Abelian Group Logic (AGL) [12] since its set of theorems is sound and complete with respect to the class of Abelian groups. In this paper we investigate the pure implication fragment A→ of Abelian logic. This is an extension of the implication fragment of linear logic, BCI. A Hilbert style axiomatic system for A→ can obtained by adding (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Sam Butchart & Susan Rogerson (2014). On the Algebraizability of the Implicational Fragment of Abelian Logic. Studia Logica 102 (5):981-1001.
    In this paper we consider the implicational fragment of Abelian logic \({{{\sf A}_{\rightarrow}}}\) . We show that although the Abelian groups provide an semantics for the set of theorems of \({{{\sf A}_{\rightarrow}}}\) they do not for the associated consequence relation. We then show that the consequence relation is not algebraizable in the sense of Blok and Pigozzi (Mem Am Math Soc 77, 1989). In the second part of the paper, we investigate an extension of \({{{\sf A}_{\rightarrow}}}\) in the same language (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Susan Rogerson (2007). Natural Deduction and Curry's Paradox. Journal of Philosophical Logic 36 (2):155 - 179.
    Curry's paradox, sometimes described as a general version of the better known Russell's paradox, has intrigued logicians for some time. This paper examines the paradox in a natural deduction setting and critically examines some proposed restrictions to the logic by Fitch and Prawitz. We then offer a tentative counterexample to a conjecture by Tennant proposing a criterion for what is to count as a genuine paradox.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Susan Rogerson & Greg Restall (2004). Routes to Triviality. Journal of Philosophical Logic 33 (4):421-436.
    It is known that a number of inference principles can be used to trivialise the axioms of naïve comprehension - the axioms underlying the naïve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naïve comprehension.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  5. Susan Rogerson & Sam Butchart (2002). Naïve Comprehension and Contracting Implications. Studia Logica 71 (1):119-132.
    In his paper [6], Greg Restall conjectured that a logic supports a naïve comprehension scheme if and only if it is robustly contraction free, that is, if and only if no contracting connective is definable in terms of the primitive connectives of the logic. In this paper, we present infinitely many counterexamples to Restall''s conjecture, in the form of purely implicational logics which are robustly contraction free, but which trivialize naïve comprehension.
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation