Switch to: Citations

Add references

You must login to add references.
  1. 7. Preserving Logical Structure.Gillman Payette - 2009 - In Raymond Jennings, Bryson Brown & Peter Schotch (eds.), On Preserving: Essays on Preservationism and Paraconsistent Logic. University of Toronto Press. pp. 105-144.
    In this paper Gillman Payette looks at various structural properties of the underlying logic X, and ascertains if these properties will hold of the forcing relation based on X. The structural properties are those that do not deal with particular connectives directly. These properties include the structural rules of inference, compactness, and compositionality among others. The presentation of the logic X is carried out in the style of algebraic logic; thus, a description of the resulting ‘forcing algebras’ is given. The (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • From consequence operator to universal logic: a survey of general abstract logic.Jean-Yves Beziau - 2005 - In Jean-Yves Béziau (ed.), Logica Universalis: Towards a General Theory of Logic. Boston: Birkhäuser Verlog. pp. 3--17.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (2 other versions)A propositional calculus for inconsistent deductive systems.Stanisław Jaśkowski - 1999 - Logic and Logical Philosophy 7:35.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Paraconsistency in Categories: Case of Relevance Logic.Vladimir L. Vasyukov - 2011 - Studia Logica 98 (3):429-443.
    Categorical-theoretic semantics for the relevance logic is proposed which is based on the construction of the topos of functors from a relevant algebra (considered as a preorder category endowed with the special endofunctors) in the category of sets Set. The completeness of the relevant system R of entailment is proved in respect to the semantic considered.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fibring non-truth-functional logics: Completeness preservation.C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas & C. Sernadas - 2003 - Journal of Logic, Language and Information 12 (2):183-211.
    Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. This completeness transfer (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Logic, Semantics, Metamathematics.L. Jonathan Cohen - 1958 - Philosophical Quarterly 8 (30):87-88.
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • Propositional calculus for contradictory deductive systems.Stanisław Jaśkowski - 1969 - Studia Logica 24 (1):143 - 160.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • Book Reviews. [REVIEW]C. Mortensen - 2000 - Studia Logica 64 (2):285-300.
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • Paraconsistent logic.Graham Priest - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   182 citations  
  • Inconsistent mathematics.Chris Mortensen - 2008 - Studia Logica.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • On Inferences from Inconsistent Premises.Nicholas Rescher & Ruth Manor - 1970 - Theory and Decision 1 (2):179-217, 1970-1971.
    The main object of this paper is to provide the logical machinery needed for a viable basis for talking of the ‘consequences’, the ‘content’, or of ‘equivalences’ between inconsistent sets of premisses.With reference to its maximal consistent subsets (m.c.s.), two kinds of ‘consequences’ of a propositional set S are defined. A proposition P is a weak consequence (W-consequence) of S if it is a logical consequence of at least one m.c.s. of S, and P is an inevitable consequence (I-consequence) of (...)
    Download  
     
    Export citation  
     
    Bookmark   79 citations