Abstract

This paper is the second part of a series exploring how, given a proof, we can inductively transform it into a proof that contains no irrelevancies and is as strong as possible. In the prequel paper, I defined a weaker and a stronger notion of what counts as a proof with no irrelevancies, calling them perfect proofs and gaunt proofs, respectively. There, I showed how proofs in core logic and classical core logic can be transformed into perfect proofs. In this paper I study gaunt proofs. I show how proofs in core logic can be inductively transformed into gaunt core proofs, but that this property fails for the natural deduction system of classical core logic.

1 Introduction

This paper and its prequel, [2], address this guiding question: given a natural deduction proof, is there a way to systematically transform it into a proof that contains no irrelevancies and in which the argument proved to be valid is as strong as possible? I introduced two precisifications of when an argument is as strong as possible, each with an associated definition of a proof that contains no irrelevancies, calling them respectively perfectly valid sequents and perfect proofs, and gauntly valid sequents and gaunt proofs. The prequel paper showed how any classical or constructive proof can be inductively transformed into a perfect proof by a method I called coarsening of proofs. In this paper I will adapt the method of coarsening to show how a constructive proof can be transformed into a gaunt proof. I show by example, however, that this feature does not hold of classical logic, as there are classically valid sequents with no gauntly valid natural deduction proofs.

I will present and discuss the key definitions below, but for more thorough background, including references and precedents, I refer the reader to the prequel paper.

2 Preliminaries

I present the key technical definitions and discuss their philosophical motivation before presenting the rules of core logic, which I use as the tool for studying intuitionistic natural deductions.

2.1 Technical definitions

In what follows I will use the convention that Φ,Ψ,... are metavariables ranging over sets of formulas, ϕ,ψ,... are metavariables ranging over formulas, and A,B,... are metavariables ranging over atoms.

A sequent, as I will understand it here, is an ordered pair Δ:Φ of sets of sentences in a given language. Since I will be working in a natural deduction setting, and natural deduction proofs have at most one conclusion, Φ will be at most a singleton. The absurdity symbol is treated merely as a punctuation device in proofs, not a formula itself; hence, a natural deduction proof of from Δ is really a proof of the zero-conclusion sequent Δ:. We say Δ:Φ is a subsequent of Δ:Φ iff ΔΔ and ΦΦ; if either of these inclusions is proper, then Δ:Φ is a proper subsequent.

I will be primarily concerned with intuitionistic validity. As usual, Δ:Φ is valid if every Kripke model that makes every member of Δ true at every world also makes at least one member of Φ true at every world.

Let us now recall the two definitions of what counts as a proof with no irrelevancies or detours.

 

Definition 1
(Perfect validity; perfect proofs).

A sequent Δ:Φ is perfectly valid iff it is valid but has no proper subsequent that is valid. A proof Π is a perfect proof iff every subproof, including Π itself, is a proof of a perfectly valid sequent.

The second way to precisify the idea of a proof with no irrelevancies or detours is based on the notion of gaunt validity, which in turn requires an auxiliary definition:

 

Definition 2
(Coarsening).

A sequent Δ:Φ is a coarsening of Δ:Φ iff there is a uniform substitution σ (that is, a mapping from atoms to formulas) such that σ(Δ)=Δ and σ(Φ)=Φ.

A coarsening Δ:Φ of Δ:Φ is trivial just in case the mapping σ that gives σΔ=Δ and σΦ=Φ is a one-one mapping of atoms to atoms. Thus, a trivial coarsening is a mere relettering. Note that if σ maps all the atoms in Δ to other atoms it will be considered non-trivial provided it is not one-one.

 

Definition 3
(Gaunt validity, gaunt proofs).

A sequent Δ:Φ is gauntly valid iff it is perfectly valid and has no non-trivial coarsening that is perfectly valid. A proof Π is a gaunt proof iff every subproof, including Π itself, is a proof of a gauntly valid sequent.

 

Remark 1

One might wonder whether the definition of gaunt validity could be simplified so as to require only that Δ:Φ be perfectly valid and have no non-trivial coarsening that is valid (not necessarily perfectly valid).1 This alternative definition will not do, however, as it would trivialize the notion. If δ1,...,δn:ϕ/ is perfectly valid and A is a new atom, then δ1,...,δn,A:ϕ/ is a valid proper coarsening of the original sequent, as witnessed by the substitution σ:Aδn.

The last technical definition we need is that of a c-variant:

 

Definition 4
(c-variant).

A formula ϕc is a contraction-variant of ϕ (or c-variant, for short) iff ϕ can be obtained from ϕc by successively replacing occurrences of ψψ with ψ or replacing occurrences of ψψ with ψ.

 

Example 1

The following are each c-variants of AB:

  • A(BB)

  • (AB)(A(BB))

  • ((AA)B)(AB).

Note that being a c-variant is a transitive relation. Moreover, if ϕc is a c-variant of ϕ then ¬ϕc is a c-variant of ¬ϕ, and ϕcψ is a c-variant of ϕψ, and ψϕc is a c-variant of ψϕ, where is any of the binary connectives.

The motivation for the notion of a c-variant is technical rather than philosophical in nature. Despite this, the definition is not devoid of all philosophical significance, since a formula is trivially equivalent to its c-variants, and c-variance could be offered as a reasonable explication of synonymy in propositional logic.

2.2 Philosophical remarks

As mentioned at the beginning, the guiding question behind this paper and its prequel is whether it is possible, given a natural deduction proof, to transform that proof into one which is as strong as possible and which contains no irrelevancies. A natural way to understand relevance in formal logic is based on the idea that a constituent of a sequent is relevant when it contributes something to the validity of that sequent.2 This leads to perfect validity and gaunt validity as formal explications of relevance. A perfectly valid sequent is one in which each premise/conclusion not only contributes something to the validity of the sequent, but indeed is essential for the validity of the sequent. The concept of gaunt validity presents itself when we ask not only whether a premise/conclusion contributes to the validity of a sequent, but also whether the internal syntactic structure of a premise/conclusion contributes to the validity of the sequent. For instance, take the sequent AB:AB. On the one hand, each premise/conclusion is necessary for this sequent to valid—delete either the premise or conclusion, and the result would be an invalid sequent. On the other hand, the internal syntactic complexity of the premise and conclusion is irrelevant to the validity of the sequent. We could just as well have regarded this as an instance of the valid sequent C:C. A gauntly valid sequent captures the ideal of relevance insofar as each premise/conclusion and their internal syntactic structure is essential for the validity of the sequent in question.

Given these two formal explications of relevance, then, it is simple to define a proof that contains no irrelevancies. If we work with the explication of relevance as perfect validity, then a proof with no irrelevancies should be a proof that takes no detours through imperfection: every sequent proved as part of the overall proof should be perfectly valid. In other words, every subproof should be a proof of a perfectly valid sequent. Likewise, if we work with the explication of relevance as gaunt validity, then a proof with no irrelevancies should be a proof in which every sequent proved along the way is gauntly valid. Hence, the definitions of perfect proof and gaunt proof.

The resulting definitions of perfect proof and gaunt proof, however, end up being hybrid semantic-syntactic notions, turning as they do on both the syntactic definition of proofhood and the semantic definition of perfect validity. And for gaunt proofs the situation is doubly hybrid. The definition of gaunt validity itself is a hybrid syntactic-semantic notion, involving both the syntactic concept of a coarsening and semantic concept of validity; and then the definition of gaunt proof turns on the syntactic definition of proofhood and the syntactic-semantic hybrid notion of gaunt validity.

Given the overall proof-theoretic orientation, one might wonder why the key concepts need to be given in hybrid syntactic-semantic terms. Wouldn’t it be more natural and elegant to provide a proof-theoretic criterion for a proof with no irrelevancies?3 We could call them syntactically-perfect proofs and syntactically-gaunt proofs, say; and then we could try to prove standard soundness and completeness results of the form: every perfectly valid sequent has a syntactically-perfect proof, and every syntactically-perfect proof is a proof of a perfectly valid sequent (and mutatis mutandis for gaunt in place of perfect). Why not take this route?

This alternate route certainly has some attractions from a proof-theoretic point of view, and it has the potential to yield fruitful results. We can even interpret the results of [2] through this lens. The coarsening of proofs, as applied in that paper, turned on four basic ideas:

  1. Leaf nodes that are not MPEs can be restricted to be atoms.

  2. When an inference such as I introduces a new formula that does appear previously in the proof, that (sub)formula can be coarsened to an atom.

  3. When a rule such as E or I has parallel subproofs, those subproofs can be relettered to be atom-disjoint.

  4. Aside from CR, every rule that discharges formulas can be restricted to discharging a single instance of each formula.

The method of coarsening involved inductively working downward through a proof-tree to transform an arbitrary (classical) core proof into a (classical) core proof satisfying these conditions, with certain tightly constrained exceptions. (For instance, in the uniform-conclusion version of E, we interpolated a step of I that does not conform with condition 2 as just stated.) But the exceptions are all made precise and the essential point remains that we have a syntactic characterization of proofs that suffices for their being perfect proofs.

So there are two potential methodologies before us. On the first hand, we could begin with a syntactic property of natural deductions and then prove that such deductions are all and only the perfect/gaunt proofs. On the second hand, we can begin with the hybrid semantic-syntactic properties of being a perfect proof or a gaunt proof and then find a method of transforming arbitrary natural deductions into perfect/gaunt proofs. The way that we were able to coarsen proofs in the prequel can be fairly naturally seen as falling under either approach, while the proof-transformational work in the present paper falls more clearly under the second methodology rather than the first.4 But irrespective of which methodology we adopt, the definitions of gaunt proof and perfect proof are well-motivated and retain their conceptual significance.

This becomes especially apparent when we consider the first-order case, because no decidable syntactic condition can winnow the proofs down to exactly the perfect proofs.

 

Proposition 1

Let L be either classical or intuitionistic first-order logic. Then there is no decidable property P such that an L-proof Π has P iff Π is a proof of a perfectly valid sequent.

 

Proof.

Note that if there were such a property P, then the perfectly valid sequents of L would be computably enumerable (c.e.). For any formula ϕ, and A an atom not occurring in ϕ, the sequent ϕ:ϕA is perfectly valid iff ϕ is satisfiable. So if the perfectly valid sequents are c.e., then satisfiability is c.e. But since unsatisfiability is also c.e., this contradicts the undecidability of L.

(It is natural to expect that this result carries over also to gaunt validity. The proof given here, however, does not apply to gaunt validity, since ϕ:ϕA is gauntly valid only if ϕ is an atom B. For now, the analogous claim about gaunt validity remains a conjecture.)

The decidability of perfect validity in propositional logic allows for the possibility of giving a purely syntactic condition on proofs that coincides with perfect proofhood. But the impossibility of doing so for first-order logic assures us that perfect proofhood (and presumably also gaunt proofhood) cannot be conceptually reduced to a purely syntactic form. We are unavoidably left with the hybrid semantic-syntactic notions of perfect proofhood and gaunt proofhood given above.

2.3 Core logic

Core logic has the following rules of natural deduction. The vertical dots indicate the possible occurrence of further proofwork, and where these are missing it is understood that the node in question must be a leaf-node in the prooftree. In particular, major premises of eliminations (MPEs) are not allowed to have any proofwork above them. Also, vacuous discharge is not allowed in any of the rules: the premises to be discharged must really have been used.

  • graphic

  • graphic Here either ϕ, ψ, or both may occur as premises in the rightmost subproof.

  • graphic

  • graphic Here either θ or may occur as the conclusion of each subproof. If one or both subproofs end in θ, then the conclusion of the rule is θ, and if both subproofs end in , then the conclusion of the rule is .

  • graphic

  • graphic

  • graphic

  • graphic

To obtain classical core logic, we add the rule of classical reductio:

  • graphic

By a straightforward induction on the length of proof, one can establish that core logic has the subformula property.

 

Theorem 1

If Π is a proof of Δ:Φ in core logic, then every formula occurring in Π is a subformula of some member of Δ,Φ.

The notion of a subproof will be essential for what follows:

 

Definition 5
(Subproof).

If Π is a prooftree and n is a node in Π, the subtree of Π above n is a subproof of Π iff n is not a major premise of an elimination (MPE).

A proof of a sequent Δ:ϕ is a proof with conclusion ϕ whose undischarged premises are exactly the members of Δ. A proof of Δ: is a proof with conclusion whose undischarged premises are exactly the members of Δ. Note that, while a sequent is just a formal object, which may be valid or invalid, Δϕ is an assertion that there is a proof of ϕ whose premises are among Δ.

The use of core logic to study intuitionistic validities is legitimated by the following theorem of Tennant’s.

 

Theorem 2

If, intuitionistically, ΔΦ, then for some subsets Δ0Δ and Φ0Φ, there is a core proof of Δ0:Φ0. Moreover, there is an algorithm for extracting a core proof of Δ0:Φ0 from an intuitionistic proof of Δ:Φ.

(For a comprehensive survey of core logic, including a proof of this theorem, see [5].) This theorem also entails that every intuitionistically perfectly valid sequent, and hence every intuitionistically gauntly valid sequent, is core provable. Thus, every step in a perfect or gaunt proof will be acceptable by the lights of the core logician. In that sense, perfect or gaunt proofs of intuitionistic validities must themselves be core proofs, whether or not they are explicitly presented in the natural deduction system for core logic. In this paper I do work explicitly in the natural deduction system for core logic.

3 Challenges to Finding Gaunt Coarsenings

As we saw in the prequel, the method of coarsening proofs turns on four simple ideas. First, any leaf node that is not an MPE can be coarsened to an atom, and from there we work our way downward through the proof.

Second, any time a new (sub)formula gets introduced, which does not appear previously in the proof, it can be coarsened to a new atom. For instance, suppose we take a proof Π:

If we apply the coarsening down through Π0 to obtain a proof Π of Δ:ϕ, then at the step of I, we coarsen ψ to an atom B that does not occur elsewhere in the proof, giving us a the coarsened proof Π of Δ:ϕB.

Third, any parallel subproofs can be relettered to be atom-disjoint. This relettering is then propagated to the conclusion and/or MPE of the rule. For instance, say we have an instance of E:

If we have coarsened Π1 and Π2 so they are respectively proofs of Δ:ϕ and Δ2,ψ:θ, and we have ensured that these proofs are atom-disjoint, then propagating this coarsening through the E gives us:
In the prequel, there was one exception to the general rule that parallel subproofs be atom-disjoint, which concerned uniform-conclusion applications of E. In that case, if we started with a proof:
Then coarsening Π1 and Π2 would give us two atom disjoint proofs of Δ1,ϕ:θ1 and Δ2,ψ:θ2, but where θ1 and θ2 are distinct because of the assumption of atom-disjointness. In order to apply E, then, we would insert a step of I:
The result is now a proof of a coarsened c-variant of θ.

The fourth and final idea is based on the observation that, when we begin with a proof Π and apply these coarsening procedures downwards from the leaf nodes, we may reach an E-rule that discharges multiple occurrences of ϕ in Π, but where those occurrences ϕ have now been coarsened to distinct formulas ϕ1,....,ϕn. When this arose, we appended n instances of E, so that we had a proof with one undischarged assumption ϕ1...ϕn rather than n distinct undischarged premises ϕ1,...,ϕn. Then the E-rule in question can be applied discharging the conjunction ϕ1...ϕn. For instance, suppose we started with a proof of the form:

In the coarsening procedure, the two instances of ξ will get coarsened to distinct formulas ξ1 and ξ2, so we cannot discharge them both with the instance of E on ξζ. In that case, we inserted a new instance of E as follows (step (ii)):
The result is a proof with the coarsened c-variant (ξ1ξ2)ζ as a premise in place of the original premise ξζ.

These four ideas sufficed to ensure that the coarsening procedures yielded perfect proofs. Several obstacles arise, however, when we try to adapt the method of coarsening to yield gaunt proofs. There are four problems we need to confront. In the remainder of this section I will present the problems and indicate their solutions. Then in the next section I will rigorously present the coarsening procedures that incorporate those solutions and that suffice for finding gaunt proofs.

3.1 Disjunction elimination

The first problem comes from the uniform-conclusion version of E. As we saw above, if an instance of E has two subproofs of Δ1,ϕ:θ and Δ2,ψ:θ, then these will get coarsened to Δ1,ϕ:θ1 and Δ2,ψ:θ2. Then we inserted an instance of I to obtain proofs of Δ1,ϕ:θ1θ2 and Δ2,ψ:θ1θ2. But unless θ2 is a new atom, Δ1,ϕ:θ1θ2 will not be gauntly valid (and likewise for righthand subproof). Thus, the coarsening procedure that sufficed for finding perfect proofs will not suffice for finding gaunt proofs.

The resolution of this problem is simple. We can add a new version of E to the rules of core logic:

Obviously, adding this rule is a trivial modification of the proof system and does not change the logic. Moreover, we can assume that this rule only appears in coarsened proofs; so that when we start with a proof Π that we want to coarsen, Π does not contain this modified rule. Now in coarsening core proofs that have an application of uniform conclusion E, we can apply this modified form of E.

3.2 Conjunction elimination

Here, the fundamental problem stems from a simple observation:

 

Proposition 2

If Δ,ϕ,ψ:Φ is gauntly valid, then Δ,ϕψ:Φ is not gauntly valid.

 

Proof.

If Δ,ϕ,ψ:Φ is gauntly valid, then Δ,ϕψ:Φ is obviously valid—and indeed perfectly valid—but it has the perfectly valid proper coarsening Δ,ϕA,Bψ:Φ, where A and B are new atoms.

This problem manifests in two different ways. The first is when a proof has an instance of E where both the conjuncts occur as premises in the subproof to be discharged. This is easy to accommodate, however, by including two separate instances of -E to discharge the two separate premises.

The second way this problem manifests is when originally a rule R discharged multiple occurrences of the same premise ξ, but those different occurrences have been coarsened to distinct formulas ξ1,...,ξn in the coarsening procedure. As described above, the method for dealing with this was to intercalate n1 steps of E, discharging each ξi and resulting in a new premise ξ1...ξn that may be discharged by the rule R. The problem, of course, is that those instances of E will not preserve gauntness. To resolve this problem, we will again need to add generalized versions of the rules of core logic. Specifically, we want to add modified versions of ¬I, I, and E, each of which is roughly dual to the modified version of E introduced above.

The modified ¬I will be:5  

Analogously, the modified I will be:
And the final modified version of E will be:
It is again obvious that this amounts to a trivial modification of the proof system and does not change the logic. As with the modified E rule above, we can assume that these modified rules do not appear in the original proofs to which we apply the coarsening procedures.

 

Remark 2

In the remainder of this paper, unless otherwise explicitly stated, we will be working with proofs in core logic supplemented with the generalized versions of E, ¬I, and I just provided. In particular, the coarsening procedures detailed below will never take us outside the space of core proofs.

3.3 Negation rules

When we were only aiming to find perfect proofs, the treatment of negation was trivial. Given a proof with a negation rule in it, it sufficed to take the main subproof, coarsen it, and then apply the same negation rule. But while the negation rules preserved perfect validity, there is no guarantee that they preserve gaunt validity. For instance, ¬¬¬A:¬A is gauntly valid; but an instance of ¬E would give a proof of ¬¬¬A,¬¬A:, which has the valid proper coarsening ¬B,B:. Conversely, ¬B,B: is gauntly valid, but an instance of ¬I would give a proof of ¬B:¬B, which has the gauntly valid coarsening C:C.

Addressing this problem will not require any new rules. As I will explain in the next section (and prove in the sections after that), we can give an analysis of exactly when the negation rules fail to preserve gauntness. This analysis will then also provide a coarsening procedure that applies when the negation rules do not preserve gauntness.

3.4 Circuitous E- and I-rules

The final problem arises from the way that E-rules and I-rules can be combined to create circuitous proofs such as the following two examples (note that the example on the left uses our new, generalized version of E):

This also will not require any new rules, but will simply require some care in how the coarsening procedures are defined. I turn now to that task.

4 Coarsening Procedure for Gaunt Proofs

In this section I present the coarsening procedures which will yield gaunt proofs. As before, in order to coarsen a proof Π we begin at the leaf nodes that are not MPEs, coarsening each such formula to an atom A, and successively work our way down the proof tree. The remaining steps then show how to inductively coarsen subsequent steps in Π. The main theorem will then follow by an inductive argument checking that each of these operations preserves gaunt validity.

In that inductive argument, I will often appeal to the following fact without mention.

 

Proposition 3

If ϕ is a coarsening of ϕ, then either ϕ is an atom, or ϕ and ϕ have the same main connective.

Several other facts will also be useful.

 

Proposition 4

If ΔA, then either Δ or A has some occurrence in Δ that is not in the scope of a negation or in the antecedent of a conditional.

 

Proof.

By induction on the length of proof in core logic, we can show that there is a core proof of Δ:A only if A has some occurrence in Δ that is not in the scope of a negation or the antecedent of a conditional. The basis step of this induction is straightforward. For the induction step, we know that the last rule applied cannot be ¬E or an I-rule, because A is an atom. This leaves only E, E, and E; each of these cases follows easily from the i.h.

Now by Theorem 2, we know that if Δ is consistent and ΔA, then for some Δ0Δ there is a core proof of Δ0:A.

 

Proposition 5

If Δ,ψB:ϕ is perfectly valid, where is any binary connective and B is an atom not occurring elsewhere in the sequent, then a coarsening Δ,(ψB):ϕ can be valid only if it is of the form Δ,ψB:ϕ. Likewise for a perfectly valid sequent Δ:ϕB.

 

Proof.

Given a perfectly valid sequent Δ,ψB:ϕ as in the proposition, suppose that Δ,(ψB):ϕ is a valid coarsening under the substitution σ. Suppose for reductio that (ψB) is an atom C. Then C cannot occur elsewhere in Δ or ϕ; for if it did, then there would be an instance of B in σ(Δ)=Δ or in σ(ϕ)=ϕ, and this contradicts the assumption that there are no instances of B in Δ or ϕ. But if C does not occur elsewhere in the sequent, then Δ:ϕ would be valid. Hence taking the substitution under σ would give Δ:ϕ, which would be valid. This contradicts the assumption that Δ,ψB:ϕ is perfectly valid.

Finally, as we define the various coarsening procedures, we will want to verify that the following property holds:

 

Lemma 1

Suppose Π is a gaunt proof of the sequent Δ:Φ obtained by applying the coarsening procedures to a proof Π. Then:

  1. Every atom has at most two occurrences in Δ:Φ.

  2. If ϕ:=ψθ occurs in some member of Δ, where is any binary connective, then either

    • (i) one of ϕ, ϕχ, or ¬ϕ occurs in Π as an MPE; or

    • (ii) ϕ is a conjunction θ1...θk, where the θi’s are all coarsened c-variants of a single formula θ from Π.

  3. If an undischarged premise ϕ in Π gets coarsened to distinct formulas ϕ1,...,ϕn in Π, then each ϕi and ϕj are atom-disjoint.

 

Proof.

All three claims will follow by induction on the height of Π. We will check this with each of the coarsening procedures defined below.

In defining the coarsening procedures, we will want to pay special attention to the possibility that a discharged formula ϕ has been coarsened to multiple distinct formulas ϕ1,...,ϕn.

4.1 Disjunction

Suppose the last rule in Π is I, with immediate subproof Π0 of Δ:ϕ. Then we have the coarsened proof Π0 of the gauntly valid sequent Δ:ϕ. Letting B be a new atom not occurring elsewhere in Π0, we define the coarsening Π of Π to be:

Because B is a new atom, it is easy to see that Δ:ϕB will be gauntly valid, and also that Lemma 1 holds.

Suppose that the last rule in Π is E, with MPE ϕψ and two main subproofs Π1 of Δ1,ϕ:θ/ and Π2 of Δ2,ψ:θ/. We have coarsened proofs Π1 and Π2 of, respectively, Δ1,ϕ1,...,ϕn:θ1/ and Δ2,ψ1,...,ψm:θ2/, where Π1 and Π2 are atom-disjoint.

Now (A) define the coarsening Π of Π to be:

Unless, (B) the open instances of ϕni+1,...,ϕn in Π1 occur as premises in successive I’s:
(Or likewise for some premises ψmj+1,...,ψm in Π2.) In this case we trim these I’s from Π1 to obtain a proof Π1t of Δ,ϕ1,...,ϕni,ϕni+1...ϕn:θ1/. Let Π1 be the coarsening of Π1t (and likewise for Π2, if applicable). Note that the conjunction ϕni+1...ϕn will coarsen to an atom A1 in Π1. Then define the coarsening Π of Π as displayed in Figure 1:

The coarsening $\varPi ^{\prime}$ in Case (B) for a proof $\varPi $ that ends in $\vee $E.
Figure 1.

The coarsening Π in Case (B) for a proof Π that ends in E.

The proof $\varSigma $ referred to in Remark 3. $I:=\lbrace 1,...,n\rbrace $.
Figure 2.

The proof Σ referred to in Remark 3. I:={1,...,n}.

It is easy to verify that Lemma 1 holds. It is also clear that, whether we are in case (A) or case (B), the resulting sequent will be perfectly valid. It remains to show that the relevant sequent is gauntly valid.

Suppose that the sequent
(⋆)
has a valid proper coarsening. Because the two parallel subproofs are atom-disjoint, any valid coarsening of () would induce a proper coarsening of either
(⋆1)
or
(⋆2)
Focus on (1); the same argument applies mutatis mutandis to (2). By hypothesis, we know that Δ1,ϕ1,...,ϕn:θ1 is gauntly valid, so any valid proper coarsening of (1) would have to be of the form:
(where possibly i=n). This in turn requires that ϕni+1...ϕn occurs somewhere else in either Δ1 or θ1. Moreover, by Lemma 1 (1), this is the only other place in Δ1,θ1 where any atom from ϕni+1,...,ϕn will have an occurrence. Furthermore, letting σ:A1(B1...Bi), it follows that
is valid, and hence so is:
But this would be a valid proper coarsening of Δ1,ϕ1,...,ϕn:θ1, unless it was a mere releterring. Thus, ϕni+1,...,ϕn must all be atoms. It follows that ϕni+1,...,ϕn must be premises of I. They cannot be MPEs if they are atoms. They also cannot be premises of I-rules other than I, because the conclusion of that I-rule would have to be subformula of Δ, but we know that the only occurrences of any of the atoms in ϕni+1...ϕn are in the occurrences of ϕni+1...ϕn. For the same reason ϕni+1,...,ϕn cannot occur as minor premises of E or ¬E. Thus, if there were a valid proper coarsening of (1), then we would be in Case (B), and the coarsening procedures would have us trim out the unnecessary conjunction ϕni+1...ϕn. This would give a proof of Δ1,ϕ1...ϕniA1:θ1, which, after applying the instance of E, would yield a proof of
as required.

 

Remark 3

We have noted that the possibility of having a premise ϕ get coarsened to distinct premises ϕ1,...,ϕn requires that we include this modified E rule that discharges multiple premises ϕ1,...,ϕn with an MPE of the form Θ(ϕ1...ϕn). Observe, however, that we can assume that this only occurs in one of the subproofs of E. If we have two proofs Π1 of ψ1,...,ψm:θ1 and Π2 of ϕ1,...,ϕn:θ2, then (when σ2,...,σm are distinct reletterings), we can insert m steps of E to obtain the proof Σ displayed in Figure 2.

Most of the time this will not be necessary, but in the arguments of Section 5 it will be convenient to assume that E-rules only discharge a single premise in certain subproofs.

4.2 Conjunction

Suppose the last rule in Π is I, with immediate subproofs Π1 of Δ1:ϕ and Π2 of Δ2:ψ. Then we have coarsened proofs Π1 and Π2 of the gauntly valid sequents Δ1:ϕ and Δ2:ψ, which we can assume to be atom-disjoint. Define the coarsening Π to be:

Because Π1 and Π2 are atom-disjoint, it is easy to see that Δ1,Δ2:ϕψ will be gauntly valid. It is also easy to check that Lemma 1 holds.

Suppose next that the last rule in Π is E, with MPE ϕψ and main subproof Π0 of Δ,ϕ,ψ:θ. We have the coarsened proof Π0 of Δ,ϕ1,...,ϕn,ψ1,...,ψm:θ. If B1,...,Bn+m are new atoms, define the coarsening Π to be:

The fact that the Bi’s are new atoms ensures that the result will be gauntly valid, and it is easy to check that Lemma 1 holds.

4.3 Implication

Suppose the last rule in Π is I, with conclusion ϕψ. Recall this rule can take three forms, according to whether the immediate subproof Π0 is of Δ:ψ or Δ,ϕ: or Δ,ϕ:ψ. In the first case we know that there will be a coarsened proof Π0 of Δ:ψ. Then if B is a new atom, define the coarsening Π to be:

The fact that B is a new atom ensures that the resulting sequent is gauntly valid. Lemma 1 continues to hold.

In the second and third cases, we know there will be a coarsened proof Π0 of either
Then (A) define Π to be:
Unless, (B) the open instances of ϕni+1,...,ϕn in Π0 occur as premises in -I:
In which case we trim these I’s from Π0 to obtain a proof Π0t of
Letting Π0 be the coarsening of Π0t, we then define the coarsening Π of Π to be:
where the consequent is a new atom B if the main subproof has conclusion rather than ψ.

Unless, (C)  Π0 has the following form, where the conclusion ψ derives from an instance of E with MPE (ϕ1...ϕn)ψ:

In this case, delete the subproof ending in the topmost instance of E, and replace it with a leaf-node labelled (ϕ1...ϕn)ψ, and propagate this down through the E-rules. Then apply the coarsening procedures to this proof to obtain a proof of Δ:A, where Δ is the image of Δ under the substitution A(ϕ1...ϕn)ψ. Let this be the coarsening Π of Π.

In sum, in Case (A) we end up with a proof Π of Δ:(ϕ1...ϕn)ψ, where possibly ψ is a new atom B; in Case (B) we end up with a proof Π of Δ:(ϕ1...ϕniA)ψ, with Δ the pre-image of Δ under A(ϕni+1...ϕn); and in Case (C) we end up with a proof Π of Δ:A, with Δ the pre-image of Δ under A(ϕ1...ϕn)ψ.

It is easy to see that whichever of these sequents we end up with, it must be perfectly valid. Also, Lemma 1 is easy to verify. It remains to show that the relevant sequent does not have any perfectly valid non-trivial coarsening.

Suppose that Δ:(ϕ1...ϕn)ψ has a valid proper coarsening Δ:(ϕ1...ϕn1A)ψ. Then I claim that ϕni+1,...,ϕn must have occurred as premises in successive I’s in Π. To this end, note that ϕni+1...ϕn must occur in Δ. And by Lemma 1, we know that there must be exactly one such occurrence of ϕni+1...ϕn in Δ. Moreover, if
is valid, then so is
And thus, letting σ:A(B1...Bi), the following is also valid
But this would be a valid proper coarsening of Δ,ϕ1,...,ϕn:ψ, unless the substitution Bjϕni+j were a mere relettering. Thus, we know that each ϕni+j is an atom.

Observe that for ni+1jn, ϕj cannot occur as a minor premise in E or ¬E or as a premise in an I-rule other than I as above; for such rules would require there to be an occurrence of ϕj in Π other than as a conjunct in ϕni+1...ϕn, which we know is impossible. And we know that ϕj cannot be an MPE, since we have just noted that they must be atoms.

Thus, if Δ:(ϕ1...ϕn)ψ has a valid proper coarsening Δ:(ϕ1...ϕn1A)ψ, then Case (B) would have applied, and the relevant coarsening procedure would have given a proof Π of Δ:(ϕ1...ϕn1A)ψ.

On the other hand, suppose that Δ:(ϕ1...ϕn)ψ has a valid proper coarsening Δ:A. Then we know that (ϕ1...ϕn)ψ must occur in Δ; and by Lemma 1(1), there will be no other occurrences in Δ of any of the atoms from (ϕ1...ϕn)ψ. Furthermore, by Proposition 4, the instance of A in Δ, and hence the instance of (ϕ1...ϕn)ψ in Δ, will not be in the scope of a negation or in the antecedent of a conditional. So, by Lemma 1 (2), (ϕ1...ϕn)ψ must occur as an MPE in Π0. Now, because there are no other occurrences of any of the atoms in ψ, the discharged premise ψ cannot connect with any other rule in the proof, so it must simply descend via a series of E rules to the main conclusion ψ of Π0.

Observe that if σ:ABψ, and if Δc is the preimage of Δ under σ, then we also have that
is a valid coarsening of
albeit not gauntly valid. So the argument from Case (B) above applies again here, entailing that ϕ1,...,ϕn are all atoms that figure in successive I’s in Π0. Moreover, the only other member of Δ that this conjunction can connect with in Π0 is the MPE (ϕ1...ϕn)ψ.

So in Π0 we have ϕ1,...,ϕn descending through a series of I’s to the minor premise of E, with MPE (ϕ1...ϕn)ψ, and then the discharged consequent ψ descends via a series of E-rules to the conclusion of Π0. In sum, if Δ:(ϕ1...ϕn)ψ has a valid proper coarsening Δ:A, then Case (C) would have applied, and the relevant coarsening procedure would have given a proof Π of Δ:A as required.

This completes the treatment of I. Now turn to the case where Π ends in E with MPE ϕψ. Then we have coarsened proofs Π1 and Π2 of, respectively, Δ1:ϕ and Δ2,ψ1,...,ψn:θ. Let Π11,...,Π1n be n atom-disjoint copies of Π1. Define the coarsening Π to be:

It is easy to verify that Lemma 1 holds. The fact that this is a gaunt proof follows from the fact that all the subproofs are atom-disjoint, which itself is an application of Lemma 1 (3).

4.4 Negation

Suppose the last rule in Π is ¬I with an immediate subproof Π0 of Δ,ϕ:. We know this subproof will have a coarsening Π0. The coarsening procedure will be clearer to explain in two separate cases, according to whether ϕ has been coarsened to a single formula ϕ or to multiple formulas ϕ1,...,ϕn in Π0.

Suppose ϕ has been coarsened to a single formula ϕ in Π0. Then if Δ:¬ϕ is gauntly valid, define Π to be:

On the other hand, if Δ:¬ϕ is not gauntly valid, then we can appeal to the following fact. (The proof of this fact is quite involved, and will be provided in Section 5.)

Key fact: If Σ is a gaunt proof of Δ,ϕ: obtained by coarsening, but Δ:¬ϕ is not gauntly valid, then: (1) ϕ is an atom A, (2) Δ:A is gauntly valid, where Δ is the preimage of Δ under A¬A, and (3) by permuting steps in Σ we can obtain a gaunt proof Σp of Δc,A: such that Δc consists of coarsened c-variants of Δ and the final conclusion in Σp descends via a series of E-rules from an instance of ¬E with ¬A,A as premises.

In other words, Σp has the form:

Then if Δc is the result of replacing ¬A with A, define Π to be the proof of Δc:A as follows:
By definition, and in light of the fact cited above, it is clear that the result is a gaunt proof. And it is easy to check that Lemma 1 holds.

Consider now the possibility that ϕ was coarsened to ϕ1,...,ϕn in Π0. Then we can use the modified ¬I rule, so (A) define Π to be:

Unless (B)  ϕni+1,...,ϕn occur as premises in successive I rules above ϕni+1...ϕn. In that case, trim those I rules so that we have a proof of Δ,ϕ1,...,ϕni,ϕni+1...ϕn:. Now coarsen that proof, to obtain a proof Π0 of Δ,ϕ1,...,ϕni,A:. Now, if i=n, then we have a gaunt proof of Δ,A:, where ϕ has been coarsened to a single formula; so we apply the coarsening procedure from above. But if i<n, then ϕ has still been coarsened to multiple distinct formulas in Δ,ϕ1,...,ϕni,A:. Then, applying the modified ¬I rule, define Π to be:
In either case (A) or (B) is easy to check that Lemma 1 holds. It remains to show that the resulting sequent is gauntly valid. The argument for this is substantively the same as we have seen for the modified E and I rules above: if we suppose that the sequent Δ:¬(ϕ1...ϕn) had some valid proper coarsening, then that coarsening would have to be of the form Δ:¬(ϕ1...ϕniA). But that would only be possible if ϕni+1,...,ϕn figured as premises in successive I’s; in which case we would have applied the coarsening procedure from Case (B), resulting in a proof of the sequent Δ:¬(ϕ1...ϕniA) as required.

Finally, suppose the last rule in Π is ¬E, with immediate subproof Π0 of Δ:ϕ. We have the coarsening Π0 of Δ:ϕ. If Δ,¬ϕ: is gauntly valid, then define Π to be:

By assumption, this is a gaunt proof, and clearly Lemma 1 holds.

On the other hand, there are two ways that Δ,¬ϕ: can fail to be gauntly valid; to accommodate these possibilities we will need to define more complex proof transformations. The full details are relatively involved, so I postpone them until Section 6. For now, I will just illustrate the motivating concepts that lie behind those complicated proof transformations.

The first way that Δ,¬ϕ: can fail to be gauntly valid involves . For example:
is gauntly valid, but
is not gauntly valid, since it can be coarsened to ¬A,A:.

The second way that Δ,¬ϕ: might fail to be gauntly valid is similar, but featuring ¬ in place of . We know that ¬¬¬A:¬A is gauntly valid, but ¬¬¬A,¬¬A: is not gauntly valid since it can also be coarsened to ¬A,A:.

As we will see below in Lemma 9, these two examples illustrate all the possible ways that ¬E can fail to preserve gauntness. More concretely, if we have a gaunt proof of Δ:ϕ, but Δ,¬ϕ: is not gauntly valid, then there are some atoms B1,...,Bn+m and a substitution σ such that for 1in, σ:Bi¬Bi and for each 1im, there is some j such that σ:Bn+iC1i(C2i...(Cji¬Bn+i)...), and Δ,(¬ϕ): is gauntly valid, where Δ and (¬ϕ) are the respective pre-images of Δ and ¬ϕ under σ.

Now I will illustrate the essential idea behind the necessary proof transformations. We can argue that if Δ:ϕ has a gaunt proof Π, but that Δ,¬ϕ: is not gauntly valid, then ϕ must have an occurrence of ¬A or χ:=C1(...(Cj¬A)...), and that Π must have the form:

(The form of the uppermost proof of will depend on Δ1 and whether A or χ is among the premises. Explicit details will be given below.)

If we let Πj and Δj be the result of systematically coarsening ¬A to a new atom B, the essential idea is to rearrange Π into the following form, which will give us the gaunt proof Π that we seek.

This sketch of the coarsening procedure elides some important details, but it illustrates the main concept. Once again, the full details will be laid out in Section 6.

4.5 Main theorem

We have now provided all the coarsening procedures and verified that they preserved the property of being a gaunt proof, modulo the outstanding claims about negation. It remains to prove the key fact used in the case of ¬I and to fully describe the coarsening procedure for ¬E. The key fact for ¬I is proved in Section 5, and the complete treatment of ¬E is given in Section 6. Once these are in place, we will have established the main result of this paper:

 

Theorem 3

If Π is a core proof of Δ:Φ, then there is a gaunt core proof Π of Δ:Φ and a substitution σ such that σΔ consists of c-variants of members of Δ and σΦ is a c-variant of Φ. Π and σ may be obtained from the coarsening procedures defined above.

In the prequel paper, we saw that we could coarsen both classical and constructive core proofs to obtain perfect core proofs. When it comes to gaunt proofs, however, the method of coarsening only allows us to transform constructive core proofs into gaunt core proofs. The analogous result does not hold for classical core logic. One complication comes from CR. When coarsening an instance of CR whose discharged assumption ¬ϕ had been coarsened to multiple assumptions ¬ϕ1,...,¬ϕn, we had to insert a series of -I rules. Those will introduce non-gauntness into the proof in the same way that the intercalated I rules introduced non-gauntness. This complication can be avoided by introducing a generalized from of CR that applies to multiple assumptions at once, analogous to the modified ¬I and I rules we introduced above. The form of this modified CR rule would be:

This rule is clearly derivable in classical core logic, so adding it to the proof system would not change the deducibility relation.

A separate problem for coarsening classical proofs stems from strictly classical validities involving . It is this problem that proves insurmountable.

 

Theorem 4

There are classical gaunt validities that do not have gaunt proofs in the natural deduction system of classical core logic.

 

Proof.

Consider the sequent ¬AB,¬B:A. It is not difficult to see that any proof of this sequent must have ¬AB as an MPE. But then ¬A must be the minor premise, and this would constitute a non-gaunt subproof of ¬A:¬A. (It is worth noting that this proof does not depend on the fact that we have used CR as a strictly classical rule; so this limitation to classical core natural deduction still applies when we use another classical negation rule such as Dilemma.)

As an illustration, take an obvious classical core proof of this sequent:

This proof has the non-gaunt subproof of ¬A from ¬A in the proof of minor premise for -E.

On the other hand, there is reason to think that this limitation is particular to the natural deduction system of classical core logic. As Pierre Saint-Germier pointed out to me, there is a gaunt proof of ¬AB,¬B:A in a standard sequent calculus, such as Gentzen’s LK:6  

This raises the question of how robust the limitative result of Theorem 4 is. It shows a limitation to natural deduction. But is there a deductive system for classical logic in which every gaunt validity has a gaunt proof? I will not pursue this question here, but flag the issue for future work.7

For our purposes here, all that remains is to prove the facts appealed to in defining the ¬I coarsening procedure and to provide the full details of the proof transformations needed in the coarsening procedure for ¬E.

5 Negation Introduction

In this section I will prove the facts that I had relied on in defining the coarsenings of ¬I. First, we can characterize the sequents applied to which ¬-I fails to preserve gaunt validity.

 

Lemma 2

If Δ,ϕ: is gauntly valid, but Δ:¬ϕ is not gauntly valid, then ϕ is an atom A and Δ:B is the gauntly valid coarsening of Δ:¬A, where Δ is obtained from Δ by uniformly replacing B with ¬A.

 

Proof.

Assume Δ:¬ϕ is not gauntly valid, so there exists a substitution σ such that Δ:θ is a valid proper coarsening of Δ:¬ϕ under σ. Suppose θ is of the form ¬χ. Now, Δ:¬χ is valid only if Δ,χ: is valid; but then Δ,χ: would be a valid proper coarsening of Δ,ϕ:, contradicting the gaunt validity of Δ,ϕ:. So the main connective of θ cannot be ¬, and hence by Proposition 3, θ must be an atom B.

Let S be the set of atoms other than B that σ changed. Suppose S is non-empty and let σ agree with σ on S and be the identity map otherwise. Also let β:B¬ϕ and be the identity map otherwise. Without loss of generality, we can assume that ϕ does not contain any of the atoms in S. Then Δ=σ(β(Δ)). So if S is non-empty, then β(Δ),ϕ: would be a valid, non-trivial coarsening of Δ,ϕ: under σ, which is impossible.

Now suppose ϕ is not atomic, and break σ down into two substitutions: σ1:B¬C and σ2:Cϕ. Then σ1Δ,C: would be a valid proper coarsening of Δ,ϕ: under σ2, which again is impossible. Hence ϕ must be an atom A, and σ:B¬A.

Lemma 2 establishes claims (1) and (2) of the key fact we are trying to prove. The remaining part (3) requires us to provide our method for finding a gaunt proof in those instances where appending an instance of ¬I does not preserve gauntness, which we will do by showing how to appropriately permute rules in the proof. Before providing the necessary proof transformations, we will need several preliminary lemmas. To begin with, I record a simple lemma about when atoms are provable that will be useful later.

 

Lemma 3

Suppose Π is a gaunt coarsened proof of Δ,¬A:Φ, and that Π0 is a subproof of Π establishing Δ0,¬A:Φ0, but that Δ0,¬Φ0A. Then Δ,¬ΦA.

 

Proof.

Induction on the height of Π. The basis step is trivial, since any subproof of a one line proof Π would have to be Π itself.

The induction step is mostly straightforward; consider the last rule in Π.

Case 1: The last rule in Π is E. Say the MPE is ψB, with an immediate subproof of Δ,ψ,¬A:ϕ. Then Δ,ψB,¬ϕA only if Δ,ψ,¬ϕA, so the claim follows from the i.h.

Case 2: The last rule in Π is I. Say we have two immediate subproofs of Δ1,¬A:ϕ1 and Δ2:ϕ2. Then Δ1,Δ2,¬(ϕ1ϕ2)A only if Δ1,Δ2,¬ϕ1¬ϕ2A. Because parallel subproofs will be atom-disjoint, A will only occur in, say, Δ1,ϕ1. So then, because the two subproofs will be perfect, it follows that Δ1,Δ2,¬(ϕ1ϕ2)A only if Δ1,¬ϕ1A, and the claim follows from the i.h.

Case 3: The last rule in Π is E. This follows from the i.h. by appeal to the fact that parallel subproofs will be atom-disjoint. The argument is substantively similar to the case of I.

Case 4: The last rule in Π is I. This follows easily from the i.h. analogous to the case of E.

Case 5: The last rule in Π is ¬E. Say the MPE is ¬ϕ, with immediate subproof of Δ,¬A:ϕ. The claim is immediate from the i.h.

Case 6: The last rule in Π is ¬I. Say we have a proof of Δ,¬A:¬(iϕi) with immediate subproof of Δ,¬A,ϕ1,...,ϕn:. Now, Δ,¬¬(ϕ1...ϕn)A only if Δ,ϕ1,...,ϕnA, so the claim follows from the i.h.

Case 7: The last rule in Π is E. Say we have MPE ψθ and immediate subproofs of, say, Δ1,¬A:ψ and Δ2,θ:Φ. Now, Δ1,Δ2,ψθ,¬ΦA only if Δ1,Δ2,¬ψθ,¬ΦA. And by atom-disjointness, this can only hold if Δ1,¬ψA, so the claim follows by the i.h. The argument would be similar if we had assumed ¬A occurred in the main subproof rather than the minor subproof.

Case 8: The last rule in Π is I. If we have a conclusion iψiB, with B a new atom, then the argument is similar to the case of ¬I. If the conclusion is Bθ, then the argument is similar to I. So suppose the conclusion is (ψ1...ψn)θ, with immediate subproof of Δ,¬A,ψ1,...,ψn:θ. Now, Δ,¬((ψ1...ψn)θ)A only if Δ,ψ1,...,ψn,¬θA, so the claim follows from the i.h.

5.1 Preliminary lemmas

The main goal in this subsection is to show that, when we have a gaunt coarsened proof Π of Δ,δ:ψ, if Δ,¬¬δψ, then by permuting rules in Π we can obtain a gaunt proof Π of Δ,δ:ψ where δ occurs above a . The proof will consist of three lemmas, beginning with the longest and most involved.

 

Lemma 4

If Π is a gaunt coarsened proof of Δ,δ:ψ or Δ,δ,ψ: and respectively either Δ¬δψ or Δ¬δ¬ψ, then:

  1. some formula γ1γ2 occurs somewhere in Δ not in the scope of a negation or the antecedent of a conditional.

  2. γ1γ2 must occur as an MPE in Π.

  3. By permuting rules in Π we can obtain a proof Π such that for each δ and ψ as in the lemma there is an instance of E such that Π respectively has one of the following forms:

  4. Moreover, by permuting rules in Π we can ensure that Σc consists only of E-rules, and that when there is an E, γaγb stands above the main subconclusion rather than above the minor premise. So, in particular, if ψ1,...,ψn is the branch below ψ1, then each ψj is a main subconclusion of the respective E-rule; and ψj is either the same as ψj1, or, if the jth E-rule applied in this end segment is E with neither subconclusion equal to , then ψj will be either ψj1ξ or ξψj1, where ξ is the other main subconclusion of that instance of E. Thus, if ψ was a coarsened c-variant of some formula χ, then ψn is also a coarsened c-variant of χ (although ψ and ψn may not be identical).

 

Proof.

Claim (1) By induction on the height of a coarsened proof, we know that if there is no formula containing in Δ, then there is no instance of E in Π. And it is a classic fact about intuitionistic logic that if Δξζ, and there is no instance of in Δ not in the scope of a negation or the antecedent of a conditional, then Δξ or Δζ.8 So unless there were an instance of in Δ not in the scope of a negation or the antecedent of a conditional, Δ¬δψ would entail that either Δψ or Δ¬δ. And this would contradict the perfect validity of Δ,δ:ψ.

Claim (2) This follows from claim (1) by Lemma 1 (2).

Claims (3) & (4) can be proved simultaneously by induction on the height of Π. The basis case is trivial for both claims, since there is no one-line proof with an instance of E in it.

We now proceed to the inductive step in our proof of Claims (3) and (4). There are 8 cases according to the last rule in Π.

Case 1: The last rule in Π is I. For Claim (3) we are given two immediate subproofs Π1 of Δ1,δ:θ1 and Δ2:θ2. Since Δ1,Δ2¬δ(θ1θ2), we also know that Δ1,Δ2¬δθ1. And since Δ2 is atom-disjoint from Δ1,δ,θ1, it follows that Δ1¬δθ1. Thus, the claim follows by applying the i.h. to Π1.

For Claim (4), the i.h. gives us a proof of the following general form. (For space and generality in the following arguments I will often not display the MPEs of successive E rules; when I do this I will use double lined inferences with a left-label of E.)

Then when we permute the I upwards, we get the following, where Σ0i are ξi are distinct reletterings of Σ0 and ξ:
Note that if there are multiple δ’s satisfying the hypotheses of the lemma, this permutation can be performed simultaneously for all of them.

Case 2: The last rule in Π is E. Claim (3) is immediate from the i.h. Claim (4) is trivial in this case.

Case 3: The last rule in Π is I. For Claim (3), Π is a proof of Δ,δ:θA with an immediate subproof Π1 of Δ,δ:θ. By assumption, Δ¬δ(θA); and since A is a new atom it follows that Δ¬δθ. Thus the claim follows from the i.h.

For Claim (4), the permutation is substantively similar to the I case. We know that the newly introduced disjunct will be a new atom, so that the subproof ending with Ri will have conclusion (θ1...θm)A. Letting Ai be distinct new atoms, permuting the I upwards gives us a new subproof with conclusion (θ1A1)...(θmAm).

Case 4: The last rule in Π is E. For Claim (3) we have several sub-cases based on whether the main subconclusions are θi or .

Subcase 1: Π is a proof of Δ1,Δ2,δ,(ξ1...ξn)(ζ1...ζm):θ with subproofs Π1 of Δ1,δ,ξ1,...,ξn: and Δ2,ζ1,...,ζm:θ. Then the claim is immediate.

Subcase 2: Π is a proof of Δ1,Δ2,δ,(ξ1...ξn)(ζ1...ζm):θ with subproofs Π1 of Δ1,δ,ξ1,...,ξn:θ and Δ2,ζ1,...,ζm:. Given that Δ1,Δ2,(ξ1...ξn)(ζ1...ζm)¬δθ, we also know that Δ1,Δ2,ξ1,...,ξn¬δθ, and hence (by the atom-disjointness of the two subproofs) Δ1,ξ1,...,ξn¬δθ. Now the claim follows from the i.h.

Subcase 3: Π is a proof of Δ1,Δ2,δ,(ξ1...ξn)(ζ1...ζm):θ1θ2, with immediate subproofs of Δ1,δ,ξ1,...,ξn:θ1 and Δ2,ζ1,...,ζm:θ2. By assumption, Δ1,Δ2,δ,(ξ1...ξn)(ζ1...ζm)¬δθ1θ2; then it follows from atom-disjointness that Δ1,ξ1,...,ξn¬δθ1, and now the claim follows from the i.h.

Subcase 4: Π is a proof of Δ1,Δ2,δ,(ξ1...ξn)(ζ1...ζm): with immediate subproofs Π1 of Δ1,δ,ξ1,...,ξn: and Π2 of Δ2,ζ1,...,ζm:; and for some θΔ1,Δ2,ξiζi, we have that (Δ1,Δ2,ξiζi){θ}¬δ¬θ. We have two possibilities according to whether θ is ξiζi or is some other premise.

First suppose that θ is ξiζi. Given that Δ1,Δ2¬δ¬(ξiζi), we also have Δ1,Δ2¬δ¬ξi, and thus for each i, we have Δ1,{ξj}ji¬δ¬ξi. So by the i.h., for each i there is some formula γaiγbi such that we can obtain Π1 with the form:

Let Π2i be distinct reletterings of Π2. Then we can form the proof Π as required the claim by inserting an instance of E using the copy Π2i for each ξi:
(Note that if there are multiple δ’s satisfying the hypotheses of the lemma, this can be done simultaneously for each such δ in the prooftree.)

Second, suppose that θ is not ξiζi. If θΔ2, then the claim is immediate. On the other hand, if θΔ1, then as before we know that Δ1¬δ¬θ; now the claim follows from the i.h. This completes Claim (3) for this case.

Claim (4) is trivial in this case.

Case 5: The last rule in Π is ¬I. For Claim (3), Π is a proof of Δ,δ:¬(θ1...θm) with immediate subproof Π1 of Δ,δ,θ1,...,θn:. By assumption, Δ¬δ¬(θ1...θm), so for each i we have that Δ,{θj}ji¬δ¬θi. Then by the i.h., for each i there is some γaiγbi occurring a proof Π1 of the following form:

And by Claim (4) of the i.h., we know that below each such γaiγbi there are only E-rules. So for each such i, we can insert ¬I, giving us a proof of the following general form, satisfying both Claims (3) and (4):

Case 6: The last rule in Π is ¬E. For Claim (3), we have a proof Π of Δ,δ,¬ϕ: with immediate subproof Π1 of Δ,δ:ϕ. We need both to show that if Ĭ䬬ϕ, then there is some instance of E such that ¬ϕ can be permuted into subproof while δ occurs above a in the other subproof, and we need to consider the possibility that there other premises ψi such that Δ,¬ϕ¬δ¬ψi. We can consider in turn what the last rule in Π1 is.

  • If the last rule in Π1 is an E-rule, then we can permute the instance of ¬E above the E-rule; then we need to argue according to Case 2, 4, or 8 as appropriate.

  • If the last rule in Π is I, say with ϕ:=ξζ, then Π has the form:

    First note that, if there is a ψi as displayed such that Δ,¬(ξζ)¬δ¬ψi, then by atom disjointness we would have Δa,¬ξ¬δ¬ψi. So Claim (3) as applied to ψi would then follow by the i.h.; we now have to deal with ¬(ξζ) and any ψj that occur in the proof.

    First assume that Δa,Δb¬δ¬¬(ξζ). Then we also know that Δa,Δb¬δ¬¬ξ and hence (by atom disjointness) Δa¬δ¬¬ξ. Consider the following proof:

    Then we can, by the i.h., permute some E-rules to obtain the following proof of Δa,δ,ψi,¬ξ:, where Δa:=ΓaΓb{γaγb}. Moreover, the i.h. also ensures that ψi and δ will occur in separate subproofs of some instance of E, which may or may not be the same as the instance γaγb displayed here. (Accordingly, ψi could occur in any of the subproofs below, which is why it is not explicitly displayed).
    Thus, by inserting the subproof Π1b, we can obviously obtain a proof of Δa,Δb,δ,¬(ξζ): as follows:
    Then δ and ¬(ξζ) stand in opposite subproofs of E, as do δ and ψj (if there are such). And as we noted, the i.h. also guarantees that δ and ψi will also be in distinct subproofs of E, if there are any ψi’s.

    On the other hand, suppose that Δa,Δb¬δ¬¬(ξζ), but that there is some ψj in Π1b such that Δa,Δb,¬(ξζ)¬δ¬ψj. I claim that either Δa¬δξ or Δb¬ψjζ. If not, then we would have a countermodel Ma witnessing Δa¬δξ and a countermodel Mb witnessing Δb¬ψjζ; and we could piece them together to create a countermodel M witnessing Δa,Δb,¬(ξζ)¬δ¬ψj, as follows:9  

    But this contradicts our assumption. So we can suppose, without loss of generality, that Δb¬ψjζ. Then by the i.h. there is some MPE γ1γ2 in Π1b such that we have subproofs of γ1,ψj,Γ1: and γ2,Γ2:ζ. Then we can form the following proof, which has δ and ψj in separate subproofs of E, as required.

  • If the last rule in Π1 is I, then ϕ:=θA, where A is a new atom, and Π1 has the immediate subproof Π0 of Δ,δ:θ. Then we can consider the proof:

    And then we can appeal to the i.h., following the same pattern of argument as when Π1 ended with I.

  • If the last rule in Π1 is ¬I, then ϕ is ¬θ, with an immediate subproof Π0 of Δ,δ,θ:. Suppose Ĭ䬬ϕ; then, since ϕ:=¬θ, we also have Δ¬δ¬θ. Similarly, if there is a ψΔ such that Δ{ψ},¬ϕ¬δ¬ψ, then we also have Δ{ψ},θ¬δ¬ψ. So the claim follows from the i.h., applied to Π0.

  • If the last rule in Π1 is I, there are three possibilities according to the form of I used:

    The first of these cases is treated similarly to the I case. The second is treated analogously to the ¬I case. For the third case, inserting a ¬E would give a proof of Δ,δ,ξ,¬ζ:. (If there are any formulas ψ such that Δ,¬(ξζ)¬δ¬ψ, we can apply the i.h. to this shorter proof to establish the claim applied to ψ.)

    Now, if it holds that Ĭ䬬(ξζ), it also follows that Δ,ξ¬δ¬¬ζ. It likewise follows that Δ,¬ζ¬δ¬ξ. Hence, by appeal to the i.h., we know that there is a proof Σ of Δ,δ,ξ,¬ζ:, with ¬ζ an MPE, and where δ and ¬ζ and δ and ξ respectively stand in different subproofs of E. Consistent with the i.h., the premises ξ and ¬ζ may or may not occur in the same subproof of E, so that the overall form of Σ may be either of the following (using the convention of suppressing MPEs of E for space):

    Finally, we can insert I to obtain our desired proofs:

 
This shows how we can satisfy Claim (3), and we have implicitly also dealt with Claim (4). But to be explicit, for Claim (4) the i.h. gives us a proof of the form:
Then pushing the ¬E upwards gives us:
Case 7: The last rule in Π is I. We have three subcases depending on the version of I applied.

Subcase 1: We have a proof Π of Δ,δ:Aθ with an immediate subproof of Δ,δ:θ. By assumption, Δ¬δ(Aθ). But since A is a new atom, it follows that Δ¬δθ, so we get Claim (3) from the i.h., and Claim (4) is substantively similar to the case of I.

Subcase 2: We have a proof Π of Δ,δ:(ξ1...ξn)A with an immediate subproof of Δ,δ,ξ1,...,ξn:. By assumption, Δ¬δ((ξ1...ξn)A); and since A is a new atom it also follows that Δ¬δ¬(ξ1...ξn). Now Claim (3) follows by the i.h., arguing similarly to the case of ¬I above. Claim (4) is also substantively similar to the case of ¬I.

Subcase 3: We have a proof Π of Δ,δ:(ξ1...ξn)θ with an immediate subproof Π1 of Δ,δ,ξ1,...,ξn:θ. By assumption, Δ¬δ((ξ1...ξn)θ). This entails Δ,ξ1,...,ξn¬δθ. By the i.h., this entails that there is a E where δ stands in one subproof above a while θ is the conclusion of the other subproof.

Furthermore, consider also the proof that is like Π except that applies ¬E to the immediate subproof Π1:10  

Because we know that Δ¬δ((ξ1...ξn)θ), it also follows that for each i we have Δ,¬θ,{ξj}ji¬δ¬ξi. Thus, by the same argument as in the ¬E case above, we can infer that for each ξi there is a E, where ξi stands in one subproof and δ stands in the other subproof; the conclusion of ξi’s subproof may be either θ or .

Now to both finish Claim (3) and also establish Claim (4), we can permute the I rule upward according to the following process: (i) if ξi stands in a subproof Σj above a formula θj that is a main subconclusion of E, then infer ξiθj below that subproof, (ii) if ξi stands in a subproof that concludes with a as a subconclusion in an instance of E, then we infer ξiBi below that subproof, and (iii) if there is a subproof Σj above a formula θj, which is a main subconclusion of a rule of E, but none of the ξi’s occur in Σj, then infer Bjθj below the subproof Σj. For instance, suppose that we were given Π as follows:

Then applying our process for permuting this I upwards would yield the following proof:
Case 8: The last rule in Π is E. For Claim (3), we have a proof Π of Δ,δ,ϕθ:χ with immediate subproofs Π1 of Δ1:ϕ and Π2 of Δ2,θ:χ. Take two subcases, according to whether δ occurs as a premise in Π1 or in Π2.

Subcase 1: δ occurs in Π2. By assumption, Δ1,Δ2,ϕθ¬δχ; hence Δ1,Δ2,θ¬δχ. By atom-disjointness we have that Δ2,θ¬δχ, and then the claim follows from the i.h.

Subcase 2: δ occurs in Π1. Again we are given that that Δ1,Δ2,ϕθ¬δχ. On the one hand, if Δ1¬δϕ, then the claim follows from the i.h. Similarly, if Δ2¬θχ, then by the i.h. there is a proof Π2 of the form:

Then we can form the following proof, which satisfies Claim (3):
Now, however, if contrary to the above we have Δ1¬δϕ and Δ2¬θχ, then there will be a countermodel M1 such that M1Δ1 and M1¬δϕ and a countermodel M2 such that M2Δ2 and M2¬θχ. We can piece these together to make a countermodel M3 witnessing Δ1,Δ2,ϕθ¬δχ, which is a contradiction. Here is how we construct M3.

Start by taking M1 and adding to its root node every atom true at the root node of M2. Now, we know that M2 must contain a world v2 such that vθ, for otherwise M2¬θ. For any world w in M1 such that wϕ, make all the sentences true at v2 also be true at w. (This is possible because of atom-disjointness). So ϕθ will be true at the root world. Similarly, if there are any worlds w1 from M2 such that w1ϕ, then we can simply paste a copy of M2 below such w2. The result will then be our desired M3. On the other hand, we can assume that if there is no such world w1 in M1, then Δ1¬¬ϕ.11 In that case, we know that Δ2,¬¬θχ; for otherwise, we would have Δ1,Δ2,ϕθχ, which is impossible. Thus we can require M2 to be such that M2¬¬θ, and then paste a copy of M2 above every node v1 in M1 where v1ϕ. That can then serve as our model M3.

For Claim (4) if the MPE γaγb occurs in the main subproof, the result follows directly from the i.h. So we just need to show how, when the MPE γaγb occurs above the minor premise of the relevant E, we can permute this instance of E upwards. Suppose that in our permutations, the minor premise ϕ has become the coarsened c-variant ϕ1...ϕm, so the major premise is (ϕ1...ϕm)θ, with Π taking the following general form:

Then we permute the E into each of the Σi’s as follows, where each θi,Σ0i,χi are distinct reletterings of θ,Σ0,χ.
In the proof we started with, we had the MPE (ϕ1...ϕm)θ, which was a coarsened c-variant of ϕθ, itself a coarsening of some formula σ(ϕθ). In the new proof that results from this permutation we now have multiple distinct coarsenings ϕiθi as premises. The result is that instead of the simple conclusion χ we now have the disjunction χ1...χm, which is a c-variant of a coarsening of σχ.

 

Lemma 5

If Π is a gaunt coarsened proof of Δ,ϕ1ϕ2:ψ1ψ2, where the last rule is E with MPE ϕ1ϕ2 and main subproofs Πi of Δi,ϕi:ψi, and if Δ,¬¬(ϕ1ϕ2)θ1θ2, then either Δ1¬ϕ1θ1 or Δ2¬ϕ2θ2.

 

Proof.

First, observe that if Δ1,Δ2,¬¬(ϕ1ϕ2)θ1θ2, then also both Δ1,Δ2,¬¬ϕ1θ1θ2 and Δ1,Δ2,¬¬ϕ2θ1θ2. Thus, by atom-disjointness and the gaunt validity of the subproofs Π1 and Π2, we know that Δ1,¬¬ϕ1θ1 and Δ2,¬¬ϕ2θ2.

Now note that if Δi¬ϕi¬¬ϕiθi, then also Δi¬ϕiθi. So if Δi¬ϕiθi, then there would be a Kripke countermodel Mi where MiΔi but Mi¬ϕi and Mi¬¬ϕi and Miθi.

Suppose that for both i=1 and i=2 we have Δi¬ϕiθi. So we have two Mi’s with have a root node w at which Δi is true but none of ¬ϕi,¬¬ϕi,θi are true; and Mi will have at least one terminal node v at which ϕi is true and at least one terminal node u at which ¬ϕi is true. Pictorially, we have the two models:

And because Δ1,ϕ1,θ1 is atom-disjoint from Δ2,ϕ2,θ2, we can merge these two models together to form a countermodel to Δ1,Δ2,¬¬(ϕ1ϕ2):θ1θ2.
Thus, if both Δ1¬ϕ1θ1 and Δ2¬ϕ2θ2, then Δ,¬¬(ϕ1ϕ2)θ1θ2.

 

Remark 4

Note that after applying the coarsening procedures, instances of E and E will each only discharge a single leaf node. As a result, it is always permissible to assume that proofs obtained by coarsening have - and E applied as high as possible. This means that, if ψϕ or Aϕ are MPEs discharging ϕ, then either the main subproof of this rule is the trivial proof of ϕ:ϕ, or the main subproof of this rule ends in an E-rule with MPE ϕ.

 

Lemma 6

If Π is a gaunt coarsened proof of Δ,δ:ψ/, and if Δ,¬¬δψ/, then by permuting E-rules we can obtain a gaunt proof Π in which each such δ occurs above a .

 

Proof.

We can assume that E and E are applied as high as possible, as noted in Remark 4. We argue by induction on the height of Π. The base case is trivial, and the induction step breaks into the obvious 8 cases.

Case 1: The last rule in Π is I. In this case, the claim follows directly from the i.h.

Case 2: The last rule in Π is E. Given our assumption that any E is applied as high as possible, this case follows immediately from the i.h.

Case 3: The last rule in Π is I. This case also follows directly from the i.h.

Case 4: The last rule in Π is E. Suppose δ is not the MPE of the final E, so that Π is a proof of Δ1,Δ2,δ,iξijζj:θ1/θ1θ2/θ2, with the two immediate subproofs Π1 of Δ1,ξ1,...,ξn,δ:θ1/ and Π2 of Δ2,ζ1,...,ζm:θ2/. Without loss of generality, we can suppose that neither of these subproofs ends in , so that the overall conclusion of Π is θ1θ2. By assumption, we have that Δ1,Δ2,iξijζj,¬¬δθ1θ2. Then, since Π1 and Π2 will be atom-disjoint, it follows that Δ1,ξ1,...,ξn,¬¬δθ1. Now the claim follows from the i.h.

On the other hand, suppose that δ is the MPE (ξ1...ξn)(ζ1...ζm). If both subconclusions of the E are , then the claim is trivial. So assume we have a subproof Πi ending in θi.

First suppose that the subproof Π2 ends in θ2 and the other subproof Π1 ends in , and ψ:=θ2. Moreover, by Remark 3, we can assume that only one premise is discharged in Π2, so m=1. Also, if Δ1,Δ2,¬¬(ξiζ)θ2, then Δ2,¬¬ζθ2, so by the i.h., ζ must occur above a . So the form of the proof must be:

Now we can permute this E upwards to obtain the required proof Π in which ξjζj occurs above a :
On the other hand, suppose Π1 ends in θ1 and Π2 ends in θ2, so ψ:=θ1θ2. We can again invoke Remark 3 to assume that there is only one ζ discharged. And by Lemma 5, we know that either Δ1¬(iξi)θ1 or Δ2¬ζθ2. Without loss of generality, let it be the former. (The argument is substantively similar if it were the latter.)

Now we can apply Lemma 4, to find a proof Π1 that has the general form of the following prooftree. For space and generality, I will, as above, omit MPEs of subsequent E’s in Π1, putting in their place a left-label of E on a double-lined inference. Also, I will use Σi0 with a superscript for subproofs with one of the ξi’s above it (which will therefore have conclusion ) and I will use Σi’s with no superscript for subproofs above one of the subconclusions χi’s, where θ1:=χ1...χk.

We can also observe that if Δ1,Δ2,¬¬((ξ1...ξn)ζ)θ1θ2, then also Δ1,Δ2,¬¬ξ1,...,¬¬ξn,¬¬ζθ1θ2. And since Π1 and Π2 will be atom-disjoint, we also know that Δ2,¬¬ζθ2. So by the i.h., we can find a proof Π2 of Δ2,ζ:θ2 where ζ stands above a :
Now, for i=1,...,n, let Π22i1,Π22i,ζi,θi+1 be n distinct reletterings of Π21,Π22,ζ,θ2; then we can form our desired Π as follows:
Here, in place of the single premise (ξ1...ξn)ζ which is a coarsened c-variant of some premise ϕ from the original proof, we will instead have n distinct coarsened c-variants ξ1ζ1,...,ξnζn as premises. Likewise, instead of having as a conclusion (ξ1...ξn)θ2 where ξ1,...,ξn,θ are each coarsened c-variants of some formula ψ, which stood as the conclusion of the original proof we were coarsening, we now have a different coarsened c-variant of ψ, namely θ2χ1...θn+1χk (in some order). The resulting sequent proved, however, is still going to be a coarsened c-variant of the sequent proved by the original proof we started coarsening.

Case 5: The last rule in Π is I. First, suppose that the first form of I is applied, so that Π is a proof of Δ,δ:(ϕ1...ϕn)θ with an immediate subproof Π0 of Δ,δ,ϕ1,...,ϕn:θ. By hypothesis, we know that Δ,¬¬δ(ϕ1...ϕn)θ, and hence Δ,¬¬δ,ϕ1,...,ϕnθ. Hence, by the i.h., we can permute rules in Π0 to obtain a proof Π0 of Δ,δ,ϕ1,...,ϕn:θ in which δ stands above a . Then appending an instance of I will give the desired proof Π.

Next, suppose that the second form of I is applied, so that Π is a proof of Δ,δ:(ϕ1...ϕn)A, where A is a new atom, with an immediate subproof Π0 of Δ,δ,ϕ1,...,ϕn:. The claim is immediate.

Finally, suppose that the third form of I is applied, so that Π is a proof of Δ,δ:Aθ, where A is a new atom, with an immediate subproof Π0 of Δ,δ:θ. By assumption, Δ,¬¬δAθ; given that A is a new atom, it follows that Δ,¬¬δθ. Now the claim follows from the i.h.

Case 6: The last rule in Π is E. As with the E case above, the claim follows directly from the i.h. given our assumption that E’s are applied as high as possible.

Case 7: The last rule in Π is ¬I. Π has an immediate subproof Π0 with conclusion , so every premise in Π stands above a .

Case 8: The last rule in Π is ¬E. Then the conclusion of Π itself is , so every premise stands above a .

5.2 Proof transformations

We can now provide the proof transformations that will establish claim (3) of the key fact used in the coarsening procedure for ¬I from Section 4.4.

 

Lemma 7

Suppose we have a gaunt proof Π of Δ,A: obtained by the coarsening procedures applied to a proof of Δo,ϕ:, and suppose that Δ:¬A is not gauntly valid. Then there is a gaunt proof Π of Δc,A: such that the final conclusion in the proof descends via a series of E-rules from an instance of ¬E with ¬A and A as premises, and where Δc consists of coarsenings of c-variants of Δo.

 

Proof.

Clearly A cannot stand as an MPE. By Lemma 2, we know that A only occurs in Δ as its negation ¬A. But by the subformula property, if A were a premise of an I rule or a minor premise of E, then A would occur un-negated as a subformula in Δ. Thus, A must occur in Π in ¬E:

If the final concluding of Π descends from this rule, then we are done. Otherwise, there must be a rule lower down in Π with a premise descending from this application of ¬ E and a conclusion θ other than , so the general form of Π is:
Here Θ is the MPE where θn is the minor premise.

Furthermore, invoking Remark 3, we can assume that if there are any E below this leaf node A, then there is only one premise discharged in the subproof containing A.

Now the argument will proceed by an inductive measure on the branch through the prooftree below ¬A. Say the nodes in this branch are labeled ¬A,χ1,χ2,...,χk (where, by assumption, we know that both χ1 and χk are ). Then make the following definitions:

  • Let c be the number of pairs χi,χi+1 in this branch such that either χi= and χi+1 or χi and χi+1=. In other words, c is the number of times the branch in the prooftree below ¬A changes from having a to a formula or vice versa.

  • Let n be the largest number such that for some j<n, if ij then χi=, and if j<in then χi. In other words, n is the length of the branch down to the second block of ’s.

  • Let b be the largest number i such that χ1,...χi are all .

Thus, for instance, if the branch below ¬A is ,θ1,θ2,θ3,,, then c is 2, n is 4, and b is 1. If the branch below ¬A is ,,θ1,,,,ψ1,ψ2,,, then c is 4, n is 3, and b is 2. Now the argument proceeds by induction on the lexicographic ordering of the triple c,n,b.

There are three possibilities for the rule by which θ1 is inferred. (1) There is an application of ¬I. (2) There is an application of I. (3) There is an application of with one subconclusion and the other subconclusion θ. This gives us three main cases to deal with.

Main Cases 1 & 2: θ1 is either ¬(δ1...δk) or (δ1...δk)B, discharging the δi’s. Letting Π1 be the subproof immediately above θ1, we know that the last rule in Π1 is an E rule, so we can consider the four different E rules that may apply.

First, observe that the last rule of Π1 cannot be ¬E; if it were, we would have the following proof:

θ1(¬A) may be either ¬AB or ¬¬A. Either way, this means that if ΔA is the coarsening of Δ under the substitution A¬A, then ΔAA. In other words, Δ:¬A is gauntly valid, contrary to the assumptions of the lemma.

So let R1,...,Rm be the E, E, and E rules applied between the top ¬A,A instance of ¬-E and the introduction of θ1. We can further assume that each Ri discharges the MPE of Ri1; as noted before, we can always assume that E and E are applied as high as possible; and for any instance of E in this series, because it will only discharge one premise ϕ in the subproof with A and the other subproof will have conclusion , we can push this instance of E upward to occur immediately below the discharged ϕ.

Thus, letting χi be the MPE of Ri, the general form of Π1 will be:

Here each may any of , , or . Note that when is or there will be another subproof above the relevant E-rule, which is not displayed above. If is , there will be a minor subproof with conclusion ψi, and if is there will be a parallel subproof with premise ψi and conclusion . We may take Δi to the be the set of premises other than χi1,A that are open above the ith E-rule.

Now we can observe that none of the discharged formulas δi can be χm, i.e., ψmχm1. For if it were, then by the subformula property, θ1 will occur as a subformula in some member of Δ. Note that ¬A occurs in χm and hence in θ1. So by Lemma 1, A does not occur in any other member of Δ. Thus the only occurrence of A in ΔA is in the coarsened θ1A, and hence either in the scope of a negation or the antecedent of a conditional, according to whether θ1 is ¬δi or δiB. In short, we would have ΔAA, contrary to the assumptions of the lemma.

Thus, none of the discharged formulas δ1,...,δk can be the MPE χm, but must each occur as premises either in the minor subproof of E at some rule Ri or in the other subproof of E at some Ri. Now we deal with three possibilities: (A) the last such rule Ri is not Rm; (B) the last rule Ri is Rm, and is E; or (C) the last rule Ri is Rm and is E. In order to finish the treatment of the Main Cases 1 & 2, it will suffice to show how, in each of these subcases (A), (B), and (C), we can find a permutation that reduces the index c,n,b.

Subcase (A): if the last such rule Ri is not Rm, then we can permute the inference of θ1 above Rm to get:

This lowers the index b while leaving c and n unchanged.

Subcase (B): suppose Rm is an instance of E with one or more δi occurring in the other supbroof. So the general form of Π1 is:

We can permuting the inference to θ1(δi) into this other subproof, and, if applicable, infer θ(jiδj) in the right hand subproof. This gives us the following proof:
If the inference of θ1 has only been permuted into the lefthand subproof, then both n and b will be lowered. If the inference of θ1 has been permuted into both subproofs as displayed above, then n will remain unchanged, but we have a lower index b.

Subcase (C): the rule Rm is E and one or more δ’s stands in the minor subproof. This case is the most involved, and this is where we will have to appeal to the preliminary lemmas proved in the previous subsection. The overall form of Π will be as follows:

Let δ1,...,δl be the discharged δi’s which stand in Πm (so then δl+1,...,δk occur in Δm1).

Now, consider the result of tweaking the discharges so that in the uppermost ¬E, A gets discharged and ¬A stands as an open premise, and then uniformly propagating this change through the proof. The result is a proof of ΔA,¬A:. By assumption, we know that ΔAA; so by Lemma 3, we can lift this entailment up to the subproof ending in θ1. In other words, we know that:
By assumption, θ1 is either ¬(δ1...δk) or (δ1...δk)B, where B is a new atom. Either way, it follows that
Recalling that δl+1,...,δk are in Δm1, this gives us:
Note that Δm1,¬¬χm1AA, because the only occurrence of A in the premise set is in the scope of a negation in ¬¬χm1A. So there will be a countermodel M1 witnessing this invalidity. Now if Δm,¬¬δ1,...,¬¬δlψm, then we could piece together a countermodel M witnessing:
In brief, M would look like this:
But since that contradicts our assumptions, we have that Δm,¬¬δ1,...,¬¬δlψm.

Now it follows by Lemma 6 that each of δ1,...,δl stands above a in Πm. Thus, we can divide Πm into several chunks:

Then we might try to rearrange our overall proof as follows, where each Σ1i is a relettered copy of Σ1:
The result would be a proof with a lower index c. This basic idea behind this permutation will ultimately work. However, executing that idea via this naive rearrangement is too quick; if there were rules in Σ that discharged premises in Πm2, this naive rearrangement would ruin that. Instead, I will show how we can extract proofs Σ1,...,Σl and Σ0 from the original Σ to successfully execute this permutation strategy. What we require of Σi and Σ0 is that, for each subproof above θj in Σ there are corresponding subproofs Σij and Σ0j such that:
  • (a) If θj is a coarsened c-variant of a formula ϕj, then the conclusion of Σij is also a coarsened c-variant of ϕj, and

  • (b) the conclusion of Σ0j is either or is also a coarsened c-variant of ϕj.

  • (c) The premises of ΣijΣ0j are in many-one correspondence with the premises of Σ, where corresponding premises are both coarsened c-variants of the same original formula.

  • (d) The MPEs of E-rules in Σij only discharge formulas in Πmi or Σij1, and the MPEs of E-rules in Σ0j discharge formulas outside of each Πmi and Σij1

We work inductively down the thread θ1,...,θn to define Σij and Σ0j. We will have Σij and Σ0j as the proofs we have defined at the jth step, and then set Σi:=Σin and Σ0:=Σ0n. We start by letting each Σi1 be the one line proof of θ1(δi) from itself. If l=k, so that there all the discharged δi’s occur in Πm, then let Σ01 be the null proof. On the other hand, if l<k and there are discharged formulas δl1,...,δk outside Πm, then let Σ01 be the one line proof of θ1(l<ikδi) from itself.

Now consider the j1th rule. There are 8 possibilities.

Case 1: The j+1th rule is I. We know θj will be one premise of the rule, let ϕ be the other premise and Πj the corresponding subproof of ϕ. If Πj1,...,Πjl are distinct releterrings of Πj, let Σij+1 result from applying I with the two subproofs Σij and Πji.

For Σ0j+1, if the conclusion of Σ0j is , then let Σ0j+1 just be Σ0j. If the conclusion of Σ0j is not , then we know it must be some ξj which is also a coarsened c-variant of the original target formula. Then take another relettering Πj0 and append an instance of I with Πj0 to obtain the proof Σ0j+1 of ξjϕ0.

Case 2: The j+1th rule is E. If the discharged premise occurs in Σij or Πmi, then append a corresponding E to the bottom of Σij to obtain Σij+1. If the discharged premise occurs outside of Σij and Πm1, then let Σij+1 be the same as Σij.

If the discharged premise occurs outside of each Σij and Πm1, append a corresponding instance of E to the bottom of Σ0j to obtain Σ0j+1; otherwise, let Σ0j+1 be Σ0j.12

Case 3: The j+1th rule is I. Let Σij+1 result from appending the ith relettering of this I to the bottom of Σij.

For Σ0j+1, if the conclusion of Σ0j is , then let Σ0j+1 just be Σ0j. If the conclusion of Σ0j is not , then we know it must be some ξj as in Claim (b); then let Σ0j+1 be the result of appending a new I to the bottom of Σ0j.

Case 4: The j+1th rule is E. Suppose ξ(ζ1...ζt) is the MPE, with θj being the left subconclusion. If ξ occurs as a premise in Πmi or Σij,13 then append a relettering of the same instance of E to the bottom of Σij to obtain Σij+1.

For Σ0j+1, if ξ occurs as a premise outside of each Σij and Πmi, then append a relettering of the same instance of E to the bottom of Σ0j to obtain Σ0j+1. If the conclusion of Σ0j had been ξj as in Claim (b), then we also know that the conclusion of Σ0j+1 will be ξj+1 satisfying Claim (b). If the conclusion of Σ0j had been , then the conclusion of Σ0j+1 will either be or ξj+1 according to whether the right hand subconclusion was or was a coarsened c-variant of the same target formula as θj.

Case 5: The j+1th rule is I. We know that the premise θj is not . If this rule does not discharge a premise, or if it does discharge some premise(s) that occur in some Σij or Πmi, then append the same rule to the bottom of Σij to obtain Σij+1. If the rule does discharge a premise, but not one that occurs in either Σij or Πmi, then for B a new atom, append an instance of I to the bottom of Σij to obtain a the proof Σij+1 of Bθj.

For Σ0j+1, if the instance of I does discharge premise(s) ζ1,...,ζt outside of each Σij and Πmi, then append to the bottom of Σ0j an instance of I discharging the same premise(s). This will give either a proof of (ζ1...ζt)ξj or (ζ1...ζt)B, according to whether the conclusion of Σ0j is ξj or . On the other hand, suppose the instance of I does not discharge any premises outside of each Σij and Πmi. If the conclusion of Σ0j is ξj, append an instance of I to infer Bξj, for B a new atom. If the conclusion of Σ0j is , then simply let Σ0j+1 be the same as Σ0j.

Case 6: The j+1th rule is E. We can let Σij+1 result from appending the same E to the bottom of Σij as applicable, similar to the treatment of E in Case 2.

For Σ0j+1, if θj was the subconclusion of this , and if the rule discharges a premise outside of each Σij and Πmi, then append to the bottom of Σ0j an instance of to obtain Σ0j+1. If θj+1 was the subconclusion of this , and the rule does not discharge a premise outside of each Σij and Πmi, then simply let Σ0j+1 be the same as Σ0j. On the other hand, if θj was the minor premise of this rule and the conclusion of Σ0j is ξj, then append a relettered instance of the same E to the bottom of Σ0j to obtain Σ0j+1. And if θj was the minor premise of this rule but the conclusion of Σ0j is , then simply let Σ0j+1 be the same as Σ0j.

Case 7: The j+1th rule is ¬I. This is impossible, because we know that θj is not .

Case 8: The j+1th rule is ¬E. This can only happen at the nth rule, since none of θ1,...,θn are s. In this case, append an appropriately relettered ¬E to the bottom of Σij to obtain Σin (i.e., Σi). For Σ0n, if the conclusion of Σ0n1 is , let Σ0n be the same as Σ0n1; and if the conclusion of Σ0n1 is ξn1, then append the corresponding instance of ¬E to obtain Σ0n.

This concludes the definition of Σi and Σ0. Now form the proof:

We know that either Σ01 was the null proof, in which case θ1 has been removed from Σ0, or that Σ01 was the one line proof of θ1(l<ikδi).

If Σ01 was the null proof, then observe that corresponding to each of θ2,...,θn in Σ, there will either be a or ξi in Σ0, possibly with repetitions. So either: (i) we have reduced the index c in this new proof (if each of θ1,...,θn correspond to s), or we have reduced n (since, even if each θ2,...,θn correspond to formulas ξ1,...,ξn, the initial occurrence of θ1 has been removed and permuted up the proof).

On the other hand, if Σ01 was the one line proof of θ1(l<ikδi), then c and b will remain unchanged and n may have decreased but at any rate will not have increased. But we are now back in Subcase (A) and can apply the permutation from Subcase (A) described above.

This completes the treatment of Main Cases 1 & 2.

Main Case 3: Π has the following general form (recall that we have invoked Remark 3 to assume that any E only discharges a single premise in the subproof with A):

Let R1,R2,... be the rules below the θ premise in Π3. Let Rn be the first of these rules that is either an I-rule or a ¬E or an E with θi as the minor premise. We know that there must be some such rule, because otherwise there would never be another below θ1. Provided Rn is not an instance of I that discharges either an assumption δ from Δ1 or the MPE ξ1ξ2i to infer respectively δθi or (ξ1ξ2i)θi, we can permute Rn up above E, so that we have the following:14  
If Rn has conclusion θ1, then this gives a proof with smaller index n while c and b are unchanged. On the other hand, if Rn has conclusion (for instance, if it were an instance of ¬E with minor premise θ1), then the index c will have decreased by 2.

As just noted, this permutation works unless (A) Rn discharges a premise δΔ1 in I to infer δθ or (B) Rn discharges ξ1ξ2i to infer (ξ1ξ2i)θi.

Subcase (A): In this case we permute Rn above the instance of E into both subproofs. In the left subproof we use the version of I that refutes the antecedent, and in right subproof we use the version of I that derives the consequent without use of the antecedent. This gives the following proof:

Now the conclusion of the -E is a c-variant of δθ, and this gets propagated down through the rest of the proof. The indices c, n, and b are all unchanged; but the proof now falls under Main Case 2.

Subcase (B): Here, the argument again gets complicated, but the main ideas are similar to the treatment of the Subcase (C) from the Main Cases (1) & (2) above. To begin with, note that ¬A cannot occur in ξ1ξ2i, because otherwise we would have an occurrence of ¬A in the antecedent of the conditional (ξ1ξ2i)θi; and then the coarsening ΔA that replaced ¬A with A would have A in the antecedent of a conditional, and hence ΔAA. So ξ1ξ2i is not an ancestor of the MPE ¬A at the top of the prooftree.

As before, we know the general form of the proof will have a ¬E with premises ¬A and A followed by a series of m elimination rules, with the first MPE χ1 discharging ¬A, and χi discharging χi1. Since ξ1ξ2 cannot be one of these χi’s, we know that ξ1 must be occur as a premise either (i) in the ψm subproof of E where the MPE is χm1ψm or (ii) in a minor subproof of E, with MPE ψmχm1.

Take first the possibility (i) that ξ1 occurs above an E. We can assume that the ξ1ξ2 occurrence of E is applied as high as possible, so that the general form of the proof will be
Now by permuting the ξ1ξ2i premise upwards we get the following proof, which has a lower index n and b while c is unchanged:
Take now the possibility (ii) that ξ1 occurs in a minor subproof of ψm in a E with MPE ψmχm1. Then the general form of proof will be:
Now, by Lemma 3, where Δm1 is the set of premises above the rule with MPE χm1, we know that:
And since ¬¬ξ1,¬θ¬((ξ1ξ2i)θ), this gives us:
So by atom-disjointness:
And then, by an argument similar to that from Subcase (C) above, it follows that
So by Lemma 6, ξ1 must occur above a somewhere in Π1:
With this in hand, I claim that we can inductively extract two proofs Σ1 and Σ2 from Σ, which allow us to form the following proof:
The inductive definition of Σ1 and Σ2 here is similar to the definition of the proofs Σi and Σ0 from before, so I will omit the details. The most important thing to note is that, where Σ had a premise θ1, this has been replaced by a in Σ2. And because of this, Σ2 occurs immediately below the E. So as a result, both n and b will have been decreased while the index c is unchanged. This completes the treatment of Subcase (B), and thus of Main Case 3 and the proof.

6 Negation Elimination

I turn now to the treatment of proofs that end in ¬-E. Similar to above, the first task is to characterize when the result of adding ¬-E to a proof might not preserve gauntness. We will want to pay particular attention to the structure of the proof in question. The asymmetry between premises and conclusions in intuitionistic logic makes the treatment of ¬-E importantly different from the treatment of ¬-I. An application of ¬-E can require coarsening not only literals but also more complex formulas. For instance, while both ¬¬¬A:¬A and ¬¬(A¬B):A¬B are gauntly valid, an application of ¬-E would respectively give proofs of ¬¬¬A,¬¬A: and ¬¬(A¬B),¬(A¬B):. Neither of these sequents are gauntly valid, since they can both be coarsened to ¬C,C:.

 

Lemma 8

Suppose that Π is a coarsened gaunt proof of Δ:(ψ1...ψk)θ, where (ψ1...ψk)θ is obtained via the form of -I that derives θ and discharges ψ1,...,ψk, but that Δ,¬((ψ1...ψk)θ): has the valid coarsening Δ,¬A:. Then k=1 and ψ1θ is of the form A1(A2(...(An¬B)...).

 

Proof.

The general form of Π will be as follows:

First we want to show that k=1 and ψ1 must be an atom A1. Since Π is gaunt and we have a subproof of Δ0,Δ1,Δ2d,ψ1,...,ψk:θ, this sequent will be gauntly valid. Because the overall sequent has the valid coarsening Δ,¬A:, we know that iψiθ must occur in Δ. Further, we know from Lemma 1 that the only occurrence of the ψi’s, or of any atoms in the ψi’s, in Δ0,Δ1,Δ2d will be in this form ψiθ. Let Δ0,Δ1,Δ2d be the result of coarsening ψ1...ψk to a new atom A. Then, if M is any model that makes ψ1...ψk true at exactly the same worlds w as those where this atom A is true, then M will also assign Δ0,Δ1,Δ2d the same value as Δ0,Δ1,Δ2d; so any countermodel witnessing Δ0,Δ1,Δ2d,Aθ would also be a countermodel witnessing Δ0,Δ1,Δ2d,ψ1...ψkθ. In other words, if Δ0,Δ1,Δ2d,ψ1...ψkθ, then Δ0,Δ1,Δ2d,Aθ. Thus, Δ0,Δ1,Δ2d:Aθ would be a valid proper coarsening of Δ0,Δ1,Δ2d:ψ1...ψkθ unless ψ1...ψk was an atom A1.

Now, work up from the root of Π until you find the place where θ is first introduced. For brevity, let Γ be the set of undischarged premises above this inference, and note that ψθ must occur in some member of Γ. Otherwise, ψθ would have to occur as an MPE with either ψθ as the main subconclusion or θ as the main subconclusion and a I inferring ψθ lower down the prooof; either way this contradicts the assumption that Π was obtained by coarsening.

A priori, the rule that introduces θ could be either an I-rule, or the modified E rule, or θ could be a leafnode. But we know that θ cannot be introduced by I or the modified E because the two parallel subproofs have to be atom-disjoint, and that would be impossible because we know that ψθ occurs in Γ. Likewise, it cannot be I, because one disjunct would be a new atom. If θ descended from a leafnode, it would have to be as the main subconclusion of an E-rule; moreover, because θ can only occur in the context of A1θ, this rule would have to be E, with minor premise A1. But in that case the coarsening procedure for I would have led not to Δ:ψθ, but to some coarsening ΔC:C. (Refer to Case (C) in the coarsening procedure for I in Section 4.3.) So the rule that introduces θ can only be ¬I or I.

Suppose first that θ is ¬χ, obtained by ¬I, so we have a gaunt subproof of Γ,ψ,χ:. We know that Γ,¬(ψ¬χ): has a valid coarsening Γ,¬A:. Hence, Γ[A/ψ¬B],¬(ψ¬B): is valid. Thus Γ[A/ψ¬B],ψ,¬¬B: is valid and, hence, so is Γ[A/ψ¬B],ψ,B:. But this would be a proper coarsening of Γ,ψ,χ:, unless χ was an atom.

On the other hand, suppose θ is obtained by I. Then neither the antecedent nor consequent can be a new atom, so it must be χξ, obtained by deriving ξ and discharging χ. So we have a gaunt proof of Γ,ψ,χ:ξ. We also know that Γ,¬(ψ(χξ)): can be coarsened to Γ,¬A:. Now, as a substitution instance, it follows that Γ[A/ψB],¬(ψB): is valid, and hence that Γ[A/ψB],ψ,¬B: is valid. But this is a valid coarsening of Γ,ψ,¬(χξ):. Now we iterate the argument as applies to the conclusion ξ in the subproof.

 

Corollary 1

Suppose Π is as in the previous lemma. Then the following proof Π1 occurs as a subproof somewhere at the top of Π:

The open occurrence of A1(A2...(An¬B)...) will be discharged somewhere in Π. And (possibly after permuting some E-rules) the bottom n+1 steps of Π are as follows, with each inference respectively discharging B,An,...,A1 from Π1:

 

Proof.

In light of Lemma 8 and the assumptions of the claim, it follows that Π will end with a series of -I’s, possibly interspersed with E-rules, of which the formulas Ai(...¬B) are the main subconclusions. Since these formulas are all main subconclusions, and the discharges of the -I’s and the E-rules will not conflict, the E-rules can be permuted upward to precede the -I’s.

We know by Lemma 1 that each Ai only occurs in the premise set Δ as Ai(Ai+1...). And by the proof of Lemma 8 we know that Π has a subproof of with open premises A1,...,An,B. Moreover, A1,...,An must figure as minor premises for -E; otherwise, they would occur as subformulas in a context other than A1(A2...(An¬B)).

Putting these facts together, we know that each Ai will stand undischarged as the minor premise of -E, which determines the form of Π1 until the we get to main subproof of An¬B. The discharged premise ¬B must connect with another occurrence of B. But we know that B must occur as an undischarged premise, and that there are no other instances of B in Δ aside from A1(...An¬B), the only rule that can be applied in this subproof is an instance of ¬-E where the minor premise B is undischarged in Π.

One more technical lemma is needed before we can put all the pieces together to define our coarsening procedure for negation elimination.

 

Lemma 9

Suppose Π is a gaunt coarsened proof of Δ:ϕ, but that Δ,¬ϕ: can be coarsened to the valid sequent Δ,(¬ϕ): under the substitution σ. Then:

  1. If B1,...,Bm are the atoms changed by σ, then B1,..,Bm occur either in (¬ϕ) or in some ψ, where ψ occurs as the minor premise of -E in Π; and

  2. σ(Bi) will either be a formula χi or ¬χi, with the latter case only when ¬χi=¬ϕ, and where χi is one of the following forms:

    • (a) χi is ¬Ai and the occurrence of ¬Ai in ϕ or ψ descends from an application of ¬-I in Π; or

    • (b) χi is of the form C1(C2...(Cn¬D)) or ¬(C1(C2...(Cn¬D))), and the occurrence of χi in ϕ or ψ descends from a subproof of the form specified in Corollary 1.

 

Proof.

Both claims can be proved simultaneously by induction on the height of Π. The basis step is trivial. For the induction step, we have the obvious series of cases.

Case 1: The last rule in Π cannot be ¬-E, by the hypotheses of the lemma.

Case 2: Suppose we have a gaunt coarsened proof of Δ:¬(θ1...θk) where the last rule is ¬-I. Now, Δ:¬(θ1...θk) is valid iff Δ,¬¬(θ1...θk): is valid. So if Δ,¬¬(θ1...θk): is not gauntly valid, it must be that there is a coarsening Δ,A: or Δ,¬A:. First, I want to show that A is the only atom changed by σ. Let S={C1,...,Ck} be the set of atoms other than A changed by σ, and let ΔS be the image of Δ under σ{A}. Evidently ΔS,¬¬(θ1...θk): is valid, hence so is ΔS:¬(θ1...θk). But if S were non-empty, this would be a valid proper coarsening of Δ:¬(θ1...θk), contradicting the fact that Π is gaunt.

Now I would like to argue that (θ1...θk) must be an atom (and so k=1). Let σ:A¬i(θ1...θk), where i{1,2}, so that σ(Δ)=Δ. Obviously we can decompose σ into σ1:A¬iB and σ2:B(θ1...θk). Clearly σ1(Δ),¬¬B: is valid, hence σ1(Δ):¬B is valid, which would be a valid coarsening of Δ:¬ϕ under σ2. So σ2 must be a mere relettering, and hence k=1 and (θ1...θk) is an atom.

Case 3: suppose that the last rule is -I. First consider the form where ψ is derived from θ1,...,θk, and then the θi’s are discharged to infer (θ1...θk)ψ. If there is a coarsening of the form Δ,¬iA:, where i{0,1}, then the fact that σ(A) has the required form follows from Corollary 1. Concerning any other atoms B that are changed by σ, note that if we have a valid coarsening Δ,¬iA:, then we also have a valid coarsening of the form Δ,¬(θ1...θk)ψ):. In this case, Δ,(θ1...θk),¬ψ: would also be valid, and the claim follows by the i.h.

On the other hand, suppose that Δ:(θ1...θk)B is deduced from a subproof of Δ,θ1,...,θk:. Since B is a new atom, a coarsening of Δ,¬((θ1...θk)B): would have to be of the form Δ,¬((θ1...θk)B):. But, since B is a new atom, this can be valid only if Δ¬(θ1...θk). Now consider the various forms the coarsened formula (θ1...θk) might take. Let σ be substitution under which this coarsening is obtained.

  • Suppose there is some i<k such that (θ1...θk) is of the form θ1...θi1C, so that σ:Cθi...θk.15 Then θi,...,θk must be atoms Ai, for otherwise we could decompose σ into two non-trivial substitutions σ1:CAi...Ak and σ2:Aiθi. In that case, σ1(Δ):(θ1...θi1Ai...Ak)B) would be a valid proper coarsening of Δ:(θ1...θk)B, which is impossible. So we know that θi,...,θk are all atoms Ai,...,Ak, and furthermore the conjunction Ai...Ak must occur in Δ. By Proposition 1, then, we know that this will be the only place in Δ that Ai,...,Ak can appear. Thus, by the subformula property, Ai,...,Ak can only occur in Π in a series of I rules. But this is impossible, since it would conflict with Case (B) of the coarsening procedure for I.

  • On the other hand, if there is no such i, then the coarsening (θ1...θk) will be of the form θ1...θk. But then we would have that Δ¬(θ1...θk); hence Δ,θ1,...,θk: would be a valid proper coarsening of Δ,θ1,...,θk:, which is impossible.

This completes the treatment of the second form of I.

For the third form, suppose Δ:Bψ is deduced from a subproof of Δ:ψ. Since B is a new atom, a coarsening of Δ,¬(Bψ): would have to be of the form Δ,¬(Bψ):. Then because B is a new atom, this is valid only if Δ,¬ψ: is valid, and we apply the i.h.

Case 4: Suppose now that the last rule is -E, so we have a proof:

Suppose there is a valid proper coarsening Δ1,Δ2,(ψθ),(¬ϕ):. Since Π1 and Π2 will be atom-disjoint, this coarsening must be of the form Δ1,Δ2,ψθ,(¬ϕ):. Now, Δ1 and ψ will only be properly coarsened if Δ1,¬ψ: is valid; otherwise, we could piece together models of Δ1,¬ψ and Δ2,(¬ϕ) to create a countermodel to Δ1,Δ2,ψθ,(¬ϕ):. Thus, Δ1 and ψ are proper coarsenings only if Δ1,¬ψ: is a valid proper coarsening of Δ1,¬ψ:. So we may apply the i.h. to Π1. Furthermore, because Δ1,ψ is atom-disjoint from Δ2,θ,ϕ, we know that Δ2,θ,(¬ϕ): must be valid, so we may also apply the i.h. to Π2.

Case 5: suppose the last rule in Π is -I, so we have:

Since Π1 and Π2 are atom-disjoint, ψθ cannot be among the premises of Δ. So if Δ,¬(ψθ): had a valid coarsening, it would have to be of the form Δ,¬(ψθ):. Without loss of generality, we can suppose we have a valid coarsening of the form Δ1,Δ2,¬(ψθ):, with ψ a coarsening of ψ. Evidently, then, Δ1,¬ψ: is valid and is a proper coarsening of Δ1,¬ψ:. The claim then follows from the i.h.

Case 6: suppose the last rule in Π is -E, so we have:

Since Π is obtained by coarsening, we know that C is a new atom. Thus a coarsening Δ,(ψC),¬ϕ: would induce a similar coarsening Δ,ψ,¬ϕ:. Then the claim follows from the i.h.

Case 7: suppose the last rule in Π is -I. Since this is a coarsened proof, the newly introduced disjunct will be a new atom. So any coarsening of Δ,¬(ψC): will induce a corresponding coarsening of Δ,¬ψ:, and the claim follows from the i.h.

Case 8: suppose the last rule in Π is -E, so we have a proof of Δ,(ψ1...ψk)(θ1...θl):ϕ. The case of uniform conclusion does not apply. If the subproof Π2 below the θi’s has conclusion , and we have a conclusion ϕ descending from the ψi’s in subproof Π1, then, since the two subproofs will be atom-disjoint, any coarsening Δ1,Δ2,((ψ1...ψk)(θ1...θl)),¬ϕ: would correspond to a coarsening Δ1,(ψ1...ψk),(¬ϕ): or Δ2,(θ1...θl):. Take each of the two subproofs in turn:

  • Focus on Π2. If (θ1...θl) were a non-trivial coarsening, then we would have Δ1¬(θ1...θl). But the same argument as we used in the second form of I shows that this is impossible. So a proper Δ2,(θ1...θl): would have to take the form Δ2,(θ1...θl):; but this conflicts with the assumption that Δ2,θ1,...,θl: is gauntly valid.

  • Now consider Π1. The argument is largely similar: suppose that we have Δ1,(ψ1...ψk),(¬ϕ):. Now, if the coarsening of (ψ1...ψk) is of the form ψ1...ψk, then the claim follows by the i.h. On the other hand, suppose that the coarsening of (ψ1...ψk) is of the form ψ1...ψi1C, with Cψi...ψk. Then, arguing as above, we know that ψi,...,ψk must be atoms Ai,...,Ak; and the conjunction Ai...Ak must occur somewhere else in Δ1,ϕ; and thus the only way that Ai,...,Ak can figure in the proof Π is as premises in successive I’s. But that is ruled out by Case (B) of the coarsening procedure for E. So a valid proper coarsening Δ1,(ψ1...ψk),(¬ϕ): would have to be of the form Δ1,(ψ1...ψk),(¬ϕ):. This obviously gives us a valid proper coarsening Δ1,ψ1,...,ψk,(¬ϕ):, and so the claim follows by the i.h.

On the other hand, suppose neither conclusion is , so we have a proof of the following form, using the modified -E rule:
Again, Π1 and Π2 are atom-disjoint, so in the sequent Δ,(ψ1...ψk)(θ1...θl):ϕ1ϕ2, neither (ψ1...ψk)(θ1...θl) nor ϕ1ϕ2 can be coarsened to an atom B. As a result, any coarsening of this sequent will induce coarsenings of Δ1,(ψ1...ψk):ϕ1 and Δ2,(θ1...θl):ϕ2, and we argue like we did for Π1 just above.

And now we can show how to find gaunt proofs that end in ¬-E:

 

Lemma 10

Suppose that there is a gaunt coarsened proof Π of Δ:ϕ, but that Δ,¬ϕ: has a valid proper coarsening Δ,(¬ϕ):. Then by permuting rules in Π, we can obtain a gaunt coarsened proof Π of Δc,¬ϕc:, which is also a coarsened c-variant of the original target sequent.

 

Proof.

If σ is the substitution under which Δ,¬ϕ: gets coarsened, and B1,...,Bn are the atoms changed by σ, then we know from Lemma 9 that each σ(Bi) will either be ¬A or C1i(C2i...¬Di), or, in the case where σ(Bi)=¬ϕ, this will either be ¬¬Ai or ¬(C1i(C2i...¬Di). We also know from Lemma 9 that each σ(Bi) will either occur in ϕ or in the minor premise of some E in Π. In either case, then, if ψ is a formula in which some B occurs, then there will be some (not necessarily proper) subproof Π0 of Π such that Π0 is a gaunt coarsened proof of Δ0:ψ but Δ0,¬ψ is not gauntly valid. Π0 is of course either Π itself, in which case ψ is just ϕ, or is a minor subproof above an instance of E, in which case ψ is the minor premise.

We already know from Corollary 1 what general form Π0 will take when there is some χ:=C1(C2...¬B) occurring in ψ. We can also observe the general form Π0 must have when there is some ¬A in ψ. From Lemma 9, we know that ¬A descends from an instance of ¬-I. So A occurs as a leaf-node somewhere in Π. Now, if this leaf-node were a premise in an I-rule or a minor premise of -E, then conclusion of that I-rule or the MPE of -E would be a formula Aξ, which would then be a subformula in Δ. But if ¬A gets coarsened to A in Δ, then every occurrence of A in Δ must be immediately in the scope of a negation. So the leaf-node occurrence of A must be a minor premise for ¬E. Thus, Π0 must have the following form:

We can observe that in either case, for formulas ¬Ai or χi, Π0 must fit the following general pattern:
If the top left leaf-node is A, then it is a minor premise in ¬E, and the major premise ¬A is discharged somewhere in Π1; A itself is discharged in the ¬I at the bottom of Π1. If the top left leaf-node is χ, then the comes from a series of E rules as indicated in Corollary 1, χ will be discharged somewhere in Π1, and the χ occurring at the conclusion of Π1 is obtained by a series of I’s.

So we have two key chunks in the overall proof: there is the Π1 portion, which takes us from one to another , and then there is the Π2 portion, which takes us from ¬A/χ to ψ(¬A/χ). I will show how we can systematically find corresponding Σ1 and Σ2 such that the following is a gaunt coarsened proof as required by the lemma:

I argue by induction on the height of Π.

For the basis step, Π2 may be a trivial one line proof, but we know that Π1 must have at least one inference rule because it must discharge ¬A (or χ, although in that case Π2 could not be the trivial one-line proof). The rule discharging ¬A could be either ¬I or I, and the next rule introducing the could be either ¬E or E. This gives us four shortest possible proofs Π. If the last rule is ¬E, we have the two possibilities:

And if the last rule is E, then we have these two possibilities (where the main subproof of Γ,θ: may be any gaunt coarsened proof of height 3):
In the first case, the coarsening of ¬¬¬A,¬¬A: would be ¬A,A:. To obtain our proof of this sequent, we let Σ1 be the trivial proof, and let Σ2 be:
In the second case, the coarsening of ¬(¬AB),¬¬A: would be ¬(AB),¬A:. To obtain our proof of this sequent, we again let Σ1 be the trivial proof, and let Σ2 be:
In the third case, the coarsening of Γ,¬¬Aθ,¬¬A: will be Γ,Aθ,A:. So we let Σ1 be the trivial proof and let Σ2 be:
Finally, in the fourth case, the coarsening of Γ,(¬AC)θ,¬¬A: will be Γ,(AC)θ,¬A:. So we again let Σ1 be the trivial proof, and let Σ2 be:
This completes the four cases of the basis step.

For the induction step, we can consider the obvious series of cases according to the last rule applied in Π. I will begin with the E-rules. A remark on the notation used below: ψ(¬Ai/χi) will refer to a formula ψ that has a specified subformula either ¬Ai or χi; then ψ(Bi) will refer to the result of replacing the specified occurrence of ¬Ai or χi with the atom Bi.

Case 1: Suppose the the last rule applied in Π2 is E, so Π is a proof of Δ,θC:ψ(¬Ai/χi)—where C is a new atom—with an immediate subproof of Δ,θ:ψ(Ai/χi). Then by the i.h. we have proofs Σ1,Σ2 that give the following gaunt coarsened proof, where θ may occur as a premise in either Σ1 or Σ2 (but not both):

Appending an instance of E discharging θ to the bottom of Σ1 will then give us the required proofs.

Case 2: suppose the last rule in Π is E, so we have:

If there is a valid coarsening of the form ΔL,ψθ,ΔR,(¬ϕ):, then the claim follows directly from the i.h., similar to the case of E. On the other hand, suppose the coarsening also affects ΔL, so we have a gauntly valid sequent ΔL,ψθ,ΔR,(¬ϕ):. It follows that ΔL¬¬ψ, for otherwise we could find a model M of ΔL,¬ψ, which we could then merge with a model of ΔR,(¬ϕ) to create a countermodel to our overall coarsened sequent. So, while ΔL:ψ was gauntly valid, ΔL,¬ψ: has the valid proper coarsening ΔL,¬ψ:. That is, both ΠL and ΠR satisfy the assumptions of the lemma. By the i.h. we know we have proofs as follows:
With these we can form the following proof of our target sequent ΔL,ψθ,ΔR,(¬ϕ):.
To see that this is gaunt, consider the subproof above an arbitrary node in Σ1L. For brevity, let ΔL be the undischarged premises above this node other than ΔR or ¬ϕ.16 Then the subproof is a proof of ΔR,ΔL,¬ϕ,ψθ:ξ. Note that in the proof from the i.h. there is a corresponding subproof proof of ΔL,¬ψ:ξ. Now consider a coarsening ΔL,ΔR,¬ϕ,ψθ:ξ; we want to show that it is invalid. Because the proof from the i.h. was gaunt, we know that ΔL,¬ψ:ξ is invalid, so there is a countermodel M1. Similarly, ΔR,¬ϕ: is invalid, so there is a countermodel M2. And by atom-disjointness, we can merge these two models together to create a countermodel to ΔL,ΔR,¬ϕ,ψθ:ξ.

Case 3: suppose the last rule applied in Π2 is E. This will have two subcases, according to whether or not one of the subconclusions is . On the one hand, if one of the subconclusions is , then Π is:

We can apply the i.h. to the left subproof to get a proof of the required form of Δ1,Δ2,θ1,...,θk,¬ψ(Bi):. Then appending a terminal application of E will give the proof of Δ,(θ1...θk)(ξ1...ξl),¬ψ(Ai): of the form that we seek.

On the other hand, suppose that Π ends with an instance of E where neither of the subconclusions are . Then Π is of the following form (where each θj may occur as a premise in either Π1 or Π2):
By the i.h. we can find Σ1 and Σ2 such that the following is a gaunt coarsened proof:
From this we can then construct the following proof, where C is a new atom:
Concerning Π3, assume for simplicity and without loss of generality that Δ3,ξ,¬ψ2: is gaunt. (If not, we could deal with it in a similar fashion to the left subproof.) Then, we can form the following proof, where D is another new atom.
This is a proof, in the required form, of
which is a coarsened c-variant of our original target sequent, as desired.

Case 4: the final E-rule to consider is ¬E. But since the conclusion of Π is a formula, not , we know that Π cannot end in ¬E. I turn now to the cases where the last rule in Π is an I-rule.

Case 5: suppose the last rule in Π is I, with conclusion ψ1(¬Ai/χi)ψ2 and subproofs ΠL of ΔL:ψ1 and ΠR of ΔR:ψ2. Now we need to consider two subcases, according to whether (i) ΔR,¬ψ2: is gaunt or, (ii) it is not. For (i), if it is gaunt, then we can form the following proof, where Σ1L and Σ2L are guaranteed to exist by the i.h.

To see that this proof is gaunt, consider the subproof above some arbitrary node in Σ1L labeled with, say, ξ. Let ΔL be the undischarged premises of this subproof other that those in ΔR. Then the subproof in question is a proof of ΔR,ΔL,¬(ψ1(B)ψ2):ξ. Suppose that ΔR,ψ2, were coarsened to ΔR,ψ2. Since ΔR,¬ψ2: is gauntly valid, we know that there is model M1 of ΔR,¬ψ2. Now, by the i.h., ΔL,¬ψ1(B):ξ is gauntly valid, so there will be a model M2 that witnesses ΔLξ. And because the ΔL and ΔR are atom-disjoint, we can combine M1 and M2 into a single model that is a counterexample to ΔR,ΔL,¬(ψ1(B)ψ2):ξ. The argument is similar if ΔL,¬ψ1(B):ξ were coarsened.

On the other hand, in subcase (ii) there are some formulas Aj/χj to be coarsened in Π2. Then we form the following proof, where again all of Σ1L,Σ2L,Σ1R,Σ2R exist by the i.h.

We know this is gaunt by an argument similar to above: take an arbitrary subproof above some node ξ in, say, Σ1R, and let ΔR be the set of undischarged premises in this subproof other than those in ΔL. Consider a coarsening of ΔR,¬ψ2(Bj):ξ. By the i.h., this will be invalid and hence have a countermodel M1. Likewise, we know ΔL,¬ψ1(Bi): is gauntly valid, so ΔL: will have a countermodel M2. And since ΔL and ΔR are atom-disjoint, we can merge M1 and M2 into a single model M which is a countermodel to ΔL,ΔR,¬(ψ1(Bi)ψ2(Bj)):ξ.

Case 6: suppose the last rule in Π is I. Then ψ will be of the form ψ1C, where C is a new atom, and by the i.h. we have the following proof:

From which we can obtain our desired proof by inserting an instance of I:

Case 7: suppose the last rule in Π is I. First, suppose θ(¬Ai/χi)C is derived by refuting θ(¬Ai/χi). Then, as observed in the proof of Lemma 9, Δ,¬(θC): is gauntly valid, so there is nothing to show.

Second, suppose that Cξ(¬Ai/χi) is inferred by deriving ξ(¬Ai/χi) and C is a new atom. This case is similar to I above: given Σ2 with conclusion ξ(Bi), we then append an instance of I to infer Cξ(Bi), and this can then be the minor premise in ¬E with major premise ¬(Cχ(Bi)).

Third, consider the possibility that θξ is inferred by deriving ξ from θ. There are two possibilities: either (i) θξ is C1(C2...¬D) and gets coarsened to an atom B, or (ii) not.

Consider case (i), so by Corollary 1, we have the following proof:

Take the leaf-node occurrence of C1(C2...¬D). Clearly, the next step below this E must discharge the formula C1(C2...¬D) (after all, in Corollary 1, the only other open premises are ones that must be discharged later in the proof). Suppose this formula is discharged by any rule other than ¬I. Then there will be an occurrence of C1(C2...¬D) in Δ that is not immediately within the scope of a negation; and thus, the coarsening of Δ,¬(C1(C2...¬D): will be Δ,¬B:. We can form the required gaunt proof of this as follows, where Π0 is the result of propagating the replacement of B in place of C1(C2...¬D).
On the other hand, if Δ,¬(C1(C2...¬D)): coarsens to Δ,B:, then the leafnode occurrence of C1(C2...¬B) must be discharged by ¬I, so Π0 could be represented in more detail as:
From this we obtain the gaunt proof of Δ,B: as follows, where Π0 is the result of propagating B in place of ¬(C1(C2...¬D)):
This is our proof Σ2, and Σ1 is the trivial proof.

Now take case (ii), where (θ1...θk)ξ is inferred from a proof of ξ with the θj’s as open premises. Then Π is of the following form, where each θj may occur in either Π1 or Π2 (but not both):

Note that if Δ,¬(θξ): is valid, then so is Δ,θ,¬ξ:. So if the former has a valid coarsening, then so does the latter.17 Thus, we may apply the i.h. to find a proof of the following form, where again each θj may occur in either Σ1 or Σ2, but not both:
Now it is possible that all the θj’s are in Σ1, it is possible that all the θj’s are in Σ2, and it is possible that some θj’s occur in each of Σ1 and Σ2. Assume we are in the third case; the first two can be dealt with similarly. Let J be an index set for the θj’s in Σ2 and K an index set for the θj’s in Σ1. Then we can form the our desired proof as follows, where C is a new atom:
This is a proof of Δ,¬(KθjC),¬(Jθjχ(Bi)):, which is a c-variant of our target sequent Δ,¬(θ(Bi)χ(Bi)):, as desired.

Case 8: Finally, suppose that the last rule in Π is ¬I. So Π is a proof of Δ:¬(θ1...θk), with the immediate subproof Δ,θ1,...,θk:. If Δ,¬¬(θ1...θk): is not gauntly valid, then from Lemma 9, we know that k=1 and θ is an atom. It also follows that the coarsening must be of the form Δ,¬iB:, with i=0 or i=1. So Π will be:

Now the coarsening Δ will be obtained either by deleting 2 negations from A or only 1 negation. If 2, then obviously the occurrence of A in Δ must be preceded by two negations. Thus, the premise ¬A at the top left must be discharged by inferring ¬¬A by ¬I. Otherwise, the descendant of that leafnode ¬A would be a formula with an occurrence of A preceded by only one negation. So Π is
Now take Π0 and replace the node ¬¬A by A, and propagate this downward through the prooftree. This gives us a proof:
We may take this as our proof Σ2, with Σ1 being the trivial proof.

On the other hand, suppose Δ,¬A: is gauntly valid, where Δ is obtained by deleting one negation from in front of A. Let Π0 be the result of uniformly replacing every instance of ¬A in Π0 with A. (We know that every instance of A in Π0 is a descendant or ancestor of the top left ¬A, so every occurrence of A in Π0 will have at least one negation, and hence this deletion will preserve proofhood.) Then, by tweaking the discharges, we have the following proof:

Again, we may take this as our proof Σ2, with Σ1 being the trivial proof.

7 Conclusion

This paper and its prequel began with the guiding question of whether, given a natural deduction proof, there is a way to systematically transform it into a proof that contains no irrelevancies and in which the argument proved to be valid is as strong as possible. I offered two different definitions of when a proof contains no irrelevancies: the first is when we have a perfect proof and the second is when we have a gaunt proof. The prequel paper showed how to coarsen both classical and constructive natural deduction proofs to obtain perfect proofs.

In this paper we have seen how to coarsen constructive proofs, so that from a core proof of Δ:Φ we can find not just a perfect proof but also a gaunt proof of some Δ:Φ which is a coarsening of a c-variant of Δ:Φ. This result does not carry over to classical natural deduction proofs because of how negation can figure in premises of strictly classical rules, such as reductio ad absurdum or dilemma. An outstanding issue to explore, then, is how to extend the method of coarsening to sequent proofs, in which classicality can be achieved by the use of multiple conclusions rather than by logical inference rules. Does this difference between natural deduction and sequent calculi allow us to find a method of transforming an arbitrary sequent proof into a gaunt proof?

Funding

This work was partly supported by an Early Career Scheme grant from the Research Grants Council of Hong Kong SAR, China, project number 23606822.

Acknowledgements

Thanks are due to Neil Tennant for sharing his unpublished work on gaunt validity, and to Pierre Saint-Germier, Neil Tennant, Pilar Torrés Villalonga, and Peter Verdée. Thanks especially to the anonymous referees whose comments have improved both the exposition and technical arguments of this paper.

Footnotes

1

Thanks to an anonymous referee for raising this question.

2

This idea is developed more carefully in [1] and [3].

3

I am indebted to a referee for raising this question and suggesting the following line of reply.

4

This is because Lemma 5 and its application in Case 4 of the proof of Lemma 6 guarantees that certain transformations are possible, but does not provide an independent syntactic characterization of when to apply those transformations.

5

In general, I will assume that multiple conjunctions associate to the right, so that ϕ1...ϕn abbreviates ϕ1(ϕ2(...(ϕn1ϕn)...).

6

Note that this remark does not apply to the sequent calculus [5] provides for classical core logic. Tennant’s system only allows for single conclusions, not multiple conclusions. As a result, sequent proofs are isomorphic to natural deduction proofs, and results about natural deduction carry over immediately to the sequent calculus.

7

This question is partly addressed in [3], where I use a multi-conclusion sequent calculus to show that any classical gauntly valid sequent has a gaunt proof. That argument uses a bottom-up proof search, however, rather than a top-down coarsening procedure. It remains a further matter to study coarsening in a sequent calculus setting. An important feature of coarsening, as used in this paper, is that it provides a method for starting with any valid sequent and finding a gaunt proof of a coarsening of that sequent. The proof search method used in [3], by contrast, produces a gaunt proof of any gauntly valid sequent, but terminates unsuccessfully when given a sequent that is valid but not gauntly valid.

8

See Corollary 6 of Chapter IV in [4].

9

Given a countermodel to Δa¬δξ, we know that δ cannot be true at the root node, since then ξ would have to be true as well; but there must be at least one terminal node where δ is true. There must also be at least one terminal node where ξ is true, since otherwise ¬ξ and hence ¬δ would be true at the root node. Likewise for a countermodel to Δb¬ψjζ. And by atom-disjointness we can make these terminal nodes combine in the way pictured.

10

Note this proof is the same height as Π.

11

For if Δ1¬¬ϕ, we could require M1 to have a terminal world w where wϕ.

12

Note that it is possible for the discharged premise to occur both inside some Σij and Πm1 and outside each Σij and Πm1. Despite the fact that the instance of E in the original proof will only discharge one formula, we may have introduced multiple reletterings of that premise in the inductive definitions of Σij and Σ0j. If so, we will now have multiple relettered versions of the MPE for this instance of E.

13

Or if some relettering corresponding to ξ so occurs—a qualification I will henceforth omit.

14

It is possible that there are other E rules among R1,...,Rn1, in which case we also permute a copy of Rn into their respective subproofs as appropriate. This permutation would be similar to the process for proving Lemma 6(4).

15

Recall that conjunctions and disjunctions are assumed to associate to the right.

16

Thus, ΔL will include Δ2L as well as the subset of Δ1L whose members occur as premises in this subproof and the set of premises that are undischarged in this subproof but which get discharged lower down in Σ1L.

17

This is how we know that the ¬Ai’s and χi’s must occur in ξ as displayed in the prooftree.

References

[1]

E.
 
Brauer
 
Relevance for the classical logician
.
Review of Symbolic Logic
,
13
,
436
457
,
2020
.

[2]

E.
 
Brauer
 
Coarsening natural deduction proofs i: finding perfect proofs
.
Journal of Logic and Computation
,
2024
.

[3]

E.
 
Brauer
 
A hierarchy of relevance properties
. In
New Directions in Relevant Logic
,
A.
 
Tedder
,
I.
 
Sedlar
and
S.
 
Standefer
, eds.
Springer
,
forthcoming
.

[4]

D.
 
Prawitz
 
Natural Deduction: A Proof-Theoretical Study
.
Dover
,
2006
.
Originally published in 1965
.

[5]

N.
 
Tennant
 
Core Logic
.
Oxford University Press
,
2017
.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.