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.
I take up Kant's remarks about a "transcendental deduction" of the "concepts of space and time" (A87/B119-120). I argue for the need to make a clearer assessment of the philosophical resources of the Aesthetic in order to account for this transcendental deduction. Special attention needs to be given to the fact that the central task of the Aesthetic is simply the "exposition" of these concepts. The Metaphysical Exposition reflects upon facts about our usage to reveal our commitment to (...) the idea that these concepts refer to pure intuitions. But the legitimacy of these concepts still hangs in the balance: these concepts may turn out to refer to nothing real at all. The subsequent Transcendental Exposition addresses this issue. The objective validity of the concepts of space and time, and hence their transcendental deduction, hinges on careful treatment of this last point. (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)
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)
This book offers a thoroughgoing, analytic account of the first half of the Transcendental Deduction of the Categories in the B-edition of Kant's Critique of Pure Reason that is different from existing interpretations in at least one important aspect: its central claim is that each of the 12 categories is wholly derivable from the principle of apperception, which goes against the current view that the Deduction is not a proof in a strict philosophical sense and the standard reading (...) that in the Deduction Kant only gives an account of the global applicability of the categories to experience. This novel approach enables a reappraisal of Kant's controversial claim that transcendental self-consciousness is not only a necessary condition of objective experience but also (formally) sufficient for it. The book provides an extensive analysis of Kant's theory of transcendental apperception and also explains why the argument of the Transcendental Deduction is both a regressive and a progressive argument. (shrink)
This essay partly builds on and partly criticizes a striking idea of Dieter Henrich. Henrich argues that Kant's distinction in the first Critique between the question of fact (quid facti) and the question of law (quid juris) provides clues to the argumentative structure of a philosophical "Deduction". Henrich suggests that the unity of apperception plays a role analogous to a legal factum. By contrast, I argue, first, that the question of fact in the first Critique is settled by the (...) Metaphysical Deduction, which establishes the purity of origin of the Categories, and, second, that in the second Critique, the relevant factum is the Fact of Reason, which amounts to the fact that the Moral Law is pure in origin. (shrink)
In the transcendental deduction, the central argument of the Critique of Pure Reason, Kant seeks to secure the objective validity of our basic categories of thought. He distinguishes objective and subjective sides of this argument. The latter side, the subjective deduction, is normally understood as an investigation of our cognitive faculties. It is identified with Kant’s account of a threefold synthesis involved in our cognition of objects of experience, and it is said to precede and ground Kant’s proof (...) of the validity of the categories in the objective deduction. I challenge this standard reading of the subjective deduction, arguing, first, that there is little textual evidence for it, and, second, that it encourages a problematic conception of how the deduction works. In its place, I present a new reading of the subjective deduction. Rather than being a broad investigation of our cognitive faculties, it should be seen as addressing a specific worry that arises in the course of the objective deduction. The latter establishes the need for a necessary connection between our capacities for thinking and being given objects, but Kant acknowledges that his readers might struggle to comprehend how these seemingly independent capacities are coordinated. Even worse, they might well believe that in asserting this necessary connection, Kant’s position amounts to an implausible subjective idealism. The subjective deduction ismeant to allay these concerns by showing that they rest on a misunderstanding of the relation between these faculties. This new reading of the subjective deduction offers a better fit with Kant’s text. It also has broader implications, for it reveals the more philosophically plausible account of our relation to the world as thinkers that Kant is defending – an account that is largely obscured by the standard reading of the subjective deduction. (shrink)
Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper (...) "Ein Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie"; online available at http://philpapers.org/rec/CORERE.). (shrink)
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)
I present an argument that negation is a problem for proof-theoretic semantics: it's meaning cannot be defined by rules of inference, and that's particularly problematic for Dummett's and Prawitz' Justification of Deduction. I won the Jacobsen Essay Price of the University of London for this essay a few years ago.
This article is a modified version in translation of the original Dutch version that appeared in Tijdschrift voor Filosofie 4 (2010) / * Inspired by Kant's account of intuition and concepts, John McDowell has forcefully argued that the relation between sensible content and concepts is such that sensible content does not severally contribute to cognition but always only in conjunction with concepts. This view is known as conceptualism. Recently, Robert Hanna and Lucy Allais, among others, have brought against this view (...) the charge that it neglects the possibility of the existence of essentially non-conceptual content that is not conceptualized or subject to conceptualization. Their defence against McDowell amounts to non-conceptualism. Both views believe that intuition is synthesized content in Kant's sense. In this article I am particularly interested in how their views are true to Kant. I argue that although McDowell is right that intuition is only epistemically relevant in conjunction with concepts, I also believe that Hanna and Allais are right with regard to the existence of essentially non-conceptual content, but that they are wrong with regard to intuition being synthesized content in Kant's sense. I also point out the common failure to take account of the modal nature of Kant's argument for the relation between intuition and concept. (shrink)
This paper considers how Descartes's and Hume's sceptical challenges were appropriated by Christian Wolff and Johann Nicolaus Tetens specifically in the context of projects related to Kant's in the transcendental deduction. Wolff introduces Descartes's dream hypothesis as an obstacle to his account of the truth of propositions, or logical truth, which he identifies with the 'possibility' of empirical concepts. Tetens explicitly takes Hume's account of our idea of causality to be a challenge to the `reality' of transcendent concepts in (...) general, a challenge he addresses by locating the source of this concept in the understanding rather than in the imagination. After considering this background, I turn to Kant's deployment of apparently traditional sceptical concerns at the outset of the transcendental deduction and argue that he does not there intend to introduce a global sceptical challenge and, accordingly, that there are historical grounds for doubting that the transcendental deduction is intended as an anti-sceptical argument. (shrink)
This paper contains a critical analysis of the interpretation of Kant?s second edition version of the Transcendental Deduction offered by Be ´atrice Longuenesse in her recent book: Kant and the Capacity to Judge. Though agreeing with much of Longuenesse?s analysis of the logical function of judgment, I question the way in which she tends to assign them the objectifying role traditionally given to the categories. More particularly, by way of defending my own interpretation of the Deduction against some (...) of her criticisms, I argue that Longuenesse fails to show how either part of the two-part proof may be plausibly thought to have established the necessity of the categories (as opposed to the logical functions). Finally, I question certain aspects of her ?radical? interpretation of the famous footnote at B160-1, where Kant distinguishes between ?form of intuition? and ?formal intuition? (shrink)
This article studies the mathematical properties of two systems that model Aristotle's original syllogistic and the relationship obtaining between them. These systems are Corcoran's natural deduction syllogistic and Lukasiewicz's axiomatization of the syllogistic. We show that by translating the former into a first-order theory, which we call T RD, we can establish a precise relationship between the two systems. We prove within the framework of first-order logic a number of logical properties about T RD that bear upon the same (...) properties of the natural deduction counterpart ? that is, Corcoran's system. Moreover, the first-order logic framework that we work with allows us to understand how complicated the semantics of the syllogistic is in providing us with examples of bizarre, unexpected interpretations of the syllogistic rules. Finally, we provide a first attempt at finding the structure of that semantics, reducing the search to the characterization of the class of models of T RD. (shrink)
Kant wrote two versions of the Transcendental Deduction, the first, “A-”Deduction in 1781, and the second, “B-”Deduction in 1787. Since Henrich's “The Proof Structure of Kant's Transcendental Deduction”, most work on the Transcendental Deduction attempts to make sense of the B-Deduction's two-step argument structure. Though the A-Deduction has suffered comparative neglect, it has received some attention from interpreters who take its extended treatment of the “subjective” side of cognition to amount to a brand (...) of proto-functionalism. Whatever the merits and demerits of these proto-functionalist approaches, they tend to deemphasize the two arguments that constitute the “objective” side of the A-Deduction, the “argument from above” and then the “argument from below”. Since Kant himself refers to this objective side of the A-Deduction as the “Deduction of the Pure Concepts of the Understanding”, it is surprising that the structure of these arguments has not received closer scrutiny. This is doubly true since Kant actually claims that his revisions for the 1787 version of the Deduction impacted only the “presentation” of it. Any lessons learned from the central arguments of the A-Deduction should help clarify the structure of its younger and more closely studied brother. (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)
Abstract In ?Beyond the Myth of the Myth: A Kantian Theory of Non-Conceptual Content?, Robert Hanna argues for a very strong kind of non-conceptualism, and claims that this kind of non-conceptualism originally has been developed by Kant. But according to ?Kant?s Non-Conceptualism, Rogue Objects and the Gap in the B Deduction?, Kant?s non-conceptualism poses a serious problem for his argument for the objective validity of the categories, namely the problem that there is a gap in the B Deduction. (...) This gap is that the B Deduction goes through only if conceptualism is true, but Kant is a non-conceptualist. In this paper, I will argue, contrary to what Hanna claims, that there is not a gap in the B Deduction. (shrink)
Abstract This paper is about the nature of the relationship between (1) the doctrine of Non-Conceptualism about mental content, (2) Kant?s Transcendental Idealism, and (3) the Transcendental Deduction of the Pure Concepts of the Understanding, or Categories, in the B (1787) edition of the Critique of Pure Reason, i.e., the B Deduction. Correspondingly, the main thesis of the paper is this: (1) and (2) yield serious problems for (3), yet, in exploring these two serious problems for the B (...)Deduction, we also discover some deeply important and perhaps surprising philosophical facts about Kant?s theory of cognition and his metaphysics. (shrink)
In this paper we deal with two types of reasoning: induction, and deduction First, we present a unified computational model of deductive reasoning through models, where deduction occurs in five phases: Construction, Integration, Conclusion, Falsification, and Response. Second, we make an attempt, to analyze induction through the same phases. Our aim is an explorative evaluation of the mental processes possibly shared by deductive and inductive reasoning.
I argue that §§15–20 of the B-Deduction contain two independent arguments for the applicability of a priori concepts, the first an argument from above, the second an argument from below. The core of the first argument is §16's explanation of our consciousness of subject-identity across self-attributions, while the focus of the second is §18's account of universality and necessity in our experience. I conclude that the B-Deduction comprises powerful strategies for establishing its intended conclusion, and that some assistance (...) from empirical psychology might well have produced a completely successful argument. (shrink)
It is often claimed that the conclusion of a deductively valid argument is contained in its premises. Popper refuted this claim when he showed that an empirical theory can be expected always to have logical consequences that transcend the current understanding of the theory. This implies that no formalisation of an empirical theory will enable the derivation of all its logical consequences. I call this result ‘Popper-incompleteness.’ This result appears to be consistent with the view of deductive reasoning as a (...) process of unfurling the content of the premises; but I suggest that the result about validity impugns this theory of reasoning. (shrink)
In standard model theory, deductions are not the things one models. But in general proof theory, in particular in categorial proof theory, one finds models of deductions, and the purpose here is to motivate a simple example of such models. This will be a model of deductions performed within an abstract context, where we do not have any particular logical constant, but something underlying all logical constants. In this context, deductions are represented by arrows in categories involved in a general (...) adjoint situation. To motivate the notion of adjointness, one of the central notions of category theory, and of mathematics in general, it is first considered how some features of it occur in set-theoretical axioms and in the axioms of the lambda calculus. Next, it is explained how this notion arises in the context of deduction, where it characterizes logical constants. It is shown also how the categorial point of view suggests an analysis of propositional identity. The problem of propositional identity, i.e., the problem of identity of meaning for propositions, is no doubt a philosophical problem, but the spirit of the analysis proposed here will be rather mathematical. Finally, it is considered whether models of deductions can pretend to be a semantics. This question, which as so many questions having to do with meaning brings us to that wall that blocked linguists and philosophers during the whole of the twentieth century, is merely posed. At the very end, there is the example of a geometrical model of adjunction. Without pretending that it is a semantics, it is hoped that this model may prove illuminating and useful. (shrink)
Prawitz proved a theorem, formalising 'harmony' in Natural Deduction systems, which showed that, corresponding to any deduction there is one to the same effect but in which no formula occurrence is both the consequence of an application of an introduction rule and major premise of an application of the related elimination rule. As Gentzen ordered the rules, certain rules in Classical Logic had to be excepted, but if we see the appropriate rules instead as rules for Contradiction, then (...) we can extend the theorem to the classical case. Properly arranged there is a thoroughgoing 'harmony', in the classical rules. Indeed, as we shall see, they are, all together, far more 'harmonious' in the general sense than has been commonly observed. As this paper will show, the appearance of disharmony has only arisen because of the illogical way in which natural deduction rules for Classical Logic have been presented. (shrink)
In 1934 a most singular event occurred. Two papers were published on a topic that had (apparently) never before been written about, the authors had never been in contact with one another, and they had (apparently) no common intellectual background that would otherwise account for their mutual interest in this topic.1 These two papers formed the basis for a movement in logic which is by now the most common way of teaching elementary logic by far, and indeed is perhaps all (...) that is known in any detail about logic by a number of philosophers (especially in North America). This manner of proceeding in logic is called ‘natural deduction’. And in its own way the instigation of this style of logical proof is as important to the history of logic as the discovery of resolution by Robinson in 1965, or the discovery of the logistical method by Frege in 1879, or even the discovery of the syllogistic by Aristotle in the fourth century BC. (shrink)
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.
Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by means of growing (...) computational resources, and converge towards classical propositional logic. The underlying claim is that this hierarchy can be used to represent increasing levels of “depth” or “informativeness” of Boolean reasoning. Special attention is paid to the most basic logic in this hierarchy, the pure “intelim logic”, which satisfies all the requirements of a natural deduction system (allowing both introduction and elimination rules for each logical operator) while admitting of a feasible (quadratic) decision procedure. We argue that this logic is “analytic” in a particularly strict sense, in that it rules out any use of “virtual information”, which is chiefly responsible for the combinatorial explosion of standard classical systems. As a result, analyticity and tractability are reconciled and growing degrees of computational complexity are associated with the depth at which the use of virtual information is allowed. (shrink)
This paper offers a new interpretation of Kant's puzzling claim that the B-Deduction in the Critique of Pure Reason should be considered as having two main steps. Previous commentators have tended to agree in general on the first step as arguing for the necessity of the categories for possible experience, but disagree on what the second step is and whether Kant even needs a second step. I argue that the two parts of the B-Deduction correspond to the two (...) aspects of a priori cognition: necessity and universality. The bulk of the paper consists of support for the second step, the universality of the categories. I show that Kant's arguments in the second half of the B-Deduction aim to define the scope of that universality for possible experience by considering the possibilities of divine intellectual intuition, of non-human kinds of sensible intuition, and of apperception of the self. In these ways Kant delimits the boundaries of the applicability of the categories and excludes any other possible experience for human beings. (shrink)
Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Ja?kowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks?the (...) standard conduits of the method to a generation of philosophers?with an eye to determining what the ?essential characteristics? of natural deduction are. (shrink)
By taking into account some texts published between the first and the second edition of the Critique of Pure Reason that have been neglected by most of those who have dealt with the deduction of the categories, I argue that the core of the deduction is to be identified as the ‘almost single inference from the precisely determined definition of a judgment in general’, which Kant adumbrates in the Metaphysical Foundations in order to ‘make up for the deficiency’ (...) of the A-deduction. Whereas the first step of the B-deduction is an attempt to show that the manifold of an intuition belongs to the ‘necessary unity of self-consciousness’ by means of the synthesis of the understanding, the second step has the task of showing that the very same synthesis is responsible for the spatio-temporal unity of the manifold. Thus, Kant's ‘answer to Hume’ is that no spatio-temporal objects of experience at all are merely ‘given’, independently of the conceptual activities of the understanding. Against the established view I substantiate the claim that with this ‘almost single inference’ of the second proof step the distinction between judgments of perception and judgments of experience consequently vanished from Kant's thinking. (shrink)
Future Logic is an original and wide-ranging treatise of formal logic. It deals with deduction and induction, of categorical and conditional propositions, involving the natural, temporal, extensional, and logical modalities. This is the first work ever to strictly formalize the inductive processes of generalization and particularization, through the novel methods of factorial analysis, factor selection and formula revision. This is the first work ever to develop a formal logic of the natural, temporal and extensional types of conditioning (as distinct (...) from logical conditioning), including their production from modal categorical premises. (shrink)
The two major options on which the current debate on the interpretation of quantum mechanics relies, namely realism and empiricism, are far from being exhaustive. There is at least one more position available, which is metaphysically as agnostic as empiricism, but which shares with realism a committment to considering the structure of theories as highly significant. The latter position has been named transcendentalism after Kant. In this paper, a generalized version of Kant's method is used. This yields a reasoning that (...) one is entitled to call a transcendental deduction of some major formal features of quantum mechanics. (shrink)
This paper attempts a deduction of Kant's concept of the highest good: that is, it attempts to prove, in accordance with Dieter Henrich.s interpretation of the notion of deduction, that the highest good is an end that is also a duty. It does this by appealing to features of practical reason that make up the legitimating facts that serve as the premises that any deduction must possess. According to Kant, the highest good consists of happiness, virtue, and (...) relations of proportionality and causation between happiness and virtue, such that happiness is proportional to and caused by virtue. I argue, by drawing on accepted Kantian notions, that Kant had compelling reasons for concluding that the highest good is in fact an end that is also a duty. If correct, then this argument provides the deduction promisedin my title. (shrink)
Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use we describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus, one can try to answer the question: How do we bridge the gap between claims and assumptions in heuristically motivated ways? This (...) informal question motivates the formulation of intercalation calculi. Ic-calculi are the technical underpinnings for (1) and (2), and our paper focuses on their detailed presentation and meta-mathematical investigation in the case of classical predicate logic. As a central theme emerges the connection between restricted forms of nd-proofs and (strategies for) proof search: normal forms are not obtained by removing local "detours", but rather by constructing proofs that directly reflect proof-strategic considerations. That theme warrants further investigation. (shrink)
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)
A system of natural deduction rules is proposed for an idealized form of English. The rules presuppose a sharp distinction between proper names and such expressions as the c, a (an) c, some c, any c, and every c, where c represents a common noun. These latter expressions are called quantifiers, and other expressions of the form that c or that c itself, are called quantified terms. Introduction and elimination rules are presented for any, every, some, a (an), and (...) the, and also for any which, every which, and so on, as well as rules for some other concepts. One outcome of these rules is that Every man loves some woman is implied by, but does not imply, Some woman is loved by every man, since the latter is taken to mean the same as Some woman is loved by all men. Also, Jack knows which woman came is implied by Some woman is known by Jack to have come, but not by Jack knows that some woman came. (shrink)
John Corcoran?s natural deduction system for Aristotle?s syllogistic is reconsidered.Though Corcoran is no doubt right in interpreting Aristotle as viewing syllogisms as arguments and in rejecting Lukasiewicz?s treatment in terms of conditional sentences, it is argued that Corcoran is wrong in thinking that the only alternative is to construe Barbara and Celarent as deduction rules in a natural deduction system.An alternative is presented that is technically more elegant and equally compatible with the texts.The abstract role assigned by (...) tradition and Lukasiewicz to Barbara and Celarent is retained.The two ? perfect syllogisms? serve as ?basic elements? in the construction of an inductively defined set of valid syllogisms.The proposal departs from Lukasiewicz, and follows Corcoran, however, in construing the construction as one in natural deduction.The result is a sequent system with fewer rules and in which Barbara and Celarent serve as basic deductions.To compare the theory to Corcoran?s, his original is reformulated in current terms and generalized.It is shown to be equivalent to the proposed sequent system, and several variations are discussed.For all systems mentioned, a method of Henkin?style completeness proofs is given that is more direct and intuitive than Corcoran?s original. (shrink)
Drawing upon Martin-Löf’s semantic framework for his constructive type theory, semantic values are assigned also to natural-deduction derivations, while observing the crucial distinction between (logical) consequence among propositions and inference among judgements. Derivations in Gentzen’s (1934–5) format with derivable formulae dependent upon open assumptions, stand, it is suggested, for proof-objects (of propositions), whereas derivations in Gentzen’s (1936) sequential format are (blue-prints for) proof-acts.
This paper is concerned with a natural deduction system for First Degree Entailment (FDE). First, we exhibit a brief history of FDE and of combined systems whose underlying idea is used in developing the natural deduction system. Then, after presenting the language and a semantics of FDE, we develop a natural deduction system for FDE. We then prove soundness and completeness of the system with respect to the semantics. The system neatly represents the four-valued semantics for FDE.
A sequent calculus is given in which the management of weakening and contraction is organized as in natural deduction. The latter has no explicit weakening or contraction, but vacuous and multiple discharges in rules that discharge assumptions. A comparison to natural deduction is given through translation of derivations between the two systems. It is proved that if a cut formula is never principal in a derivation leading to the right premiss of cut, it is a subformula of the (...) conclusion. Therefore it is sufficient to eliminate those cuts that correspond to detour and permutation conversions in natural deduction. (shrink)
The standard deduction theorem or introduction rule for implication, for classical logic is also valid for intuitionistic logic, but just as with predicate logic, other rules of inference have to be restricted if the theorem is to hold for weaker implicational logics.In this paper we look in detail at special cases of the Gentzen rule for and show that various subsets of these in effect constitute deduction theorems determining all the theorems of many well known as well as (...) not well known implicational logics. In particular systems of rules are given which are equivalent to the relevance logics E,R, T, P-W and P-W-I. (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.
Considering the instability of nonlinear dynamics, the deductive inference rule Modus ponens itself is not enough to guarantee the validity of reasoning sequences in the real physical world, and similar results cannot necessarily be obtained from similar causes. Some kind of stability hypothesis should be added in order to draw meaningful conclusions. Hence, the uncertainty of deductive inference appears to be like that of inductive inference, and the asymmetry between deduction and induction becomes unrecognizable such as to undermine the (...) basis for the fundamental cleavage between analytic truth and synthetic truth, as W. V. O. Quine pointed out. Induction is not inferior to deduction from a pragmatic point of view. (shrink)
Having been neglected or maligned for most of this century, Newton's method of 'deduction from the phenomena' has recently attracted renewed attention and support. John Norton, for example, has argued that this method has been applied with notable success in a variety of cases in the history of physics and that this explains why the massive underdetermination of theory by evidence, seemingly entailed by hypothetico-deductive methods, is invisible to working physicists. This paper, through a detailed analysis of Newton's (...)deduction of one particular 'proposition' in optics 'from the phenomena', gives a clearer account than hitherto of the method - highlighting the fact that it is really one of deduction from the phenomena plus 'background knowledge'. It argues, that, although the method has certain heuristic virtues, examination of its putative accreditational strengths reveals a range of important problems that its defenders have yet adequately to address. (shrink)
We prove that no logic (i.e. consequence operation) determined by any class of orthomodular lattices admits the deduction theorem (Theorem 2.7). We extend those results to some broader class of logics determined by ortholattices (Corollary 2.6).
We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of soundness, completeness (...) and proof normalization. We have implemented our work in the Isabelle Logical Framework. (shrink)
In this paper we make some observations about Natural Deduction derivations [Prawitz, 1965, van Dalen, 1986, Bell and Machover, 1977]. We assume the reader is familiar with it and with proof-theory in general. Our development will be simple, even simple-minded, and concrete. However, it will also be evident that general ideas motivate our examples, and we think both our specific examples and the ideas behind them are interesting and may be useful to some readers. In a sentence, the bare (...) technical content of this paper is: Extending natural deduction with global well-formedness conditions can neatly and cheaply capture classical and intermediate logics. The interest here is in the ‘neatly’ and ‘cheaply’. By ‘neatly’ we mean ‘preserving proof-normalisation’,1 and ‘maintaining the subformula property’, and by ‘cheaply’ we mean ‘preserving the formal structure of deductions’ (so that a deduction in the original system is still, formally, a deduction in the extended system, and in particular it requires no extra effort to write just because it is in the extended system). To illustrate what we have in mind consider intuitionistic first-order logic (FOL) [van Dalen, 1986] as a paradigmatic example of a formal notion of deduction. A natural deduction derivation (or deduction) is an inductively defined tree structure where each node contains an instance of a formula. A deduction is valid when each successive node follows from its predecessors in accordance with some predetermined inference rules. A particular attraction of Natural Deduction is its clean and economical presentation. Here for example are deduction (fragments) proving A ∧ B from A and B, and ∀x. (P (x) ∧ Q(x)) from ∀x. P (x) and ∀x. Q(x): ∀x. P (x) (∀E). (shrink)
Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.
This is a companion paper to Braüner (2004b, Journal of Logic and Computation 14, 329–353) 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)
The author presents a deduction system for Quantum Logic. This system is a combination of a natural deduction system and rules based on the relation of compatibility. This relation is the logical correspondant of the commutativity of observables in Quantum Mechanics or perpendicularity in Hilbert spaces.Contrary to the system proposed by Gibbins and Cutland, the natural deduction part of the system is pure: no algebraic artefact is added. The rules of the system are the rules of Classical (...) Natural Deduction in which is added a control of contexts using the compatibility relation. (shrink)
The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity representation (...) is rather independent of the underlying proof method, provided that some form of (analytic) cut is admissible. We will also discuss some generalisations of the system and compare it with other formalizations of linearity. (shrink)
Deduction Versus Discourse: Newton and the Cosmic Phenomena Content Type Journal Article Pages 1-16 DOI 10.1007/s10699-011-9283-2 Authors Pierre Kerszberg, University of Toulouse, Toulouse, France Journal Foundations of Science Online ISSN 1572-8471 Print ISSN 1233-1821.
We present a reference model for finding (prima facie) evidence of discrimination in datasets of historical decision records in socially sensitive tasks, including access to credit, mortgage, insurance, labor market and other benefits. We formalize the process of direct and indirect discrimination discovery in a rule-based framework, by modelling protected-by-law groups, such as minorities or disadvantaged segments, and contexts where discrimination occurs. Classification rules, extracted from the historical records, allow for unveiling contexts of unlawful discrimination, where the degree of burden (...) over protected-by-law groups is evaluated by formalizing existing norms and regulations in terms of quantitative measures. The measures are defined as functions of the contingency table of a classification rule, and their statistical significance is assessed, relying on a large body of statistical inference methods for proportions. Key legal concepts and reasonings are then used to drive the analysis on the set of classification rules, with the aim of discovering patterns of discrimination, either direct or indirect. Analyses of affirmative action, favoritism and argumentation against discrimination allegations are also modelled in the proposed framework. Finally, we present an implementation, called LP2DD, of the overall reference model that integrates induction, through data mining classification rule extraction, and deduction, through a computational logic implementation of the analytical tools. The LP2DD system is put at work on the analysis of a dataset of credit decision records. (shrink)
The comprehension principle of set theory asserts that a set can be formed from the objects satisfying any given property. The principle leads to immediate contradictions if it is formalized as an axiom scheme within classical first order logic. A resolution of the set paradoxes results if the principle is formalized instead as two rules of deduction in a natural deduction presentation of logic. This presentation of the comprehension principle for sets as semantic rules, instead of as a (...) comprehension axiom scheme, can be viewed as an extension of classical logic, in contrast to the assertion of extra-logical axioms expressing truths about a pre-existing or constructed universe of sets. The paradoxes are disarmed in the extended classical semantics because truth values are only assigned to those sentences that can be grounded in atomic sentences. (shrink)
We give two proofs of strong normalisation for second order classical natural deduction. The first one is an adaptation of the method of reducibility candidates introduced in [9] for second order intuitionistic natural deduction; the extension to the classical case requires in particular a simplification of the notion of reducibility candidate. The second one is a reduction to the intuitionistic case, using a Kolmogorov translation.
Most automated theorem provers are clausal-form provers based on variants of resolutionrefutation. In my [1990], I described the theorem prover OSCAR that was based instead on natural deduction. Some limited evidence was given suggesting that OSCAR was suprisingly efficient. The evidence consisted of a handful of problems for which published data was available describing the performance of other theorem provers. This evidence was suggestive, but based upon too meager a comparison to be conclusive. The question remained, “How does natural (...)deduction compare with resolution-refutation?” In the ensuing seven years, OSCAR has evolved in important ways, and other developments have made it possible to collect more accurate comparative data. Specifically, the creation of the TPTP library of problems for theorem provers,1 and the availability of important theorem provers on the world wide web, make objective comparisons easier. These developments recently inspired Geoff Sutcliffe, one of the founders of the TPTP library, to issue a challenge to OSCAR. At CADE-13, a competition was held for clausal-form theorem provers.2 Otter was one of the most successful contestants. In addition, Otter is able to handle problems stated in natural form (as opposed to clausal form), and Otter is readily available for different platforms.3 Sutcliffe selected 212 problems from the TPTP library, and suggested that OSCAR and Otter run these problems on the same hardware. This “Shootout at the ATP corral” took place, with the result that OSCAR was on the average 40 times faster than Otter. In addition, OSCAR was able to find proofs for 16 problems on which Otter failed, and Otter was able to find proofs for 3 problems on which OSCAR failed. Taking into account that Otter was written in C and OSCAR in LISP, the speed difference of the algorithms themselves could be as much as an order of magnitude greater. Apparently, natural deduction has some advantages over resolution-refutation.. (shrink)
The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, (...) a quite arbitrary set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian. (shrink)
Deductive inference is usually regarded as being "tautological" or "analytical": the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by means of growing (...) computational resources, and converge towards classical propositional logic. The underlying claim is that this hierarchy can be used to represent increasing levels of "depth" or "informativeness" of Boolean reasoning. Special attention is paid to the most basic logic in this hierarchy, the pure "intelim logic", which satisfies all the requirements of a natural deduction system (allowing both introduction and elimination rules for each logical operator) while admitting of a feasible (quadratic) decision procedure. We argue that this logic is "analytic" in a particularly strict sense, in that it rules out any use of "virtual information", which is chiefly responsible for the combinatorial explosion of standard classical systems. As a result, analyticity and tractability are reconciled and growing degrees of computational complexity are associated with the depth at which the use of virtual information is allowed. (shrink)
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e., in presence of all the usual connectives) classical natural deduction.
In this paper, the author discusses the feasibility of constructing a Humean model of the psychological realities of categorical propositions and syllogistic deduction by employing only Hume’s kinds of “ideas” and kinds of mental operations on ideas which Hume explicitly or implicitly postulated in his theory of discursive thinking.
Although resolution-based inference is perhaps the industry standard in automated theorem proving, there have always been systems that employed a different format. For example, the Logic Theorist of 1957 produced proofs by using an axiomatic system, and the proofs it generated would be considered legitimate axiomatic proofs; Wang’s systems of the late 1950’s employed a Gentzen-sequent proof strategy; Beth’s systems written about the same time employed his semantic tableaux method; and Prawitz’s systems of again about the same time are often (...) said to employ a natural deduction format. [See Newell, et al (1957), Beth (1958), Wang (1960), and Prawitz et al (1960)]. Like sequent proof systems and tableaux proof systems, natural deduction systems retain.. (shrink)
The aim of this paper is to present a modified version of the notion of strong proof from hypotheses (definition D2), and to give three deduction theorems for the relevant logicsR (theoremsT1, andT2) andE (theoremT3).
In this paper two different natural deduction systems forhybrid logic are compared and contrasted.One of the systems was originally given by the author of the presentpaper whereasthe other system under consideration is a modifiedversion of a natural deductionsystem given by Jerry Seligman.We give translations in both directions between the systems,and moreover, we devise a set of reduction rules forthe latter system bytranslation of already known reduction rules for the former system.
We present systems of Natural Deduction based on Strict Implication for the main normal modal logics between K and S5. In this work we consider Strict Implication as the main modal operator, and establish a natural correspondence between Strict Implication and strict subproofs.
(2012). Reasoning to and from belief: Deduction and induction are still distinct. Thinking & Reasoning. ???aop.label???. doi: 10.1080/13546783.2012.745450.
Logics that do not have a deduction-detachment theorem (briefly, a DDT) may still possess a contextual DDT —a syntactic notion introduced here for arbitrary deductive systems, along with a local variant. Substructural logics without sentential constants are natural witnesses to these phenomena. In the presence of a contextual DDT, we can still upgrade many weak completeness results to strong ones, e.g., the finite model property implies the strong finite model property. It turns out that a finitary system has a (...) contextual DDT iff it is protoalgebraic and gives rise to a dually Brouwerian semilattice of compact deductive filters in every finitely generated algebra of the corresponding type. Any such system is filter distributive, although it may lack the filter extension property. More generally, filter distributivity and modularity are characterized for all finitary systems with a local contextual DDT, and several examples are discussed. For algebraizable logics, the well-known correspondence between the DDT and the equational definability of principal congruences is adapted to the contextual case. (shrink)
Two experiments examined the role of conditional reasoning in the logical deduction game, Mastermind . An analysis suggested that Modus Tollens (MT) reasoning could be used to determine the code structure, for example, in determining if any of the colours in the code are repeated. Consistent with this analysis, Experiment 1 showed that only MT errors are correlated with the number of hypotheses advanced in Mastermind . A subsequent analysis showed that conditional reasoning such as Affirming the Consequent (AC) (...) and Denying the Antecedent (DA) could lead to particularly damaging inferences only when the code was four different colours. When that was known before play, Experiment 2 showed that AC errors, but not MT errors, were significantly correlated with Mastermind hypotheses advanced. A stepwise multiple regression analysis supported these findings: When the solvers knew they were playing a four-colour code, there was a slight diminution in the variance explained by MT errors, and a significant increase in the variance explained by AC errors. An analysis of the number of different possible codes that could be consistent with hypotheses actually played showed that the number of such codes is far fewer when the code consists of four different colours than when its structure is not known. This analysis suggests that reasoners are therefore unlikely to discover many alternative causes for the feedback given when the code consists of four different colours, and it is under these conditions that humans are most likely to engage in AC reasoning. (shrink)
In this paper we present a dynamic assignment language which extends the dynamic predicate logic of Groenendijk and Stokhof [1991: 39–100] with assignment and with generalized quantifiers. The use of this dynamic assignment language for natural language analysis, along the lines of o.c. and [Barwise, 1987: 1–29], is demonstrated by examples. We show that our representation language permits us to treat a wide variety of donkey sentences: conditionals with a donkey pronoun in their consequent and quantified sentences with donkey pronouns (...) anywhere in the scope of the quantifier. It is also demonstrated that our account does not suffer from the so-called proportion problem.Discussions about the correctness or incorrectness of proposals for dynamic interpretation of language have been hampered in the past by the difficulty of seeing through the ramifications of the dynamic semantic clauses (phrased in terms of input-output behaviour) in non-trivial cases. To remedy this, we supplement the dynamic semantics of our representation language with an axiom system in the style of Hoare. While the representation languages of barwise and Groenendijk and Stokhof were not axiomatized, the rules we propose form a deduction system for the dynamic assignment language which is proved correct and complete with respect to the semantics. (shrink)
This paper points out an error of Parigot's proof of strong normalization of second order classical natural deduction by the CPS-translation, discusses erasing-continuation of the CPS-translation, and corrects that proof by using the notion of augmentations.
This paper defends the thesis of the analyticity of the principle of apperception, as developed in the first part of the B-Deduction, against recent criticisms by Paul Guyer and Patricia Kitchen The first part presents these criticisms, the most important of which being that the analyticity thesis is incompatible with both the avowed goal of which being that the Deduction of establishing the vahdity of the categories and Üie account of apperception in the A-Deduction. The second part (...) argues that Kant's procedure in the B-Deduction of beginning with an abstract analysis of a discursive understanding, independentiy of its relation to the specifically human forms of sensibility, requires him to regard the principle as analytic and that this explains the difference from the A-Deduction. By appealing to the model of a deduction in Kant's moral theory and the two step in one proof structure of the B-Deduction, the third part argues that the analyticity thesis is in fact compatible with the goal of the Deduction. (shrink)
It is shown that the implicational fragment of Anderson and Belnap's R, i.e. Church's weak implicational calculus, is not uniquely characterized by MP (modus ponens), US (uniform substitution), and WDT (Church's weak deduction theorem). It is also shown that no unique logic is characterized by these, but that the addition of further rules results in the implicational fragment of R. A similar result for E is mentioned.
We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems, and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. As applications we give near-linear simulations of the propositional Gentzen sequent calculus and the natural deduction calculus by Frege proofs. The length of a proof (...) is the number of lines (or formulas) in the proof. A general deduction Frege proof system provides at most quadratic speedup over Frege proof systems. A nested deduction Frege proof system provides at most a nearly linear speedup over Frege system where by "nearly linear" is meant the ratio of proof lengths is O(α(n)) where α is the inverse Ackermann function. A nested deduction Frege system can linearly simulate the propositional sequent calculus, the tree-like general deduction Frege calculus, and the natural deduction calculus. Hence a Frege proof system can simulate all those proof systems with proof lengths bounded by O(n · α(n)). Also we show that a Frege proof of n lines can be transformed into a tree-like Frege proof of O(n log n) lines and of height O(log n). As a corollary of this fact we can prove that natural deduction and sequent calculus tree-like systems simulate Frege systems with proof lengths bounded by O(n log n). (shrink)
In standard model theory, deductions are not the things one models. But in general proof theory, in particular in categorial proof theory, one finds models of deductions, and the purpose here is to motivate a simple example of such models. This will be a model of deductions performed within an abstract context, where we do not have any particular logical constant, but something underlying all logical constants. In this context, deductions are represented by arrows in categories involved in a general (...) adjoint situation. To motivate the notion of adjointness, one of the central notions of category theory, and of mathematics in general, it is first considered how some features of it occur in set-theoretical axioms and in the axioms of the lambda calculus. Next, it is explained how this notion arises in the context of deduction, where it characterizes logical constants. It is shown also how the categorial point of view suggests an analysis of propositional identity. The problem of propositional identity, i.e., the problem of identity of meaning for propositions, is no doubt a philosophical problem, but the spirit of the analysis proposed here will be rather mathematical. Finally, it is considered whether models of deductions can pretend to be a semantics. This question, which as so many questions having to do with meaning brings us to that wall that blocked linguists and philosophers during the whole of the twentieth century, is merely posed. At the very end, there is the example of a geometrical model of adjunction. Without pretending that it is a semantics, it is hoped that this model may prove illuminating and useful. (shrink)
This paper points out an error of Parigot's proof of strong normalization of second order classical natural deduction by the CPS-translation, discusses erasing-continuation of the CPS-translation, and corrects that proof by using the notion of augmentations.
The objective of the article is twofold: to advance an interpretation of Descartes’ position on the problem of explaining how deduction from universal propositions to their particular instances can be both legitimate and useful for discovery of truth; and to argue that his position is a valuable contribution to the philosophy of logic. In Descartes’ view. the problem in question is that syllogistic deductions from universal propositions to their particular instances is circular and hence useless as a means for (...) discovery of truth. Descartes’ solution to the problem is to claim that noncircular, useful deduction from the universal to the particular must first be based on deduction from particular truths to particular truths. I examine previous interpretations of Cartesian deduction given by E.M. Curley, Bernard Williams, and Andre Gombay. None of these interpretations fit with all of Descartes’ criticisms of syllogistic deduction and his characterization of useful and legitimate deduction (such as the cogito). I argue that the key to a correct interpretation is Descartes’ claim that implicit knowledge of universal propositions plays a crucial role in useful and legitimate deduction, and I explain how we may cash in his talk of implicit knowledge through Ryle’s notion of knowing how. Having set out a fuller explication of Descartes’ theory of deduction, I argue that it is consistent with the way people actually reason, that it helps us with problems in the philosophy of logic that have been raised by John Stuart Mill, Hilary Putnam, and Michael Dummett. (shrink)
In [13], M. Tokarz specified some infinite family of consequence operations among all ones associated with the relevant logic RM or with the extensions of RM and proved that each of them admits a deduction theorem scheme. In this paper, we show that the family is complete in a sense that if C is a consequence operation with C RM ≤ C and C admits a deduction theorem scheme, then C is equal to a consequence operation specified in (...) [13]. In algebraic terms, this means that the only quasivarieties of Sugihara algebras with the relative congruence extension property are the quasivarieties corresponding, via the algebraization process, to the consequence operations specified in [13]. (shrink)
t. 1. La déduction transcendentale avant la Critique de la raison pure.--t. 2. La déduction transcendentale de 1781 jusqu'à la deuxième édition de la Critique de la raison pure (1887).--t. 3. La déduction transcendentale de 1787 jusqu'à l'Opus postumum.
Este trabajo tiene por objetivo examinar la idea de deducción metamatemática en el programa de Hilbert, mostrando su dependencia de conceptos gnoseológicos, tales como el de conocimiento intuitivo. También se comparará esta concepcion de la deducción con la fundamentación intuicionista de la logica. Sostendré que esta deducción metamatemática lleva a una caracterización de la logica como una teoría de las deducciones formales en un sentido particular.This paper aims to examine the idea of metamathematical deduction in Hilbert’s program showing its (...) dependence of epistemological notions, such as intuitive knowledge. This conception of deduction will be also compared with the intuitionistic foundation of logic. I will argue that this metamathematical deduction leads to a characterization of logic as a theory of formal deductions in a particular sense. (shrink)
This article identifies and formalizes the logical features of analogous terms that justify their use in deduction. After a survey of doctrines in Aristotle, Aquinas, and Cajetan, the criteria of “analogy of proper proportionality” are symbolized in first-order predicate logic. A common genus justifies use of a common term, but does not provide the inferential link required for deduction. Rather, the respective differentiae foster this link through their identical proportion. A natural-language argument by analogy is formalized so as (...) to exhibit these criteria, thereby showing the validity of analogical deduction. (shrink)
From the standpoint of the theory of medicine, a formulation is given of three types of reasoning used by physicians. The first is deduction from probability models (as in prognosis or genetic counseling for Mendelian disorders). It is a branch of mathematics that leads to predictive statements about outcomes of individual events in terms of known formal assumptions and parameters. The second type is inference (as in interpreting clinical trials). In it the arguments from replications of the same process (...) (data) lead to conclusions about the parameters of a system, without calling into question either the probabilistic model or the criteria of evidence. The third is illation (as in the elucidation of symptoms in a patient). It is a process whereby, in the light of the total evidence and the conclusions from the other types of reasoning, one may modify, expand, simplify or demolish a conceptual framework proposed for deductions, and modify the nature of the evidence sought, the criteriology, the axioms, and the surmised complexity of the scientific theory. (The process of diagnosis as applied to a patient may in extreme cases lead to the discovery of an entirely new disease with its own, quite new, set of diagnostic criteria. This course cannot be accommodated inside either of the other two types of reasoning.) Illation has something of the character of Kuhn's scientific revolution in physics; but it differs in that it is the nature, not the degree or frequency of change that distinguishes it from Kuhn's normal science. (shrink)
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 two systems of natural deduction for the rejection of non-tautologies of classical propositional logic. The first system is sound and complete with respect to the body of all non-tautologies, the second system is sound and complete with respect to the body of all contradictions. The second system is a subsystem of the first. Starting with Jan Łukasiewicz's work, we describe the historical development of theories of rejection for classical propositional logic. Subsequently, we present the two systems (...) of natural deduction and prove them to be sound and complete. We conclude with a ‘Theorem of Inversion’. (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.
Let be the ordinary deduction relation of classical first-order logic. We provide an analytic subrelation 3 of which for propositional logic is defined by the usual containment criterion.
Based on the strict definitions of concepts, such as deduction, the deduction rule and the deduction system, the form axiom, the substantive axiom, this article clearly shows the essence of the deductive reasoning, namely “Related attribute and the related restriction relations, which are conveyed in what the main concept of the deduction refers to, must be contained in those conveyed in what the premise proposition refers to”。Then puts forward the theorem “contradiction can not be derived from (...) the strict deduction system”, and gives the proofs. (shrink)
Fregean predicates applied to Fregean objects are merely defined by a "timeless" deductive order of sentences. They cannot provide sufficient structure in order to explain how names can refer to objects of intuition and how predicates can express properties of substances that change in time. Therefore, the accounts of Wilson and Quine, Prior and Brandom for temporal judgments fail -- and a new reconstruction of Kant's transcendental logic, especially of the analogies of experience, is needed.
Towards the middle of the eighteenth century Hume asked: Why should we accept non-deductive inferences? Strangely enough he didn’t ask the corresponding question: Why should we accept deductive inferences? This was not due to an oversight but rather to the belief, widespread even today, that there is a basic difference between deductive and non-deductive inferences: while non-deductive inferences cannot be justified, deductive inferences can be justified. Though widespread even today, such belief has been challenged by a number of people, from (...) Sextus Empiricus to Lewis Carroll. However, although their arguments raise doubts about the possibility of justifying deductive inferences, many people still believe that, while non-deductive inferences cannot be justified, deductive inferences can be justified. The question of the justification of deductive inferences is all the more important as it is strictly connected with the question: What is a deductive inference? and a non-deductive inference? This paper provides a new answer to these questions. (shrink)
This monograph provides a new account of justified inference as a cognitive process. In contrast to the prevailing tradition in epistemology, the focus is on low-level inferences, i.e., those inferences that we are usually not consciously aware of and that we share with the cat nearby which infers that the bird which she sees picking grains from the dirt, is able to fly. Presumably, such inferences are not generated by explicit logical reasoning, but logical methods can be used to describe (...) and analyze such inferences. Part 1 gives a purely system-theoretic explication of belief and inference. Part 2 adds a reliabilist theory of justification for inference, with a qualitative notion of reliability being employed. Part 3 recalls and extends various systems of deductive and nonmonotonic logic and thereby explains the semantics of absolute and high reliability. In Part 4 it is proven that qualitative neural networks are able to draw justified deductive and nonmonotonic inferences on the basis of distributed representations. This is derived from a soundness/completeness theorem with regard to cognitive semantics of nonmonotonic reasoning. The appendix extends the theory both logically and ontologically, and relates it to A. Goldman's reliability account of justified belief. This text will be of interest to epistemologists and logicians, to all computer scientists who work on nonmonotonic reasoning and neural networks, and to cognitive scientists. (shrink)
This article provides the first comprehensive reconstruction and analysis of Hintikka’s attempt to obtain a measure of the information yield of deductive inferences. The reconstruction is detailed by necessity due to the originality of Hintikka’s contribution. The analysis will turn out to be destructive. It dismisses Hintikka’s distinction between surface information and depth information as being of any utility towards obtaining a measure of the information yield of deductive inferences. Hintikka is right to identify the failure of canonical information theory (...) to give an account of the information yield of deductions as a scandal, however this article demonstrates that his attempt to provide such an account fails. It fails primarily because it applies to only a restricted set of deductions in the polyadic predicate calculus, and fails to apply at all to the deductions in the monadic predicate calculus and the propositional calculus. Some corollaries of these facts are a number of undesirable and counterintuitive results concerning the proposed relation of linguistic meaning (and hence synonymy) with surface information. Some of these results will be seen to contradict Hintikka’s stated aims, whilst others are seen to be false. The consequence is that the problem of obtaining a measure of the information yield of deductive inferences remains an open one. The failure of Hintikka’s proposal will suggest that a purely syntactic approach to the problem be abandoned in favour of an intrinsically semantic one. (shrink)
This article reports on a study of children's deductive reasoning in solving novel relational problems. Detailed protocols were obtained from 264 children (aged 9- 12 years) who verbalised their thinking as they solved the problems. The study included the development of a three-phase theory based on Johnson-Laird and Byrne's mental models perspective, but with some distinct modifications. These include a focus on the relational complexity entailed in model construction and in premise integration, and the advancement of four reasoning principles that (...) are applied throughout problem solution (in contrast to Johnson-Laird's falsification processes as the hallmark of deductive reasoning). The reported case studies and the results of statistical analyses supported predictions arising from the proposed theory, including the key role of the reasoning principles. The results also showed that problem difficulty is a function of relational complexity, not of the number of models to be constructed, as argued by Johnson-Laird and Byrne. (shrink)
This paper argues against the deductive reconstruction of scientific prediction, that is, against the view that in prediction the predicted event follows deductively from the laws and initial conditions that are the basis of the prediction. The major argument of the paper is intended to show that the deductive reconstruction is an inaccurate reconstruction of actual scientific procedure. Our reason for maintaining that it is inaccurate is that if the deductive reconstruction were an accurate reconstruction, then scientific prediction would be (...) impossible. (shrink)
Elementary results concerning the connections between deductive relations and probabilistic support are given. These are used to show that Popper-Miller's result is a special case of a more general result, and that their result is not very unexpected as claimed. According to Popper-Miller, a purely inductively supports b only if they are deductively independent — but this means that a b. Hence, it is argued that viewing induction as occurring only in the absence of deductive relations, as Popper-Miller sometimes do, (...) is untenable. Finally, it is shown that Popper-Miller's claim that deductive relations determine probabilistic support is untrue. In general, probabilistic support can vary greatly with fixed deductive relations as determined by the relevant Lindenbaum algebra. (shrink)
Transitive inference is claimed to be “deductive”. Yet every group/species ever reported apparently uses it. We asked 58 adults to solve five-term transitive tasks, requiring neither training nor premise learning. A computer-based procedure ensured all premises were continually visible. Response accuracy and RT (non-discriminative nRT ) were measured as is typically done. We also measured RT confined to correct responses ( cRT ). Overall, very few typical transitive phenomena emerged. The symbolic distance effect never extended to premise recall and was (...) not at all evident for nRT ; suggesting the use of non-deductive end-anchor strategies. For overall performance, and particularly the critical B ? D inference, our findings indicate that deductive transitive inference is far more intellectually challenging than previously thought. Contrasts of our present findings against previous findings suggest at least two distinct transitive inference modes, with most research and most computational models to date targeting an associative mode rather than their desired deductive mode. This conclusion fits well with the growing number of theories embracing a “dual process” conception of reasoning. Finally, our differing findings for nRT versus cRT suggest that researchers should give closer consideration to matching the RT measure they use to the particular conception of transitive inference they pre-held. (shrink)
A deductive system (in the sense of Tarski) is Fregean if the relation of interderivability, relative to any given theory T, i.e., the binary relation between formulas.
The idea that Roman Catholic doctrines for which there is no early testimony can be explained as logical deductions from undoubtedly early teachings is usually dismissed as obviously false. By invoking the logical properties of doctrines expressed as explicit generalizations, however, and by distinguishing deductions in which all the assumptions represent Apostolic doctrine from those in which all the doctrinal assumptions are Apostolic, a way is found to deduce the disputed doctrines while leaving the immutability of doctrine intact. Although a (...) theory of theological development is thus not needed to justify doctrinal additions, developments in theology nevertheless often motivate the authoritative pronouncements cited by doctrinal deductions. Finally, it is argued that a correct understanding of such deductions improves the prospects for reunion between those whose doctrinal axioms coincide even if differing historical information has rendered them incapable of following the same chain of deductions. (shrink)
Transitive inference is claimed to be “deductive”. Yet every group/species ever reported apparently uses it. We asked 58 adults to solve five-term transitive tasks, requiring neither training nor premise learning. A computer-based procedure ensured all premises were continually visible. Response accuracy and RT (non-discriminative nRT ) were measured as is typically done. We also measured RT confined to correct responses ( cRT ). Overall, very few typical transitive phenomena emerged. The symbolic distance effect never extended to premise recall and was (...) not at all evident for nRT ; suggesting the use of non-deductive end-anchor strategies. For overall performance, and particularly the critical B ? D inference, our findings indicate that deductive transitive inference is far more intellectually challenging than previously thought. Contrasts of our present findings against previous findings suggest at least two distinct transitive inference modes, with most research and most computational models to date targeting an associative mode rather than their desired deductive mode. This conclusion fits well with the growing number of theories embracing a “dual process” conception of reasoning. Finally, our differing findings for nRT versus cRT suggest that researchers should give closer consideration to matching the RT measure they use to the particular conception of transitive inference they pre-held. (shrink)
Personality signatures are sets of if-then rules describing how a given person would feel or act in a specific situation. These rules can be used as the major premise of a deductive argument, but they are mostly processed for social cognition purposes; and this common usage is likely to leak into the way they are processed in a deductive reasoning context. It is hypothesised that agreement with a Modus Ponens argument featuring a personality signature as its major premise is affected (...) by the reasoner's own propensity to display this personality signature. To test this prediction, Modus Ponens arguments were constructed from conditionally phrased items extracted from available personality scales. This allowed recording of (a) agreement with the conclusion of these arguments, and (b) the reasoner's propensity to display the personality signature, using as a proxy this reasoner's score on the personality scale without the items used in the argument. Three experiments ( N = 256, N = 318, N = 298) applied this procedure to Fairness, Responsive Joy, and Self-Control. These experiments yielded very comparable effects, establishing that a reasoner's propensity to display a given personality signature determines this reasoner's agreement with the conclusion of a Modus Ponens argument featuring the personality signature. (shrink)
