Several proof-theoretic notions of validity have been proposed in the literature, for which completeness of intuitionistic logic has been conjectured. We define validity for intuitionistic propositional logic in a way which is common to many of these notions, emphasizing that an appropriate notion of validity must be closed under substitution. In this definition we consider atomic systems whose rules are not only production rules, but may include rules that allow one to discharge assumptions. Our central result shows that Harrop’s rule (...) is valid under substitution, which refutes the completeness conjecture for intuitionistic logic. (shrink)

The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister. Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible when (...) the right introduction rules are taken as the definitions of the logical constants and vice versa. This generalizes the well-known relationship between introduction and elimination rules in natural deduction to the framework of the sequent calculus. (shrink)

The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister . Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible (...) when the right introduction rules are taken as the definitions of the logical constants and vice versa. This generalizes the well-known relationship between introduction and elimination rules in natural deduction to the framework of the sequent calculus. (shrink)

The introduction and elimination rules for material implication in natural deduction are not complete with respect to the implicational fragment of classical logic. A natural way to complete the system is through the addition of a new natural deduction rule corresponding to Peirce's formula → A) → A). E. Zimmermann [6] has shown how to extend Prawitz' normalization strategy to Peirce's rule: applications of Peirce's rule can be restricted to atomic conclusions. The aim of the present paper is to extend (...) Seldin's normalization strategy to Peirce's rule by showing that every derivation Π in the implicational fragment can be transformed into a derivation Π' such that no application of Peirce's rule in Π' occurs above applications of →-introduction and →-elimination. As a corollary of Seldin's normalization strategy we obtain a form of Glivenko's theorem for the classical {→}-fragment. (shrink)

We examine the proof-theoretic verificationist justification procedure proposed by Dummett. After some scrutiny, two distinct interpretations with respect to bases are advanced: the independent and the dependent interpretation. We argue that both are unacceptable as a semantics for propositional intuitionistic logic.

JOHN CORCORAN AND WAGNER SANZ, Disbelief Logic Complements Belief Logic. Philosophy, University at Buffalo, Buffalo, NY 14260-4150 USA E-mail: [email protected] Filosofia, Universidade Federal de Goiás, Goiás, GO 74001-970 Brazil E-mail: [email protected] -/- Consider two doxastic states belief and disbelief. Belief is taking a proposition to be true and disbelief taking it to be false. Judging also dichotomizes: accepting a proposition results in belief and rejecting in disbelief. Stating follows suit: asserting a proposition conveys belief and denying conveys disbelief. Traditional logic (...) implicitly focused on logical relations and processes needed in expanding and organizing systems of beliefs. Deducing a conclusion from beliefs results in belief of the conclusion. Deduction presupposes consequence: one proposition is a consequence of a set of a propositions if the latter logically implies the former. The role of consequence depends on its being truth-preserving: every consequence of a set of truths is true. This paper, which builds on previous work by the second author, explores roles of logic in expanding and organizing systems of disbeliefs. Aducing a conclusion from disbeliefs results in disbelief of the conclusion. Aduction presupposes contrequence: one proposition is a contrequence of a set of propositions if the set of negations or contradictory opposites of the latter logically implies that of the former. The role of contrequence depends on its being falsity-preserving: every contrequence of a set of falsehoods is false. A system of aductions that includes, for every contrequence of a given set, an aduction of the contrequence from the set is said to be complete. Historical and philosophical discussion is illustrated and enriched by presenting complete systems of aductions constructed by the second author. One such, a natural aduction system for Aristotelian categorical propositions, is based on a natural deduction system attributed to Aristotle by the first author and others. ADDED NOTE: Wagner Sanz reconstructed Aristotle’s logic the way it would have been had Aristole focused on constructing “anti-sciences” instead of sciences: more generally, on systems of disbeliefs. (shrink)

In this paper we are going to examine intuitionistic sequent calculus and its negation rules. We state new negation rules defining, in this way, a new sequent system. It will be used to clarify Gentzen's NJ and LJ systems isomorphism. These new negation rules are a direct reading of new natural deduction negation rules obtained by a slight modification of NJ rules. We also show that the new system is equivalent to LJ and that the Hauptsatz holds for it.

Após uma breve análise do problema da relação de relevancia entre o antecedente e o consequente de um condicional, fazemos uma análise de qual deve ser a estrutura de um critério de adequação para uma definição de relevancia em uma demonstração.

In the present paper we analyse how intuitionist negation relates to the concept of triviality. A proposition is trivial if it implies every other proposition. We claim that for natural deduction intuitionist logic such concept affords us a negation introduction rule schema that corresponds by the inversion principle to the usual negation elimination shcema, ex contradictionerm quodlibet.1.