I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specific states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I then (...) investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. (shrink)

How does metaphysical grounding interact with the truth-functions? I argue that the answer varies according to whether one has a worldly conception or a conceptual conception of grounding. I then put forward a logic of worldly grounding and give it an adequate semantic characterisation.

Kit Fine, in "The Pure Logic of Ground", has made a seminal attempt at formalizing the notion of ground. Fine ties the formal treatment of grounding to the notion of a weak ground. Formalization of this sort is supposed to bring clarity and precision to our theorizing. Unfortunately, as I will argue, it's not clear what weak ground is. I review five alternative explanations of the idea, and argue that none of them are ultimately satisfactory. I close by outlining a (...) more complicated explanation of the notion that turns out to be more satisfactory. (shrink)

In this paper, I provide a thorough discussion and reconstruction of Bernard Bolzano’s theory of grounding and a detailed investigation into the parallels between his concept of grounding and current notions of normal proofs. Grounding (Abfolge) is an objective ground-consequence relation among true propositions that is explanatory in nature. The grounding relation plays a crucial role in Bolzano’s proof-theory, and it is essential for his views on the ideal buildup of scientific theories. Occasionally, similarities have been pointed out between Bolzano’s (...) ideas on grounding and cut-free proofs in Gentzen’s sequent calculus. My thesis is, however, that they bear an even stronger resemblance to the normal natural deduction proofs employed in proof-theoretic semantics in the tradition of Dummett and Prawitz. (shrink)

In spite of its significance for everyday and philosophical discourse, the explanatory connective has not received much treatment in the philosophy of logic. The present paper develops a logic for based on systematic connections between and the truth-functional connectives.

A number of philosophers have recently become receptive to the idea that, in addition to scientific or causal explanation, there may be a distinctive kind of metaphysical explanation, in which explanans and explanandum are connected, not through some sort of causal mechanism, but through some constitutive form of determination. I myself have long been sympathetic to this idea of constitutive determination or ‘ontological ground’; and it is the aim of the present paper to help put the idea on a firmer (...) footing - to explain how it is to be understood, how it relates to other ideas, and how it might be of use in philosophy. (shrink)

I lay down a system of structural rules for various notions of ground and establish soundness and completeness.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

Not all truths are on a par. The realm of truths is structured: some propositions are only true because others are. The relation that endows the realm of truths with this structure is often called grounding. Grounding has achieved much attention in 21st century metaphysics, but the topic is arguably as old as philosophy itself. -/- This becomes apparent when investigating the works of the 19th-century philosopher Bernard Bolzano, who developed what is perhaps the first comprehensive theory of grounding, drawing (...) on a rich tradition that goes back to Aristotle’s Posterior Analytics. Roski’s book provides, for the first time, a comprehensive study of Bolzano’s theory of grounding in its entirety, paying more attention than previous studies to the interaction between grounding and the consequence-relation of deducibility. -/- . (shrink)

I identify a notion of logical grounding, clarify it, and show how it can be used (i) to characterise various consequence relations, and (ii) to give a precise syntactic account of the notion of “groundedness” at work in the literature on the paradoxes of truth.

Metaphysical grounding is standardly taken to be irreflexive: nothing grounds itself. Kit Fine has presented some puzzles that appear to contradict this principle. I construct a particularly simple variant of those puzzles that is independent of several of the assumptions required by Fine, instead employing quantification into sentence position. Various possible responses to Fine's puzzles thus turn out to apply only in a restricted range of cases.

This is part one of a two-part paper, in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. This allows us to connect theories of partial ground with axiomatic theories of truth. In this part of the paper, we develop an axiomatization of the relation of partial ground over the truths of arithmetic and show that (...) the theory is a proof-theoretically conservative extension of the theory PT of positive truth. We construct models for the theory and draw some conclusions for the semantics of conceptualist ground. (shrink)

In this paper our aim is twofold: on the one hand, to present in a clear and faithful way two recent contributions to the logic of grounding, namely Correia, and Fine ; on the other hand, to argue that some of the formal principles describing the notion of grounding proposed by these logics need to be changed and improved.

The aim of this paper is to provide a definition of the the notion of complete and immediate formal grounding through the concepts of derivability and complexity. It will be shown that this definition yields a subtle and precise analysis of the concept of grounding in several paradigmatic cases.

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.

Say that two sentences are factually equivalent when they describe the same facts or situations, understood as worldly items, i.e. as bits of reality rather than as representations of reality. The notion of factual equivalence is certainly of central interest to philosophical semantics, but it plays a role in a much wider range of philosophical areas. What is the logic of factual equivalence? This paper attempts to give a partial answer to this question, by providing an answer the following, more (...) specific question: Given a standard propositional language with negation, conjunction and disjunction as primitive operators, which sentences of the language should be taken to be factually equivalent by virtue of their logical form? The system for factual equivalence advocated in this paper is a proper fragment of the first-degree system for the logic of analytic equivalence put forward in the late seventies by R. B. Angell. I provide the system with two semantics, both formulated in terms of the notion of a situation’s being fittingly described by a linguistic item. In the final part of the paper I argue, contra a view I defended in my “Grounding and Truth-Functions”, that the logic for factual equivalence I advocate here should be preferred to Angell’s logic if one wishes to follow the general conception of the relationships between factual equivalence and the notion of grounding put forward in the 2010 paper. (shrink)

I argue in favour of object languages of logics to be diversely-generated, that is, not having identical immediate sub-formulas. In addition to diversely-generated object languages constituting a more appropriate abstraction of the use of sentential connectives in natural language, I show that such language lead to a simplifications w.r.t. some specific issues: the identity of proofs, the factual equivalence and the Mingle axiom in Relevance logics. I also point out that some of the properties of classical logic based on freely-generated (...) object languagest. (shrink)