Deductive Cogency holds that the set of propositions towards which one has, or is prepared to have, a given type of propositional attitude should be consistent and closed under logical consequence. While there are many propositional attitudes that are not subject to this requirement, e.g. hoping and imagining, it is at least prima facie plausible that Deductive Cogency applies to the doxastic attitude involved in propositional knowledge, viz. belief. However, this thought is undermined by the well-known preface paradox, leading a (...) number of philosophers to conclude that Deductive Cogency has at best a very limited role to play in our epistemic lives. I argue here that Deductive Cogency is still an important epistemic requirement, albeit not as a requirement on belief. Instead, building on a distinction between belief and acceptance introduced by Jonathan Cohen and recent developments in the epistemology of understanding, I propose that Deductive Cogency applies to the attitude of treating propositions as given in the context of attempting to understand a given phenomenon. I then argue that this simultaneously accounts for the plausibility of the considerations in favor of Deductive Cogency and avoids the problematic consequences of the preface paradox. (shrink)

George Boole published the pamphlet The Mathematical Analysis of Logic in 1847. He believed that logic should belong to a universal mathematics that would cover both quantitative and nonquantitative research. With his pamphlet, Boole signalled an important change in symbolic logic: in contrast with his predecessors, his thinking was exclusively extensional. Notwithstanding the innovations introduced he accepted all traditional Aristotelean syllogisms. Nevertheless, some criticisms have been raised concerning Boole’s view of Aristotelean logic as the solution of algebraic equations. In order (...) to circumvent such criticisms, we show here how Boole’s conclusions may be deduced from the axioms and inference rules proposed in his pamphlet, from which Aristotle’s deductions in Prior Analytics (including those that are completed through an impossibility) can be stated as theorems. We clarify his method for dealing with both universal and particular premises by means of his symbol v and demystify some criticisms concerning the way he expressed particular premises. Boole’s conclusions for some of those premises for which according to Aristotle there is no deduction are also discussed. The deductive system presented here has the potential to provide a new perspective on Boole’s approach to logic in The Mathematical Analysis of Logic. (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 this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s logic both with (...) one (A. Urquhart, G. Priest, A. Tamminga) and two designated values (G. Priest, B. Kooi, A. Tamminga). The purpose of this paper is to provide natural deduction systems for weak and intermediate regular logics both with one and two designated values. (shrink)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division of (...) the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

The distinction between the syntactic and the semantic approach to scientific theories emerged in formal philosophy of science. The semantic approach is commonly considered more advanced and more successful than the syntactic one, but the transition from the one approach to the other was not brought about without any loss. In essence, it is the formal analysis of atomic propositions and the analysis of deductive reasoning that dropped out of consideration in at least some of the elaborated versions of the (...) semantic approach. In structuralist theory of science, as founded by Sneed and Stegmüller, the focus is on global propositions concerning the question of whether or not certain empirical systems satisfy a set-theoretic predicate that encodes the axioms of a scientific theory. Hence, an analysis of deductive reasoning from atomic premisses with the help of a given theory is missing. The objective of the present paper is to develop a deductive system on the basis of the structuralist framework. This system comes with a novel formulation of empirical propositions in structuralism. (shrink)

In this study on deduction, the authors argue that people reason by imagining the relevant state of affairs, ie building an internal model of it, formulating a tentative conclusion based on this model and then searching for alternative models.

In mathematics, the deductive method reigns. Without proof, a claim remains unsolved, a mere conjecture, not something that can be simply assumed; when a proof is found, the problem is solved, it turns into a “result,” something that can be relied on. So mathematicians think. But is there more to mathematical justification than proof? -/- The answer is an emphatic yes, as I explain in this article. I argue that non-deductive justification is in fact pervasive in mathematics, and that it (...) is in good epistemic standing. (shrink)

It has been the dominant view that probabilistic explanations of particular facts must be inductive in character. I argue here that this view is mistaken, and that the aim of probabilistic explanation is not to demonstrate that the explanandum fact was nomically expectable, but to give an account of the chance mechanism(s) responsible for it. To this end, a deductive-nomological model of probabilistic explanation is developed and defended. Such a model has application only when the probabilities occurring in covering laws (...) can be interpreted as measures of objective chance, expressing the strength of physical propensities. Unlike inductive models of probabilistic explanation, this deductive model stands in no need of troublesome requirements of maximal specificity or epistemic relativization. (shrink)

The promised mathematical system—the Constructibility Theory—is presented as an axiomatized deductive theory formalized in a many‐sorted first‐order logical language. The axioms of the theory are specified and a justification for each of the axioms is given. Objections to the theory are considered.

In mathematics, the deductive method reigns. Without proof, a claim remains unsolved, a mere conjecture, not something that can be simply assumed; when a proof is found, the problem is solved, it turns into a “result,” something that can be relied on. So mathematicians think. But is there more to mathematical justification than proof?The answer is an emphatic yes, as I explain in this chapter. I argue that non-deductive justification is in fact pervasive in mathematics, and that it is in (...) good epistemic standing. (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)

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.

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 →.

The notion of local deduction theorem (which generalizes on the known instances of indeterminate deduction theorems, e.g. for the infinitely-valued ukasiewicz logic C ) is defined. It is then shown that a given finitary non-pathological logic C admits the local deduction theorem iff the class Matr(C) of all matrices validating C has the C-filter extension property (Theorem II.1).

Deductive inference seems to reveal semantic connections between their premise(s) and conclusion that were there all along. This looks inconsistent with Wittgenstein's later views on meaning. The paper argues that W's treatment of aspects suggests a Wittgensteinian treatment of deduction that accommodates the troublesome phenomenon without conceding its force.

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.

The development of recursion theory motivated Kleene to create regular three-valued logics. Remove it taking his inspiration from the computer science, Fitting later continued to investigate regular three-valued logics and defined them as monotonic ones. Afterwards, Komendantskaya proved that there are four regular three-valued logics and in the three-valued case the set of regular logics coincides with the set of monotonic logics. Next, Tomova showed that in the four-valued case regularity and monotonicity do not coincide. She counted that there are (...) 6400 four-valued regular logics, but only six of them are monotonic. The purpose of this paper is to create natural deduction systems for them. We also describe some functional properties of these logics. (shrink)

By deduction, we often extend both our knowledge and our justified belief. Moreover, in achieving knowledge or justified belief of some proposition, we commonly acquire justification for believing many of its entailed consequences, such as at least some of those that self-evidently follow from it. These and related facts have led some philosophers to endorse strong closure principles, for instance: If a person, S, is justified in believing a proposition, p, and p entails q, then S is justified in (...) believing q. Others have denied such principles, whether for justification or, with the appropriate additions, for knowledge. The debate continues. There is, however, this much consensus: there are difficult problems about the scope of closure, and epistemology should develop theories that can resolve them. (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

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.

The paper explores a deductive-nomological account of metaphysical explanation: some truths metaphysically explain, or ground, another truth just in case the laws of metaphysics determine the latter truth on the basis of the former. I develop and motivate a specific conception of metaphysical laws, on which they are general rules that regulate the existence and features of derivative entities. I propose an analysis of the notion of ‘determination via the laws’, based on a restricted form of logical entailment. I argue (...) that the DN-account of ground can be defended against the well-known objections to the DN-approach to scientific explanation. The goal of the paper is to show that the DN-account of metaphysical explanation is a well-motivated and defensible theory. (shrink)

In this paper, I shall examine attempts to furnish formal models for deductive scientific explanation. All such attempts have had certain defects. The most serious of these defects is to be found in the fact that the extant models seem to be formally restrictive in ways that do not allow any obvious generalization of their conditions which will encompass the full range of all those scientific explanations which must be considered plausible candidates for translation into deductive models.

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)

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)

I propose a deductive-nomological model for mathematical scientific explanation. In this regard, I modify Hempel’s deductive-nomological model and test it against some of the following recent paradigmatic examples of the mathematical explanation of empirical facts: the seven bridges of Königsberg, the North American synchronized cicadas, and Hénon-Heiles Hamiltonian systems. I argue that mathematical scientific explanations that invoke laws of nature are qualitative explanations, and ordinary scientific explanations that employ mathematics are quantitative explanations. I analyse the repercussions of this deductivenomological model (...) on causal explanations. (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)

Cette étude montre comment le météorologue Edward Lorenz, dans deux articles de 1963 et 1964, explore les propriétés des systèmes chaotiques par des allers-retours entre une déduction mathématique (basée sur la théorie des systèmes dynamiques) et une étude des solutions numériques du système dit « de Lorenz » dans un régime d’instabilité. This study aims at showing how the metereologist Edward Lorenz, in two papers of 1963 and 1964, explores the properties of chaotic systems thanks to the interplay between a (...) mathematical deduction (based on dynamical systems theory) and a study of the mathematical solutions of the Lorenz system in an instability regime. (shrink)

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)

A puzzle arises when we consider that, for Kant, the categories are 'original acquisitions' of our understanding to which we must nevertheless prove our entitlement via 'deduction', on pain of dogmatism. I resolve this puzzle by articulating skepticism’s role in the transcendental deduction, drawing on Kant’s construal of the skeptical 'question quid juris' in the juridical terms of entitlement to property. I then situate skepticism’s transformative potential within what Kant regards as reason’s 'maturation' from dogmatism toward self-knowledge. Finally, (...) I contrast Hegel’s account of spirit’s progress toward 'absolute knowledge', which shifts both the mode of skepticism and the prospect of maturation. (shrink)

ABSTRACTThe new paradigm in the psychology of reasoning redirects the investigation of deduction conceptually and methodologically because the premises and the conclusion of the inferences are assumed to be uncertain. A probabilistic counterpart of the concept of logical validity and a method to assess whether individuals comply with it must be defined. Conceptually, we used de Finetti's coherence as a normative framework to assess individuals' performance. Methodologically, we presented inference schemas whose premises had various levels of probability that contained (...) non-numerical expressions and, as a control, sure levels. Depending on the inference schemas, from 60% to 80% of the participants produced coherent conclusions when the premises were uncertain. The data also show that except for schemas involving conjunction, performance was consistently lower with certain than uncertain premises, the rate of conjunction fallacy was consistently low (not exceeding 20%,.. (shrink)

Duncan Pritchard recently proposed a Wittgensteinian solution to closure-based skepticism. According to Wittgenstein, all epistemic systems assume certain truths. The notions that we are not disembodied brains, that the Earth has existed for a long time and that one’s name is such-and-such all function as “hinge commitments.” Pritchard views a hinge commitment as a positive propositional attitude that is not a belief. Because closure principles concern only knowledge-apt beliefs, they do not apply to hinge commitments. Thus, from the fact that (...) a subject knows that he is sitting in a room, and the fact that the subject’s sitting in a room entails his bodily existence, it does not follow that the subject also knows that he is not an envatted brain. This paper rejects Pritchard’s non-belief reading of hinge commitments. I start by showing that the non-belief reading fails to solve the skeptical paradox because the reasons that Pritchard uses to support the non-belief reading do not exempt hinge propositions from closure principles. I then proceed to argue that the non-belief reading is false as it claims that hinge commitments, unlike ordinary beliefs, are rationally unresponsive—with the help of a scenario in which a subject’s experience is internally chaotic, we can safely conclude that the hinge commitment that one is not systematically mistaken about the world is equally responsive to one’s evidential situations. (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.

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)

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} \leq 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)

In this paper I examine five distinctions between deductive and inductive arguments, concluding that the best of the five defines a deductive argument as one in which conclusive favorable relevance to its conclusion is attributed to its premises, and an inductive argument as any argument that is not deductive. This distinction, unlike its rivals, is both exclusive and exhaustive; permits both good and bad arguments of each kind; and is both useful and needed in evaluating at least some arguments.

Our goal is to develop a syntactical apparatus for propositional logics in which the accepted and rejected propositions have the same status and obeying treated in the same way. The suggested approach is based on the ideas of Łukasiewicz used for the classical logic and in addition, it includes the use of multiple conclusion rules. More precisely, a consequence relation is defined on a set of statements of forms “proposition _A_ is accepted” and “proposition _A_ is rejected”, where _A_ is (...) a proposition,—a unified consequence relation. Accordingly, the rules defining a unified consequence relation,—the unified rules, have statements as premises and as conclusions. A special attention is paid to the logics in which each proposition is either accepted or rejected. If we express this property via unified rules and add them to a unified deductive system, such a unified deductive system defines a reversible unified consequence: a statement “proposition _B_ is accepted” is derived from the statement “proposition _A_ is accepted” if and only if a statement “proposition _A_ is rejected” is derived from the statement “proposition _B_ is rejected”. (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)

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)

How is moral knowledge possible? This paper defends the anti-Humean thesis that we can acquire moral knowledge by deduction from wholly non-moral premises. According to Hume’s Law, as it has become known, we cannot deduce an ‘ought’ from an ‘is’, since it is “altogether inconceivable how this new relation can be a deduction from others, which are entirely different from it” (Hume, 1739, 3.1.1). This paper explores the prospects for a deductive theory of moral knowledge that rejects Hume’s (...) Law. (shrink)

The present article illustrates a conflict between the claim that rational belief sets are closed under deductive consequences, and a very inclusive claim about the factors that are sufficient to determine whether it is rational to believe respective propositions. Inasmuch as it is implausible to hold that the factors listed here are insufficient to determine whether it is rational to believe respective propositions, we have good reason to deny that rational belief sets are closed under deductive consequences.

Hypothetico-deductive (H-D) confirmation builds on the idea that confirming evidence consists of successful predictions that deductively follow from the hypothesis under test. This article reviews scope, history and recent development of the venerable H-D account: First, we motivate the approach and clarify its relationship to Bayesian confirmation theory. Second, we explain and discuss the tacking paradoxes which exploit the fact that H-D confirmation gives no account of evidential relevance. Third, we review several recent proposals that aim at a sounder and (...) more comprehensive formulation of H-D confirmation. Finally, we conclude that the reputation of hypothetico-deductive confirmation as outdated and hopeless is undeserved: not only can the technical problems be addressed satisfactorily, the hypothetico-deductive method is also highly relevant for scientific practice. (shrink)