Calculi of epistemic grounding based on Prawitz's theory of grounds

TL;DR

This paper introduces formal systems inspired by Prawitz's theory of grounds to model epistemic grounding, defining validity via grounds and proving normalization for these systems.

Contribution

It formalizes epistemic grounding using typed grounds and develops systems with normalization properties based on Prawitz's theory.

Findings

Systems can prove properties of grounds and validity.

Grounds can be canonical or non-canonical, with reduction rules.

Normalization property is established for all systems.

Abstract

We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to epistemically compel to accept the conclusion. Validity is defined in terms of typed objects, called grounds, that reify evidence for given judgments. An inference is valid when a function exists from grounds for the premises to grounds for the conclusion. Grounds are described by formal terms, either directly when the terms are in canonical form, or indirectly when they are in non-canonical form. Non-canonical terms must reduce to canonical form, and two terms may be said to be equal when they converge towards equivalent grounds. In our systems these properties can be proved through rules distinguished according to whether they concern types or logic. Type rules involve type introduction and elimination, equality for application of operational symbols, and re-writing equations for non-canonical terms. The logic amounts to a sort of intuitionistic system in a Gentzen format. To conclude, we show that each system of our class enjoys a normalization property.