The following pages link to Paolo Gentilini (Q420831):
Displayed 15 items.
- Proof theory and mathematical meaning of paraconsistent C-systems (Q420832) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- Syntactical results on the arithmetical completeness of modal logic (Q1319362) (← links)
- Informational logic as a tool for automated reasoning (Q1382161) (← links)
- Paraconsistent informational logic (Q1775866) (← links)
- Proof-theoretic modal PA-completeness. I: A system-sequent metric (Q1970598) (← links)
- Proof-theoretic modal PA-completeness. II: The syntactic countermodel (Q1970646) (← links)
- Proof-theoretic modal PA-completeness. III: The syntactic proof (Q1970916) (← links)
- (Q2863910) (← links)
- (Q3112287) (← links)
- Explicit Constructive Logic ECL: a New Representation of Construction and Selection of Logical Information by an Epistemic Agent (Q3187013) (← links)
- Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework (Q3647231) (← links)
- PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC (Q4295253) (← links)
- (Q4896526) (← links)
- Informational logic for automated reasoning (Q5236445) (← links)