Precisely framing a formal notion of explanation is a hard problem of great relevance for several areas of scientific investigation such as computer science, philosophy and mathematics. We study a notion of formal explanation according to which an explanation of a formula F must contain all and only the true formulae that concur in determining the truth of F. Even though this notion of formal explanation is defined by reference to derivability in classical logic, the relation that holds between the explained formula and the formulae explaining it has a distinct substructural flavour, due to the fact that no redundancy is admitted among the explaining formulae. We formalise this intuition and prove that this notion of formal explanation is essentially connected, in a very specific sense, to derivability in a substructural calculus

Defining Formal Explanation in Classical Logic by Substructural 
Derivability / F.A. Genco, F. Poggiolesi (LECTURE NOTES IN COMPUTER SCIENCE). - In: Connecting with Computability / [a cura di] L. De Mol, A. Weiermann, F. Manea, D. Fernández-Duque. - [s.l] : Springer, 2021. - ISBN 978-3-030-80048-2. - pp. 237-247 (( Intervento presentato al 17. convegno CiE Conference on Computability in Europe : July, 5th – 9th tenutosi a Ghent (on-line) nel 2021 [10.1007/978-3-030-80049-9_22].

Defining Formal Explanation in Classical Logic by Substructural 
Derivability

F.A. Genco
Primo
;
2021

Abstract

Precisely framing a formal notion of explanation is a hard problem of great relevance for several areas of scientific investigation such as computer science, philosophy and mathematics. We study a notion of formal explanation according to which an explanation of a formula F must contain all and only the true formulae that concur in determining the truth of F. Even though this notion of formal explanation is defined by reference to derivability in classical logic, the relation that holds between the explained formula and the formulae explaining it has a distinct substructural flavour, due to the fact that no redundancy is admitted among the explaining formulae. We formalise this intuition and prove that this notion of formal explanation is essentially connected, in a very specific sense, to derivability in a substructural calculus
Formal explanation; Proof theory; Substructural logics;
Settore M-FIL/02 - Logica e Filosofia della Scienza
2021
Universiteit Gent
Association Computability in Europe
https://doi.org/10.1007/978-3-030-80049-9_22
Book Part (author)
File in questo prodotto:
File Dimensione Formato  
CiE.pdf

accesso aperto

Tipologia: Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione 400.76 kB
Formato Adobe PDF
400.76 kB Adobe PDF Visualizza/Apri
978-3-030-80049-9(1).pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 469.78 kB
Formato Adobe PDF
469.78 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/1036351
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact