In Poggiolesi we have introduced a rigorous definition of the notion of complete and immediate formal grounding; in the present paper our aim is to construct a logic for the notion of complete and immediate formal grounding based on that definition. Our logic will have the form of a calculus of natural deduction, will be proved to be sound and complete and will allow us to have fine-grained grounding principles.

By following a recent result of [Wilhelm, 2021], it can easily be shown that standard conditions for immediate partial grounding and relevant identity conditions for propositions are inconsistent with one another. This is an unfortunate situation for all grounding enthusiasts; however, by adopting the approach presented by Poggiolesi [2016a,b], which displays a more-fined grained use of negations, it can also be shown that consistency can be restored back.

Say that two sentences are ground-theoretically equivalent iff they are interchangeable salva veritate in grounding contexts. Notoriously, ground-theoretic equivalence is a hyperintensional matter: even logically equivalent sentences may fail to be interchangeable in grounding contexts. Still, there seem to be some substantive, general principles of ground-theoretic equivalence. For example, it seems plausible that any sentences of the form A∧B\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A \wedge B$$\end{document} and B∧A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B (...) \wedge A$$\end{document} are ground-theoretically equivalent. What, then, are in general the conditions for two sentences to stand in the relation of ground-theoretic equivalence, and what are the logical features of that relation? This paper develops and defends an answer to these questions based on the mode-ified truthmaker theory of content presented in my recent paper ‘Towards a theory of ground-theoretic content’ :785–814, 2018). (shrink)

Most of the logics of grounding that have so far been proposed contain grounding axioms, or grounding rules, for the connectives of conjunction, disjunction and negation, but little attention has been dedicated to the implication connective. The present paper aims at repairing this situation by proposing adequate grounding principles for relevant implication. Because of the interaction between negation and implication, new grounding principles concerning negation will also arise.

The paper presents a plan for negation, proposing a paradigm shift from the Australian plan for negation, leading to a family of contra-classical logics. The two main ideas are the following: Instead of shifting points of evaluation (in a frame), shift the evaluated formula. Introduce an incompatibility set for every atomic formula, extended to any compound formula, and impose the condition on valuations that a formula evaluates to true iff all the formulas in its incompatibility set evaluate to false. Thus, (...) atomic sentences are not independent in their truth-values. The resulting negation, in addition to excluding the negated formula, provides a positive alternative to the negated formula. I also present a sound and complete natural deduction proof systems for those logics. In addition, the kind of negation considered in this paper is shown to provide an innovative notion of grounding negation. (shrink)

In Poggiolesi [. Grounding principles for implication. Synthese, 1–28], a definition of the notion of grounding in the background of a relevant framework has been introduced; this...

We outline a class of term-languages for epistemic grounding inspired by Prawitz’s theory of grounds. We show how denotation functions can be defined over these languages, relating terms to proof-objects built up of constructive functions. We discuss certain properties that the languages may enjoy both individually and with respect to their expansions. Finally, we provide a ground-theoretic version of Prawitz’s completeness conjecture, and adapt to our framework a refutation of this conjecture due to Piecha and Schroeder-Heister.