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.

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.

Philosophers of mathematics commonly distinguish between explanatory and non-explanatory proofs. An important subclass of mathematical proofs are proofs by induction. Are they explanatory? This paper addresses the question, based on general principles about explanation. First, a recent argument for a negative answer is discussed and rebutted. Second, a case is made for a qualified positive take on the issue.

Benjamin Schnieder has argued that several traditional definitions of truth-functionality fail to capture a central intuition informal characterizations of the notion often capture. The intuition is that the truth-value of a sentence that employs a truth-functional operator depends upon the truth-values of the sentences upon which the operator operates. Schnieder proposes an alternative definition of truth-functionality that is designed to accommodate this intuition. We argue that one traditional definition of ‘truth-functionality’ is immune from the counterexamples that Schnieder proposes and is (...) preferable to Schnieder’s alternative. (shrink)

I describe some paradoxes of ground and relate them to the semantic paradoxes.

In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the logical constants to be given by their elimination rules. I then consider the question: given a set of introduction rules \, what are the strongest elimination rules that are validated by an assertability (...) conditional meaning-theory based on \? I prove that the intuitionistic introduction rules are the strongest rules that are validated by the intuitionistic elimination rules. I then prove that intuitionistic logic is the strongest logic that can be given either an assertability-conditional or consequence-conditional meaning-theory. In “Grounding Grounding” I discuss the notion of grounding. My discussion revolves around the problem of iterated grounding-claims. Suppose that \ grounds \; what grounds that \ grounds that \? I argue that unless we can get a satisfactory answer to this question the notion of grounding will be useless. I discuss and reject some proposed accounts of iterated grounding claims. I then develop a new way of expressing grounding, propose an account of iterated grounding-claims and show how we can develop logics for grounding. In “Is the Vagueness Argument Valid?” I argue that the Vagueness Argument in favor of unrestricted composition isn’t valid. However, if the premisses of the argument are true and the conclusion false, mereological facts fail to supervene on non-mereological facts. I argue that this failure of supervenience is an artifact of the interplay between the necessity and determinacy operators and that it does not mean that mereological facts fail to depend on non-mereological facts. I sketch a deflationary view of ontology to establish this. (shrink)