Switch to: References

Add citations

You must login to add citations.
  1. Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
    This paper is the final part of the syntactic demonstration of the Arithmetical Completeness of the modal system G; in the preceding parts [9] and [10] the tools for the proof were defined, in particular the notion of syntactic countermodel. Our strategy is: PA-completeness of G as a search for interpretations which force the distance between G and a GL-LIN-theorem to zero. If the GL-LIN-theorem S is not a G-theorem, we construct a formula H expressing the non G-provability of S, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Proof theory and mathematical meaning of paraconsistent C-systems.Paolo Gentilini - 2011 - Journal of Applied Logic 9 (3):171-202.
  • Paraconsistent Informational Logic.Paola Forcheri & Paolo Gentilini - 2005 - Journal of Applied Logic 3 (1):97-118.
  • Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework.Paola Forcheri & Paolo Gentilini - 2005 - Journal of Applied Non-Classical Logics 15 (3):285-319.
    A conjectural inference is proposed, aimed at producing conjectural theorems from formal conjectures assumed as axioms, as well as admitting contradictory statements as conjectural theorems. To this end, we employ Paraconsistent Informational Logic, which provides a formal setting where the notion of conjecture formulated by an epistemic agent can be defined. The paraconsistent systems on which conjectural deduction is based are sequent formulations of the C-systems presented in Carnielli-Marcos [CAR 02b]. Thus, conjectural deduction may also be considered to be a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation