Switch to: References

Add citations

You must login to add citations.
  1. Proof-theoretic modal pa-completeness I: A system-sequent metric.Paolo Gentilini - 1999 - Studia Logica 63 (1):27-48.
    This paper is the first of a series of three articles that present the syntactic proof of the PA-completeness of the modal system G, by introducing suitable proof-theoretic objects, which also have an independent interest. We start from the syntactic PA-completeness of modal system GL-LIN, previously obtained in [7], [8], and so we assume to be working on modal sequents S which are GL-LIN-theorems. If S is not a G-theorem we define here a notion of syntactic metric d(S, G): we (...)
    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