A Direct Characterisation of Logical Grounds and a Decidability Proof
Logic
2025-03-28 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2503.21264,
title = {A Direct Characterisation of Logical Grounds and a Decidability Proof},
author = {Francesco A. Genco},
journal= {arXiv preprint arXiv:2503.21264},
year = {2025}
}