Switch to: References

Add citations

You must login to add citations.
  1. Conservative Translations Revisited.J. Ramos, J. Rasga & C. Sernadas - 2023 - Journal of Philosophical Logic 52 (3):889-913.
    We provide sufficient conditions for the existence of a conservative translation from a consequence system to another one. We analyze the problem in many settings, namely when the consequence systems are generated by a deductive calculus or by a logic system including both proof-theoretic and model-theoretic components. We also discuss reflection of several metaproperties with the objective of showing that conservative translations provide an alternative to proving such properties from scratch. We discuss soundness and completeness, disjunction property and metatheorem of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Surviving Abduction.Walter Carnielli - 2006 - Logic Journal of the IGPL 14 (2):237-256.
    Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation is a kind of complement for usual argumentation. There is, however, an inferential step from the explanandum to the abductive explanans . Whether this inferential step can be captured by logical machinery depends upon a number of assumptions, but in any case it suffers in principle from the triviality objection: any time a singular contradictory explanans occurs, the system collapses (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Meeting Hintikka's Challenge to Paraconsistentism.Walter Carnielli - 2009 - Principia: An International Journal of Epistemology 13 (3):283-297.
    Jaakko Hintikka, in a series of talks in Brazil in 2008, defended that IF logic and paraconsistent logic are, in a sense, very similar. Having sketched the proposal of a new paraconsistent system, he maintains that several achievements of IF logic could be reproducible in paraconsistent logic. One of the major difficulties, left as a challenge, would be to formulate some truth conditions for this new paraconsistent first-order language in order to make IF logic and paraconsistent logic more inter-related. My (...)
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Behavioral algebraization of da Costa's C-systems.Carlos Caleiro & Ricardo Gonçalves - 2009 - Journal of Applied Non-Classical Logics 19 (2):127-148.
    It is well-known that da Costa's C-systems of paraconsistent logic do not admit a Blok-Pigozzi algebraization. Still, an algebraic flavored semantics for them has been proposed in the literature, namely using the class of so-called da Costa algebras. However, the precise connection between these semantic structures and the C-systems was never established at the light of the theory of algebraizable logics. In this paper we propose to study the C-systems from an algebraic point of view, and to fill in this (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations