This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

This paper presents an outline of a new theory of relevant deduction which arose from the purpose of solving paradoxes in various fields of analytic philosophy. In distinction to relevance logics, this approach does not replace classical logic by a new one, but distinguishes between relevance and validity. It is argued that irrelevant arguments are, although formally valid, nonsensical and even harmful in practical applications. The basic idea is this: a valid deduction is relevant iff no subformula of (...) the conclusion is replaceable on some of its occurrences by any other formula salva validitate of the deduction. The paper first motivates the approach by showing that four paradoxes seemingly very distant from each other have a common source. Then the exact definition of relevant deduction is given and its logical properties are investigated. An extension to relevance of premises is discussed. Finally the paper presents an overview of its applications in philosophy of science, ethics, cognitive psychology and artificial intelligence. (shrink)

The structure of derivations in natural deduction is analyzed through isomorphism with a suitable sequent calculus, with twelve hidden convertibilities revealed in usual natural deduction. A general formulation of conjunction and implication elimination rules is given, analogous to disjunction elimination. Normalization through permutative conversions now applies in all cases. Derivations in normal form have all major premisses of elimination rules as assumptions. Conversion in any order terminates.Through the condition that in a cut-free derivation of the sequent Γ⇒C, no (...) inactive weakening or contraction formulas remain in Γ, a correspondence with the formal derivability relation of natural deduction is obtained: All formulas of Γ become open assumptions in natural deduction, through an inductively defined translation. Weakenings are interpreted as vacuous discharges, and contractions as multiple discharges. In the other direction, non-normal derivations translate into derivations with cuts having the cut formula principal either in both premisses or in the right premiss only. (shrink)

I discuss three elements of Dennis Schulting’s new book on the transcendental deduction of the pure concepts of the understanding, or categories. First, that Schulting gives a detailed account of the role of each individual category. Second, Schulting’s insistence that the categories nevertheless apply ‘en bloc’. Third, Schulting’s defence of Kant’s so-called reciprocity thesis that subjective unity of consciousness and objectivity in the sense of cognition’s objective purport are necessary conditions for the possibility of one another. I endorse these (...) fascinating but unfashionable claims and sketch my own version of what they amount to, which is quite different to Schulting’s own construal. I point to some fundamental limitations and problems for Schulting’s position and argue that his project needs to be reshaped or at least reconceived in the face of them. Even if Schulting’s argument is sound, it does not provide a deduction, properly speaking, of the categories. (shrink)

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic versions (...) of the connectives in question. (shrink)

In focusing on the systematic deduction of the categories from a principle, Schulting takes up anew the controversial project of the eminent German Kant scholar Klaus Reich, whose monograph “The Completeness of Kant's Table of Judgments” made the case that the logical functions of judgement can all be derived from the objective unity of apperception and can be shown to link up with one another systematically. -/- Common opinion among Kantians today has it that Kant did not mean to (...) derive the functions of judgement, and accordingly the categories, from the principle of apperception. Schulting challenges this standard view and aims to resuscitate the main motivation behind Reich’s project. He argues, in agreement with Reich’s main thesis about the derivability of the functions of judgement, that Kant indeed does mean to derive, in full a priori fashion, the categories from the principle of apperception. -/- Schulting also shows that, given the general assumptions of the Critical philosophy, Kant's derivation is successful and that absent an account of the derivation of the categories from apperception, the B-Deduction cannot really be understood. -/- New edition. First published 2012 as „Kant’s Deduction and Apperception. Explaining the Categories" (Palgrave Macmillan). (shrink)

We present a natural deduction system for dual-intuitionistic logic. Its distinctive feature is that it is a single-premise multiple-conclusions system. Its relationships with the natural deduction systems for intuitionistic and classical logic are discussed.

Curry's paradox, sometimes described as a general version of the better known Russell's paradox, has intrigued logicians for some time. This paper examines the paradox in a natural deduction setting and critically examines some proposed restrictions to the logic by Fitch and Prawitz. We then offer a tentative counterexample to a conjecture by Tennant proposing a criterion for what is to count as a genuine paradox.

In the Critique of Practical Reason, Kant presents the moral law as the sole ‘fact of pure reason’ that neither needs nor admits of a deduction to establish its authority. This claim may come as a surprise to many readers of his earlier Groundwork of the Metaphysics of Morals. In the last section of the Groundwork, Kant seemed to offer a sketch of just such a ‘deduction of the supreme principle of morality’ . Although notoriously obscure, this sketch (...) shows that Kant hoped to base the moral law in the freedom that rational agents can claim as members of the ‘intelligible world’ that transcendental idealism makes available to us. In contrast, the second Critique abandons all aspirations of deriving morality from more basic notions of freedom and practical rationality. (shrink)

We investigate how the perceived uncertainty of a conditional affects a person's choice of conclusion. We use a novel procedure to introduce uncertainty by manipulating the conditional probability of the consequent given the antecedent. In Experiment 1, we show first that subjects reduce their choice of valid conclusions when a conditional is followed by an additional premise that makes the major premise uncertain. In this we replicate Byrne. These subjects choose, instead, a qualified conclusion expressing uncertainty. If subjects are given (...) a third statement that qualifies the likelihood of the additional premise, then the uncertainty of the conclusions they choose is systematically related to the suggested uncertainty. Experiment 2 confirms these observations in problems that omit the additional premise and qualify the first premise directly. Experiment 3 shows that the qualifying statement also affects the perceived probability of the consequent given the antecedent of the conditional. Experiment 4 investigates the effect of suggested uncertainty on the fallacies and shows that increases in uncertainty reduce the number of certain conclusions that are chosen while affirming the consequent but have no effect on denying the antecedent. We discuss our results in terms of rule theories and mental models and conclude that the latter give the most natural account of our results. (shrink)

. This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics. These logics are used, in particular, for reasoning about systems where paradoxes do not lead to the `deductive explosion', i.e., where formulae of the type `A follows from false', for any A, are not valid. We formulate the natural deduction system for the logic PCont, explain its main concepts, (...) define a proof searching technique and illustrate it by examples. The presentation is accompanied by demonstrating the correctness of these developments. (shrink)

It is often assumed that Fichte's aim in Part I of the System of Ethics is to provide a deduction of the moral law, the very thing that Kant – after years of unsuccessful attempts – deemed impossible. On this familiar reading, what Kant eventually viewed as an underivable 'fact' (Factum), the authority of the moral law, is what Fichte traces to its highest ground in what he calls the principle of the 'I'. However, scholars have largely overlooked a (...) passage in the System of Ethics where Fichte explicitly invokes Kant's doctrine of the fact of reason with approval, claiming that consciousness of the moral law grounds our belief in freedom (GA I/5:65). On the reading I defend, Fichte's invocation of the Factum is consistent with the structure of Part I when we distinguish (a) the feeling of moral compulsion from (b) the moral law itself. (shrink)

The concepts of question evocation and erotetic implication play central role in Inferential Erotetic Logic. In this paper, deduction theorems for question evocation and erotetic implication are proven. Moreover, it is shown how question evocation by a finite non-empty set of declaratives can be reduced to question evocation by the empty set, and how erotetic implication based on a finite non-empty set of declaratives can be reduced to a relation between questions only.

In this paper I focus on two contrasting concepts of deduction and induction that have appeared in introductory (formal) logic texts over the past 75 years or so. According to the one, deductive and inductive arguments are defined solely by reference to what arguers claim about the relation between the premises and the conclusions. According to the other, they are defined solely by reference to that relation itself. Arguing that these definitions have defects that are due to their simplicity, (...) I develop definitions that remove these defects by assigning a combination of roles to both arguers’ claims concerning the premises/conclusion relation and the relation itself. Along the way I also present and briefly defend definitions of both deductive and inductive validity that are significantly different from the norm. (shrink)

We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some (...) point on the diagonal. Thus, they are just like the epistemic operators for apriority and its dual. We take this extension of Fitch’s familiar derivation system to be a very natural one, since the new rules and labeled lines hereby introduced preserve the structure of Fitch’s own rules for the modal case. (shrink)

In this paper logics defined by finite Sugihara matrices, as well as RM itself, are discussed both in their matrix (semantical) and in syntactical version. For each such a logic a deduction theorem is proved, and a few applications are given.

Introduction The central aim of this book is to focus attention upon and illuminate the character of a certain phase of philosophical reflection: namely, ...

The relation between logic and thought has long been controversial, but has recently influenced theorizing about the nature of mental processes in cognitive science. One prominent tradition argues that to explain the systematicity of thought we must posit syntactically structured representations inside the cognitive system which can be operated upon by structure sensitive rules similar to those employed in systems of natural deduction. I have argued elsewhere that the systematicity of human thought might better be explained as resulting from (...) the fact that we have learned natural languages which are themselves syntactically structured. According to this view, symbols of natural language are external to the cognitive processing system and what the cognitive system must learn to do is produce and comprehend such symbols. In this paper I pursue that idea by arguing that ability in natural deduction itself may rely on pattern recognition abilities that enable us to operate on external symbols rather than encodings of rules that might be applied to internal representations. To support this suggestion, I present a series of experiments with connectionist networks that have been trained to construct simple natural deductions in sentential logic. These networks not only succeed in reconstructing the derivations on which they have been trained, but in constructing new derivations that are only similar to the ones on which they have been trained. (shrink)

This is a companion paper to Braüner where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem. Moreover, we give an axiom system first-order (...) hybrid logic. (shrink)

In this paper, we introduce the notion of dual Post’s negation and an infinite class of Dual Post’s finitely-valued logics which differ from Post’s ones with respect to the definitions of negation and the sets of designated truth values. We present adequate natural deduction systems for all Post’s k-valued ) logics as well as for all Dual Post’s k-valued logics.

In this paper, we present sound and complete natural deduction systems for Fitting’s four-valued generalizations of Kleene’s three-valued regular logics.

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a (...) way that restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction-and cut-free sequent calculus equivalent to the Hubert system for basic modal logic shows the standard failure argument untenable by proving the underivability of DA from A. (shrink)

James Van Cleve has argued that Kant’s Transcendental Deduction of the categories shows, at most, that we must apply the categories to experience. And this falls short of Kant’s aim, which is to show that they must so apply. In this discussion I argue that once we have noted the differences between the first and second editions of the Deduction, this objection is less telling. But Van Cleve’s objection can help illuminate the structure of the B Deduction, (...) and it suggests an interesting reason why the rewriting might have been thought necessary. (shrink)

It is commonly claimed that the conclusion of a valid deductive argument is contained in its premises and says nothing new. In 'Deduction and Novelty,' in The Reasoner 5 (4), pp. 56-57, I refuted that claim. In The Reasoner, 8 (3), pp. 24-25, David McBride criticised my refutation. I show that McBride’s arguments are unsound.

This presentation of Aristotle's natural deduction system supplements earlier presentations and gives more historical evidence. Some fine-tunings resulted from conversations with Timothy Smiley, Charles Kahn, Josiah Gould, John Kearns,John Glanvillle, and William Parry.The criticism of Aristotle's theory of propositions found at the end of this 1974 presentation was retracted in Corcoran's 2009 HPL article "Aristotle's demonstrative logic".

In this paper we present labelled sequent calculi and labelled natural deduction calculi for the counterfactual logics CK + {ID, MP}. As for the sequent calculi we prove, in a semantic manner, that the cut-rule is admissible. As for the natural deduction calculi we prove, in a purely syntactic way, the normalization theorem. Finally, we demonstrate that both calculi are sound and complete with respect to Nute semantics [12] and that the natural deduction calculi can be effectively (...) transformed into the sequent calculi. (shrink)

Natural Deduction Natural Deduction is a common name for the class of proof systems composed of simple and self-evident inference rules based upon methods of proof and traditional ways of reasoning that have been applied since antiquity in deductive practice. The first formal ND systems were independently constructed in the 1930s by G. Gentzen and S. Jaśkowski and … Continue reading Natural Deduction →.

We can formalize judgments as logical formulas. Judgment aggregation deals with judgments of several agents, which need to be aggregated to a collective judgment. There are several logical formalizations of judgment aggregation. This paper focuses on a modal formalization which nicely expresses classical properties of judgment aggregation rules and famous results of social choice theory, like Arrow’s impossibility theorem. A natural deduction system for modal logic of judgment aggregation is presented in this paper. The system is sound and complete. (...) As an example of derivation, a formal proof of Arrow’s impossibility theorem is given. (shrink)

Developing a suggestion by Russell, Prawitz showed how the usual natural deduction inference rules for disjunction, conjunction and absurdity can be derived using those for implication and the second order quantifier in propositional intuitionistic second order logic NI\. It is however well known that the translation does not preserve the relations of identity among derivations induced by the permutative conversions and immediate expansions for the definable connectives, at least when the equational theory of NI\ is assumed to consist only (...) of \- and \-equations. On the basis of the categorial interpretation of NI\, we introduce a new class of equations expressing what in categorial terms is a naturality condition satisfied by the transformations interpreting NI\-derivations. We show that the Russell–Prawitz translation does preserve identity of proof with respect to the enriched system by highlighting the fact that naturality corresponds to a generalized permutation principle. Finally we sketch how these results could be used to investigate the properties of connectives definable in the framework of higher-level rules. (shrink)

This paper defends the view that the classification of an argument as being deductive ought to rest exclusively upon psychological considerations; specifically, upon whether the argument's author holds certain beliefs. This account is justified on theoretical and pedagogical grounds, and situated within a general taxonomy of competing proposals. Epistemological difficulties involved in the application of psychological definitions are recognized but claimed to be ineliminable from the praetice of argumentation. The paper concludes by discussing embryonic arguments where the author's relevant beliefs (...) are not sufficiently fine-grained so as to accord the argument deductive or inductive status. (shrink)

The paper deals with two versions of the fragment with unit, tensor, linear implication and storage operator of intuitionistic linear logic. The first version, ILL, appears in a paper by Benton, Bierman, Hyland and de Paiva; the second one, ILL+, is described in this paper. ILL has a contraction rule and an introduction rule !I for the exponential; in ILL+, instead of a contraction rule, multiple occurrences of labels for assumptions are permitted under certain conditions; moreover, there is a different (...) introduction rule for the exponential, !I+, which is closer in spirit to the necessitation rule for the normalizable version of S4 discussed by Prawitz in his monograph “Natural Deduction”.It is relatively easy to adapt Prawitz's treatment of natural deduction for intuitionistic logic to ILL+; in particular one can formulate a notion of strong validity permitting a proof of strong normalization.The conversion rules for ILL explicitly mentioned in the paper by Benton et al. do not suffice for normal forms with subformula property, but we can show that this can be remedied by addition of a special permutation conversion plus some “satellite” permutation conversions.Some discussion of the categorical models which might correspond to ILL+ is given. (shrink)

It is tempting to think that multi premise closure creates a special class of paradoxes having to do with the accumulation of risks, and that these paradoxes could be escaped by rejecting the principle, while still retaining single premise closure. I argue that single premise deduction is also susceptible to risks. I show that what I take to be the strongest argument for rejecting multi premise closure is also an argument for rejecting single premise closure. Because of the symmetry (...) between the principles, they come as a package: either both will have to be rejected or both will have to be revised. (shrink)

It is often taken for granted by writers who propose--and, for that matter, by writers who oppose--'justifications' of inductions, that deduction either does not need, or can readily be provided with, justification. The purpose of this paper is to argue that, contrary to this common opinion, problems analogous to those which, notoriously, arise in the attempt to justify induction, also arise in the attempt to justify deduction.

Extant semantic theories for languages containing vague expressions violate intuition by delivering the same verdict on two principles of classical propositional logic: the law of noncontradiction and the law of excluded middle. Supervaluational treatments render both valid; many-Valued treatments, Neither. The core of this paper presents a natural deduction system, Sound and complete with respect to a 'mixed' semantics which validates the law of noncontradiction but not the law of excluded middle.

Henry E. Allison presents an analytical and historical commentary on Kant`s transcendental deduction of the pure concepts of the understanding in the Critique of Pure Reason. He argues that, rather than providing a new solution to an old problem, it addresses a new problem, and he traces the line of thought that led Kant to the recognition of the significance of this problem in his 'pre-critical' period. In addition to the developmental nature of the account of Kant`s views presented (...) here, two distinctive features of Allison's reading of the deduction are a defense of Kant`s oft criticized claim that the conformity of appearances to the categories must be unconditionally rather than merely conditionally necessary and an insistence that the argument cannot be separated from Kant`s transcendental idealism. (shrink)

For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the conclusion? This is the problem I address here. I begin by considering and rejecting several accounts of informational content. I (...) then develop an account on which informational contents are indeterminate in their membership. This allows there to be cases in which it is indeterminate whether a given deduction is informative. Nevertheless, on the picture I present, there are determinate cases of informative (and determinate cases of uninformative) inferences. I argue that the model I offer is the best way for an account of content to respect the meaning of the logical constants and the inference rules associated with them without collapsing into a classical picture of content, unable to account for informative deductive inferences. (shrink)

Classical accounts of intertheoretic reduction involve two pieces: first, the new terms of the higher-level theory must be definable from the terms of the lower-level theory, and second, the claims of the higher-level theory must be deducible from the lower-level theory along with these definitions. The status of each of these pieces becomes controversial when the alleged reduction involves an infinite limit, as in statistical mechanics. Can one define features of or deduce the behavior of an infinite idealized system from (...) a theory describing only finite systems? In this paper, I change the subject in order to consider the motivations behind the definability and deducibility requirements. The classical accounts of intertheoretic reduction are appealing because when the definability and deducibility requirements are satisfied there is a sense in which the reduced theory is forced upon us by the reducing theory and the reduced theory contains no more information or structure than the reducing theory. I will show that, likewise, there is a precise sense in which in statistical mechanics the properties of infinite limiting systems are forced upon us by the properties of finite systems, and the properties of infinite systems contain no information beyond the properties of finite systems. (shrink)

One of the strongest motivations for conceptualist readings of Kant is the belief that the Transcendental Deduction is incompatible with nonconceptualism. In this article, I argue that this belief is simply false: the Deduction and nonconceptualism are compatible at both an exegetical and a philosophical level. Placing particular emphasis on the case of non-human animals, I discuss in detail how and why my reading diverges from those of Ginsborg, Allais, Gomes and others. I suggest ultimately that it is (...) only by embracing nonconceptualism that we can fully recognise the delicate calibration of the trap which the Critique sets for Hume. (shrink)

We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.

I argue, contrary to Dennis Schulting inKant’s Radical Subjectivism, that the main reasoning of Kant’s transcendental deduction of the categories is progressive, not regressive. Schulting is right, however, to emphasize that the deduction takes the object cognized to be constituted in an idealism-entailing way. But his reasoning has gaps and bypasses Kant’s most explicit deduction argument, independent of the Transcendental Aesthetic, for idealism. Finally, Schulting’s claim that Kantian discursivity itself requires idealism overlooks the fact that Kantian general (...) judgements can be true in a domain of objects without being specificallyofor about any particular ones of those objects. (shrink)

Gentzen's “Untersuchungen” [1] gave a translation from natural deduction to sequent calculus with the property that normal derivations may translate into derivations with cuts. Prawitz in [8] gave a translation that instead produced cut-free derivations. It is shown that by writing all elimination rules in the manner of disjunction elimination, with an arbitrary consequence, an isomorphic translation between normal derivations and cut-free derivations is achieved. The standard elimination rules do not permit a full normal form, which explains the cuts (...) in Gentzen's translation. Likewise, it is shown that Prawitz' translation contains an implicit process of cut elimination. (shrink)