Subminimal negation

Minimal logic, i.e., intuitionistic logic without the ex falso principle, is investigated in its original form with a negation symbol instead of a symbol denoting the contradiction. A Kripke semantics is developed for minimal logic and its sublogics with a still weaker negation by introducing a function on the upward closed sets of the models. The basic logic is a logic in which the negation has no properties but the one of being a unary operator. A number of extensions is studied of which the most important ones are contraposition logic and negative ex falso, a weak form of the ex falso principle. Completeness is proved, and the created semantics is further studied. The negative translation of classical logic into intuitionistic logic is made part of a chain of translations by introducing translations from minimal logic into contraposition logic and intuitionistic logic into minimal logic, the latter having been discovered in the correspondence between Johansson and Heyting. Finally, as a bridge to the work of Franco Montagna a start is made of a study of linear models of these logics.


Introduction
In this paper, we study minimal logic in its two equivalent formulations: one with a basic symbol for the contradiction the other with a basic symbol for negation. Given a countable set of propositional variables, the formulation used nowadays is based on the propositional language of the positive fragment of intuitionistic logic, i.e., L + = {∧, ∨, →}, with an additional propositional constant f , representing falsum. In this setting, negation of ϕ is defined as ϕ → f and denoted by ¬ϕ. The significant difference between minimal and intuitionistic logic is that the former does not consider the ex falso quodlibet axiom as a valid axiom. If IPC + denotes the positive fragment of intuitionistic logic, minimal logic has the same axioms as IPC + , and hence, f does not have the same properties as the intuitionistic ⊥. We write MPC f for this formalization of minimal logic.
The other formulation of minimal logic makes use of the language L + ∪ {¬}, where the unary symbol ¬ represents negation. Thus, we denote with MPC ¬ the system axiomatized by the IPC + axioms and the additional axiom ( p → q) ∧ ( p → ¬q) → ¬p. This version of minimal logic is the one originally proposed by Johansson (1937), and even before, in a language with only → and ¬, by Kolmogorov (1925). Completeness with respect to our Kripkestyle semantics is proved for both versions of minimal logic.
The main purpose of the paper is to study a weak form of negation, considering subsystems of minimal logic while keeping the IPC + axioms fixed. We call such forms of negation subminimal negation. So, we use the term subminimal negation in a non-technical sense. This term has been used before by Vakarelov (2005Vakarelov ( , 2006 with a more restricted meaning. We will return to this point later. We define a semantics of negation by means of an auxiliary persistent function N , a different approach than previous authors such as Došen (1999) and Vakarelov. This alternative Kripke semantics leads to a basic system N, in which negation has no properties but the one of being a 'function.' A canonical model is defined in order to prove completeness. Among the extensions of N studied here, the one axiomatized by ( p → q) → (¬q → ¬p) and denoted as CoPC is the most striking. We succeed in interpreting minimal logic in CoPC.
To some extent, we connect with Franco Montagna's work, by considering the extensions of these logics by way of LC: ( p → q) ∨ (q → p). Such extensions represent weakening of the Gödel-Dummett logic. We conclude stating some remarks and ideas for further research.
The ex falso quodlibet or, as it is called in paraconsistent settings, the law of explosion (Carnielli et al. 2007), is the logical law expressing that any statement can be proved from a contradiction (or a falsehood). Classical logic, CPC, intuitionistic logic and many other systems consider ex falso to be valid. However, there has not always been widespread agreement about this. Some supporters of an intuitionistic standpoint, such as the early (Kolmogorov 1925), rejected ex falso. According to him, ex falso asserts something about a consequence of something 'impossible,' and hence, it is unacceptable. But, since Heyting's formalization of intuitionistic logic (Heyting 1934), it has been assumed as an axiom for such a system. In paraconsistent logic, it is necessary to reject ex falso, in order to allow for inconsistent theories and 'accept' contradictions 1 . We present in this paper minimal logic, CoPC and its subsystems as paraconsistent variations of intuitionistic logic.

Intuitionistic logic
The propositional language of IPC consists of a set P of propositional variables { p 0 , p 1 , p 2 , . . . }, the propositional constants ⊥, and the set of binary connectives L + (P). For any formula ϕ, its negation ¬ϕ is defined as ϕ → ⊥ (see Troelstra and van Dalen 2014). In practice, it is often more convenient to conceive formulas as containing both ¬ and ⊥, and to add . We take the axioms of IPC as in Troelstra and van Dalen (2014).

Kripke semantics for Intuitionistic logic
where W is a non-empty set of possible worlds and R is a partial order. For w ∈ W , R(w) denotes the upward closed set generated by w. Note that for every v ∈ W , w Rv iff v ∈ R(w). 1 Kolmogorov and Johansson's minimal intuitionistic logic is introduced as MIL in the 'big manifesto' paper on paraconsistency, in Carnielli et al. (2007).
Defining ¬ϕ as ϕ → ⊥, we get w ¬ϕ ⇔ ∀v(w Rv ⇒ v ϕ). We write V (ϕ) for {w|w ϕ}. We may emphasize a valuation V by writing V for , and sometimes we may stress the particular model and write M . We say that ϕ is Proof Straightforward by induction on the structure of ϕ.

Minimal logic as MPC f
The propositional language L f (P) consists of the language of IPC + to which a propositional constant f representing 'falsum' is added. Negation ¬ϕ is defined as ϕ → f . The axioms for minimal logic with f are just the axioms of IPC + .
Definition 3 A propositional Kripke frame of MPC f is a triple F = (W, R, F), where W is a non-empty set of possible worlds, R is a partial order and F ⊆ W is an upward closed set, intended to be {w ∈ W | w f }.
Kripke models are defined in the obvious way, adding the new clause: For negation, we get w ¬ϕ ⇔ ∀v((w Rv and v ϕ) ⇒ v f ). Observe that the semantics of f is essentially the same as for the propositional variables. Soundness of these models for MPC f is straightforward. Completeness was proved for such models already by Segerberg (1968), and more recently for a smaller class of models in Odintsov and Rybakov (2013). The canonical model is the quadruple M f = (W, R, F, V) defined as for intuitionistic logic, with the additional definition of F, as the set of theories with the disjunction property containing f : We drop the condition that the considered theories have to be consistent sets (i.e., we allow theories containing f ). The proof is a trivial modification of the one for intuitionistic logic.
The following proposition, known to Johansson, is easy to prove.

Proposition 1 Given an arbitrary formula ϕ,
where ¬ϕ is expressed as ϕ → f .
It follows that the notion of contradiction expressed by f in MPC f will be available in MPC ¬ as ¬ p ∧ ¬¬p.

Minimal logic as MPC ¬
In this second framework, the propositional language L ¬ (P) is just the language of intuitionistic logic, i.e., L ¬ = {∧, ∨, →, ¬}. This formulation is axiomatized by the axioms of IPC + , with the additional axiom This axiom expresses that the negation of ϕ holds, whenever ϕ leads to a contradiction. It does not give any further indication of what a contradiction is. If a formula ϕ proves ¬ψ and ψ, then ¬ϕ holds. And, the other way around, if ¬ϕ holds, then ϕ proves a contradiction (namely, ϕ and ¬ϕ).
The considered axiom was explicitly used by Johansson (1937) in his original article. However, it was previously introduced by Kolmogorov in the article that has been included in the book 'From Frege to Gödel: a source book in mathematical logic,' a collection by Heijenoort (1967). Kolmogorov says: 'The usual principle of contradiction: A judgment cannot be true and false, cannot be formulated in terms of an arbitrary judgment, implication, and negation. Our principle contains something else: namely, from it, together with the first axiom of implication, there follows the principle of reductio ad absurdum. ' From the axiom the principles of negative ex falso and absorption of negation, as we will call them, readily follow.
Kripke frames and models are defined as in the case of MPC f by means of the upward closed set F, using the following clause for negation: Soundness of these models is again a trivial matter. The canonical model for MPC ¬ is the quadruple M ¬ = (W, R, F, V) as before, with the new clause for F Δ ∈ F ⇔ for some formula ϕ, both ϕ and ¬ϕ are in Δ.
Again, we leave out the condition that the members of the canonical model have to be consistent sets.

Lemma 3 For every
Proof The right-to-left direction of the statement is trivial. We focus on the other direction. Assume Δ to be in F, and consider an arbitrary formula ψ. The definition of F gives us the existence of a contradiction in Δ, i.e., there is a formula ϕ in Δ, whose negation is also an element of Δ. The formulas ϕ and ¬ϕ both being logical consequences of Δ, imply Δ ϕ ∧ ¬ϕ. Lemma 2(1) leads us to Δ ¬ψ, via an application of modus ponens. The set Δ is a theory, and hence, ¬ψ ∈ Δ.
Completeness is proved as for intuitionistic logic. It is sufficient to prove that for any theory in the canonical model, membership relation and truth relation coincide. We prove the induction step concerning the negation ¬ϕ.
Proof The left to right goes by contraposition. Assume ¬ϕ / ∈ Δ, for Δ ∈ W. This gives us Δ ¬ϕ. By Lemma 2(2), Δ (ϕ → ¬ϕ) → ¬ϕ. Thus, Δ ϕ → ¬ϕ. This is equivalent to saying that the formula ¬ϕ is not a logical consequence of the set Δ ∪ {ϕ}. From the standard Lindenbaum type lemma, we get the existence of a theory Γ ∈ W, extending Δ ∪ {ϕ} and not containing ¬ϕ. Apply now Lemma 3, to get that Γ is not an element of F. Moreover, Γ ϕ by induction hypothesis. The last two results are equivalent to Γ ¬ϕ. The canonical model M ¬ being persistent, we conclude Δ ¬ϕ.

Basic subminimal logic: N
The propositional language coincides with the one for minimal logic with negation ¬. The semantics of negation is defined in terms of an auxiliary persistent function N . Different axioms attribute different properties to such a function. The aim of the Kripke semantics is that a negated formula ¬ϕ is true in a world if and only if that world is in the image where W is a non-empty set of possible worlds, R is a partial order on W and N is a function N : Kripke models are defined in the usual way, by adding a persistent valuation V to the frames. In order to have a correct semantics for N, we require the function N to have the following properties: Property P1 expresses locality, i.e., the value of a formula in a world w depends only on the value of such a formula in all worlds accessible from w. The second property, P2, expresses persistence of negation '¬.' Observe that it is not necessary to explicitly state P2 as a property, because it already follows from the fact that N maps upward closed sets to upward closed sets. We add it as an explicit requirement because it will be necessary to check it when building particular models. Note also that P1 expresses the validity of the axiom N, which can therefore be considered the axiom for the basic logic of a unary operator. The truth relation is defined as before, substituting the negation clause, for each formula ϕ, by w ¬ϕ ⇔ w ∈ N (V (ϕ)).
An important unsurprising consequence of P1 is that generated submodels preserve valuations.
Definition 5 Given a frame F = (W, R, F) and a world w ∈ W , the subframe F w generated by w is defined on the set of worlds R(w), with the function N w (U ) = N (U ) ∩ R(w), for every upward closed set U .
Similarly, M w is defined on the basis of the model M.

Lemma 4 Given
Proof We only unfold the induction step of the proof concerning the negation.
Soundness is a trivial matter. For proving completeness via a canonical model, we need to give an appropriate definition of N in such a model. The canonical model for N is M N = (W, R, N , V) is defined as in the minimal logic case, substituting the F clause with: for every U ∈ U(W), and where ϕ := { Γ ∈ W | ϕ ∈ Γ }. Again, the condition that the theories in the canonical model need to be consistent is left out. It still remains to be proved that such a canonical model is indeed a model on an N Kripke frame. Hence, we verify N to have properties P1 and P2.
Proof The proof goes as follows.

Theorem 2
The basic logic of unary operator N is complete with respect to the class of Kripke models defined above.
Proof By contraposition we prove: if Γ N ϕ, then Δ ϕ, for some Δ containing Γ in the canonical model. First we show by induction on ϕ that, for any Δ in the canonical model, Δ ϕ ⇔ ϕ ∈ Δ. We only treat the negation case. We need to prove that Δ ¬ϕ ⇔ ¬ϕ ∈ Δ.
It is worth remarking here that the axiom N is exactly what is needed to prove the substitution theorem, A few words in connection with Vakarelov (2005Vakarelov ( , 2006 are in order at this point. He considers a weak negation in combination with a strong negation in the sense of Nelson (1949), which makes it somewhat difficult to compare to our work. One of the systems he studied restricted to the weak negation can be seen as having the axiom ¬ϕ ↔ ((ϕ → f ) ∧ t) with additionally f implying t. For negation only this logic will be an extension of N, and in fact of CoPC, and a subsystem of MPC. We did not study it carefully yet.

Extensions of N
We present some extensions of the basic logic N. Each of the additional axioms will enrich the semantic function N with a different property.

Axioms of negation
Consider the following axioms.

Absorption of negation:
The contraposition axiom seems to express a very basic property of negation. Earlier, contraposition has been studied as a rule, instead of as an axiom (Došen 1999). Studying it as an axiom is quite natural: The deduction theorem remains in force, and the axiom N is a theorem in the contraposition system.
In Sect. 7.3, we will give a semantic proof of the fact that absorption of negation does not follow from contraposition. We already saw in Lemma 2 (1) that negative ex falso follows from contraposition.
Remark 1 Note that the contraposition instance that we are considering, denoted as CoPC, is the one valid in intuitionistic logic, while the instance (¬q → ¬p) → ( p → q) is not. Moreover, from the latter, the law of explosion follows. Thus, a logic in which (¬q → ¬p) → ( p → q) is accepted is no longer paraconsistent.
In what follows, we denote axiom 1 as An, and axiom 3 as NeF. We prove that minimal logic can also be axiomatized by CoPC + An. We study the logic CoPC, axiomatized by contraposition, and we will see later on that minimal logic and CoPC are closely related systems.

Proposition 2 Minimal logic MPC ¬ can be equivalently axiomatized by CoPC + An. In other words, MPC
Next, we prove CoPC and An in MPC ¬ .

MPC
-In MPC, we prove An.
In a similar way, it can be shown that minimal logic is equivalent to N + NeF + An.

Contraposition logic: CoPC
The Kripke-style semantics for this system is exactly the same as in N. An additional requirement for the function N needs to be specified. Indeed, the semantic function N needs to satisfy P1, P2 and anti-monotonicity: This property is basically the 'functional' equivalent of what CoPC expresses. Contraposition logic is complete with respect to the N Kripke frames satisfying P CoPC . The proof requires a different definition of the function N applied to U ∈ U(W) in the canonical model: We will just sketch the crucial step in the proof. Namely, the negation step in the proof of the truth lemma: for each formula ϕ and any Δ in the canonical model, Δ ϕ ⇔ ϕ ∈ Δ, and then only from right to left. So, assume the lemma holds for ϕ and all Γ , and let ¬ϕ ∈ Δ. We have to show Δ ¬ϕ, i.e., Δ ∈ N ( ϕ ). Take any ψ such that ψ ∩ R(Δ) ⊆ ϕ ; we need to show that ¬ψ ∈ Δ. We can easily see that ψ → ϕ has to be a member of Δ because otherwise by use of a Lindenbaum lemma Δ would have an extension containing ψ but not ϕ. But the axiom ((ψ → ϕ) → (¬ϕ → ¬ψ)) is in Δ and by assumption ¬ϕ also. Therefore, indeed ¬ψ ∈ Δ.

Negative ex falso: NeF
The Kripke semantics is just the same as for the basic logic N, with the additional requirement for the function N Negative ex falso characterizes exactly the N frames which satisfy P NeF . The logical system NeF is complete with respect to that class of frames. Similarly to the previous case, we need to define the function N in the canonical model in such a way that also P NeF is satisfied. The definition is the following: For both contraposition logic and negative ex falso logic, the finite model property holds. For the proof, theories within an adequate set have been used.

Relation between CoPC and minimal logic
We begin this section by giving an example of a derivation in CoPC.

Proposition 3
CoPC ¬¬¬ p → ¬p Proof The following is a Hilbert-style derivation in CoPC.
From this, we get that we do not need more than 3 negations in CoPC. 2 Corollary 1 CoPC ¬¬¬¬ p ↔ ¬¬p.
Proof The two directions of the proof go as follows.

Translating MPC into CoPC
In the first part of this section, we present a translation of minimal logic into contraposition logic. Presenting later a translation of intuitionistic logic into minimal logic, we get a 'chain' of interpretations between contraposition logic and classical logic. Recall that the 'negative' translation from classical logic into intuitionistic logic ensures that IPC has at least the same expressive power and consistency strength of classical logic (Troelstra and van Dalen 2014). A similar thing happens with Gödel's translation of IPC into the modal logic S4. Here, we establish a similar translation from minimal logic into CoPC.

Theorem 3
The considered translation is sound and truthful, i.e., Proof The proof goes by induction on the depth of a derivation. It suffices to check the axioms in which '¬' occurs. First, we need to show that i.e., CoPC (( p → q) ∧ ( p → (q → ¬q))) → ( p → ¬ p). Indeed, using only the positive fragment of intuitionistic and p → (q → ¬q). Now, from ( p → q) and ( p → ¬q) we get ( p → ¬p), just by means of IPC + and negative ex falso. Observe that the right-to-left direction follows from the fact that MPC ϕ ↔ ϕ ∼ .
It is worth noticing that the considered translation works also for the negative ex falso logic (instead of CoPC), and even for the basic logic N.

A translation of Intuitionistic logic into MPC
In the chain of interpretations a translation of intuitionistic logic into minimal logic was missing until recently (see Gaspar 2013). We have found one, in a letter from Johansson to Heyting from 1935 3 . In the margin, Heyting scribbled: 'My A → B is Johansson's A → B ∨ f ,' the idea being that for a proof of an implication it is sufficient to prove a contradiction. Johansson, on the same track, discovered on the way that the alterna- and leaves all the other connectives untouched, the result is a translation of intuitionistic logic into minimal logic. Nonetheless, the proof is not quite as straightforward as one might expect. The translation of the axioms is dealt with quite easily, but with modus ponens the following happens: suppose MPC ϕ h j and MPC (ϕ → ψ) h j . The latter means MPC ϕ h j → (ψ h j ∨ f ), which leads to MPC ψ h j ∨ f . This is not good enough though, because we need to get an MPC derivation of ψ h j . However, here the so-called disjunction property of minimal logic comes to the rescue. Indeed, whenever MPC A ∨ B, we have MPC A or MPC B 3 This correspondence has been studied with van der Molen (2016). (Johansson 1937). So, we have a derivation MPC ψ h j or MPC f . Clearly, the latter is not the case, and hence, we can conclude MPC ψ h j as desired. This argument can be found in one of the letters from Johansson to Heyting already. Moreover, Johansson argued that the considered translation can be extended to first-order logic, by means of (∀xϕ) h j = ∀x(ϕ(x) h j ∨ f ). Gaspar (2013) uses a closely related Friedman-Dragalin type translation, translating propositional variables p into p∨⊥. It is better behaved and works also for the consequence relations, not only for theorems such as the Heyting-Johansson translation. The idea behind this translation is the same as in the Heyting-Johansson translation but extended from proofs of implications to all proofs.

Linear frames
In this section, we want to analyze the frames of our systems in which the LC-axiom, i.e., ( p → q) ∨ (q → p), is valid. For each logic, the class of frames satisfying the considered formula corresponds to the class of upwards linear frames (Fig. 1).

Linear frames in minimal logic
In this section, we use n(w) to denote N (R(w)). The fact that we are dealing with linear frames make our lives easier. The reason why such a class of frames is interesting, is that, in a finite linear frame, every upward closed set is the set of successors of some world w, and hence, it is completely determined by its root. Here, we want to emphasize how the shape of the set n(w) in a linear frame of MPC depends on whether the world w makes f true, or not. Indeed: -If w / ∈ F, n(w) = F. -If w ∈ F, n(w) is the whole set, i.e., n(w) = W. Fig. 2 Condition two for N, NeF and CoPC

Linear frames in subminimal systems
In order to have a picture of the linear frames in the basic logic N, we need to understand how the locality condition gets implemented in this particular case. The condition turns out to be equivalent, in this setting, to: Hence, we get that if v is a successor of w, i.e., w Rv, locality imposes no restrictions, because we get w ∈ n(v) ⇔ w ∈ n(v) 4 . On the other hand, if v is a predecessor of w, w ∈ n(v) if and only if w ∈ n(w). The set {w ∈ W |w ∈ n(w)} plays therefore an important role and represents a weakened form of F. We shall denote this set in this section therefore as F. Indeed it has some of the properties of the F of MPC, since in For the case of N, we can then state the conditions as: The first condition is the same for all the systems between N and MPC. The second condition varies with the strength of the logic. In the case of NeF, the second condition is influenced by the properties of F and the axiom p ∧ ¬p → ¬q, and becomes: -If w ∈ F, then n(w) ⊇ F. 4 Similarly, there are no restrictions by locality on N (U ) for U = ∅.
In the case of CoPC, such a second condition remains in force, together with the condition that: w Rv ⇒ n(w) ⊆ n(v) ⊆ N (∅) (Fig. 2).

Counterexamples
In the last part of this section, we give two examples to show how the different axioms we are considering are logically related to each other.

Proposition 4 Absorption of negation An is not a theorem in CoPC.
Proof (Fig. 3) The idea is that we consider a linear finite CoPC frame in which the set F is a proper subset of W and, for every upward closed set U , N (U ) = F. In this way, by assigning a valuation V ( p) ⊆ F for some propositional variable p, we get that every world v / ∈ F does not force ¬ p, while it forces the implication p → ¬p. Observe that a frame in which N (U ) = F for every U is indeed a CoPC frame. The only thing we need to check is the locality condition, given that the other two properties trivially hold. Also locality is quite trivial, given that w ∈ N (U ) if and only if w ∈ F, which again would be equivalent to w ∈ N (U ∩ R(w)).

Proposition 5 Contraposition CoPC is not a theorem of N.
Proof (Fig. 4) For obtaining an N model in which CoPC does not hold, it is enough to consider an arbitrary finite linear frame such that n(w) = R(w) for every world. For the sake of simplicity, letw be the greatest world in the frame, and assign a valuation such that V ( p) = {w} and V (q) = R(v), where v =w, for some propositional variables p, q. Indeed, the world v forces the implication p → q. On the other hand though, ¬q is true in v, while ¬ p is not. Therefore, CoPC is not valid on the considered frame. Note again that the function N defined as we did is persistent. Moreover, whenever w ∈ N (R(v)) for some v, this means that R(w) ⊆ R(v), and hence, w ∈ N (R(v) ∩ R(w)) amounts to w ∈ N (R(w)) = n(w), which is true by definition. For the other direction, again, saying that w ∈ N (R(v) ∩ R(w)) for some v implies that R(w) ⊆ R(v) ∩ R(w) which indeed means R(w) ⊆ R(v). The definition on N implies w ∈ n(v) = N (R(v)), as desired.

Conclusions and further research
The main purpose of this paper was to explore and analyze minimal logic with negation as a primitive and its subminimal subsystems with a weaker negation. We concentrate on a basic logic N where negation is just a unary operator without additional properties, and on two of its extensions: contraposition logic and negative ex falso. The semantics of negation is defined in terms of a persistent function N on the set of upward closed sets of a Kripke model. Completeness can be proved by means of canonical models. We show that CoPC interprets MPC by means of a sound translation, and complete the chain of translations from CoPC to CPC by a translation of IPC into MPC appearing in the correspondence between Johansson and Heyting in 1935. For future work, the first step is allowing the negation function N to be partial (compare to neighborhood models of modal logic Došen 1989;Kracht and Wolter 1999). This produces more natural and general canonical models. The corresponding algebras for a study of duality are Heyting algebras (see, e.g., Bezhanishvili et al. 2016). There is a close relationship between our locality condition and the algebraic notion of compatible function of Caicedo and Cignoli (2001) (see also Ertola et al. 2007) that needs to be clarified.
The above-mentioned translations are effective for firstorder logic as well, and in general there are many interesting questions about first-order logic. It is also already clear that the systems are very suitable for introduction of cut-free sequent systems to prove properties such as interpolation.
The study of the models of weak Gödel-Dummett logic, which provides a bridge to the work of Franco Montagna, can be extended by looking at the behavior of the logics on the models (0,1] and [0,1]. Here also the algebras and the proof theory (Metcalfe and Montagna (2007)) seem well worth studying.
Finally, the structure of the lattice of all logics between N and minimal logic is intriguing. Certainly it will contain infinitely many logics.