A Direct Characterisation of Logical Grounds and a Decidability Proof
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913762355707904 |
|---|---|
| author | Genco, Francesco A. |
| author_facet | Genco, Francesco A. |
| contents | We present a standard calculus for logical grounding based on well-established grounding principles [Schnieder, 2011, Fine, 2012, Correia, 2014, Correia, 2024] and provide a very direct characterisation of the provable grounding claims exclusively relying on the syntactic tree of the grounded formula. The technical features of the characterisation imply that the grounding relation induced by the calculus is decidable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_21264 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Direct Characterisation of Logical Grounds and a Decidability Proof Genco, Francesco A. Logic We present a standard calculus for logical grounding based on well-established grounding principles [Schnieder, 2011, Fine, 2012, Correia, 2014, Correia, 2024] and provide a very direct characterisation of the provable grounding claims exclusively relying on the syntactic tree of the grounded formula. The technical features of the characterisation imply that the grounding relation induced by the calculus is decidable. |
| title | A Direct Characterisation of Logical Grounds and a Decidability Proof |
| topic | Logic |
| url | https://arxiv.org/abs/2503.21264 |