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

1. It is a fact that developing a good proof theory for modal logics is a difficult task. The problem is not in having deductive systems. In fact, all the main modal logics enjoy an axiomatic prese...

Deduction systems and graph transformation systems are compared within a common categorical framework. This comparison results in a proposal for a new deduction method in diagrammatic logics, allowing the deletion of intermediate lemmas.

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.

In these comments, I share some remarks concerning two main points lying at the core of Gava’s book Kant’s Critique of Pure Reason and the Method of Metaphysics: Gava’s reconstruction and account of a transcendental deduction, its relation to a metaphysical deduction, and more specifically his reading of the B-Deduction. I will discuss Gava’s arguments in order to highlight the key tenets of his interpretation and raise questions related to (1) the meaning and scope of the notion of ‘transcendental’; and (...) (2) the commitment to – and the extent of – what we might call ‘cognitive constructivism’. (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.

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 purely (...) inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

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

This chapter contains sections titled: Introduction Statements The Square of Opposition Figure and Mood Deduction Counterexamples Independence Soundness Completeness: Syllogistic Arguments Completeness: Categorical Arguments Completeness: Arguments in General Note Bibliography.

In philosophy, an argument consists of a set of statements called premises that serve as grounds for affirming another statement called the conclusion. Philosophers typically distinguish arguments in natural languages (such as English) into two fundamentally different types: deductive and inductive. Each type of argument is said to have characteristics that categorically distinguish it from the other type. The two types of argument are also said to be subject to differing evaluative standards. Pointing to paradigmatic examples of each type (...) of argument helps to clarify their key differences. The distinction between the two types of argument may hardly seem worthy of philosophical reflection, as evidenced by the fact that their differences are usually presented as straightforward, such as in many introductory philosophy textbooks. Nonetheless, the question of how best to distinguish deductive from inductive arguments, and indeed whether there is a coherent categorical distinction between them at all, turns out to be considerably more problematic than commonly recognized. This article identifies and discusses a range of different proposals for marking categorical differences between deductive and inductive arguments while highlighting the problems and limitations attending each. Consideration is also given to the ways in which one might do without a distinction between two types of argument by focusing solely on the application of evaluative standards to arguments instead. (shrink)

The fallibility of deduction is the thesis that a thoughtful speaker-reasoner can wrongly believe that an inference is deductively valid. The author presents an argument to the effect that the fallibility of deduction is incompatible with the widespread view that deduction is epistemically unfruitful (the conclusion is contained in the premises, and the transition from premises to conclusion never extends knowledge). If the fallibility of deduction is a fact, the argument presented is a refutation of the doctrine of the unfruitfulness (...) of deduction. But its relevance goes further, because the argument reveals a connection between two different problems: a solution to the problem of fruitfulness (how can deductive inferences increase our knowledge?) is a starting point for a solution to the problem of fallibility (how can deductive inferences be wrong?). To solve the problem of fruitfulness, Michael Dummett proposed some general ideas concerning meaning and inference. Starting from these meaning-theoretical ideas, one can develop an explanation of the fallibility of deduction. The general explanatory strategy does not depend on the choice between a theory of meaning centered on truth, verification, inferential role, or on other key notions. (shrink)

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

The fifth “deduction” in Plato’s Parmenides concerns the consequences that follow for a one from the hypothesis that it is not. I argue that the subject of this hypothesis is, effectively, any Form, considered just insofar as it is one Form. The hypothesis, I further argue, does not concern any essential aspect of a Form, but rather posits its contingent non-instantation. The motion this deduction attributes to its one is a special type of motion: motion into and out of instantiation.

Hybrid deduction-refutation systems are presented for four first degree entailment based logics. The hybrid systems are shown to deductively and refutationally sound and complete with respect to their logics. The proofs of completeness are presented in a uniform way. This paper builds on work in [6], where Goranko presented a deductively and refutationally sound and complete hybrid system for classical logic.

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

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

This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.

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

We present an algebraic proof of the theorem stating that there are continuum many axiomatic extensions of global consequence associated with modal system E that do not admit the local deduction detachment theorem. We also prove that all these logics lack the finite frame property and have exactly three proper axiomatic extensions, each of which admits the local deduction detachment theorem.

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

Neither strict deduction nor high expectability is a necessary condition for historical explanation. Explanations that separate history from mere narrative are necessary, but deduction from causes is not a priori the only source. Explanations in terms of reasons, emotions, and motives of actors are essential and are satisfactory when an agent's reason for an action is made convincing and believable. The principle of action must make evident the appeal of some human good in the action with which we can empathize (...) or which is rationally understandable; there is an intimate connection between historical explanation and moral evaluation. The alternative account of historical explanation sacrifices the simplicity of the deductive model but gains several advantages in exchange, including greater descriptive fidelity to actual historical explanations. (shrink)

Deductive Irrationality examines and critiques economic rationalism by assessing the work of influential political philosophers and economic theorists such as Thomas Hobbes, John Locke, Adam Smith, Friedrich Hayek, Gunnar Myrdal, and John F. Muth. It is one of the first serious attempts to investigate the dominant sub-fields in economic theory through the lens of political philosophy.

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

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)

The paper deals with reconstruction of the unique reductivecounterpart of the deductive logic. The procedure results in the deductivereductive form of logic. This extension is illustrated on the base of intuitionistic logics: Heyting’s, Brouwerian and Heyting-Brouwer’s ones.

A simple summary of the difference between induction and deduction.

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)

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)

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

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

This paper deals with Popper's little-known work on deductive logic, published between 1947 and 1949. According to his theory of deductive inference, the meaning of logical signs is determined by certain rules derived from ?inferential definitions? of those signs. Although strong arguments have been presented against Popper's claims (e.g. by Curry, Kleene, Lejewski and McKinsey), his theory can be reconstructed when it is viewed primarily as an attempt to demarcate logical from non-logical constants rather than as a semantic (...) foundation for logic. A criterion of logicality is obtained which is based on conjunction, implication and universal quantification as fundamental logical operations. (shrink)

According to Hempel, all scientific explanations and predictions which are produced exclusively with deterministic laws must be deductive, in the sense that the explanandum or the prediction must be a logical consequence of the laws and the initial conditions in the explanans. This deducibility thesis has been attacked from several quarters. Some time ago Canfield and Lehrer presented a “refutation” of DT as applied to predictions, in which they tried to prove that “if the deductive reconstruction [DT for (...) predictions] were an adequate reconstruction, then scientific prediction would be impossible”. Their argument seems to have been uncontested except for an inconclusive rejoinder by Beard. Moreover, Stegmüller has recently argued that “it may turn out that all or at least most of the so-called deductive-nomological explanations are in truth inductive and not deductive arguments, in view of the difficulty which has been pointed out by Canfield and Lehrer”. It seems it would be worth investigating whether Canfield and Lehrer's argument is, indeed, correct. (shrink)

I argue that the reasonable quest of looking for, and the desirable end of having better explanation of particular events are not allowed for by the deductive account of explanation except by total replacement of one theory by another. The article is also a trivialization of the deductive conception of complete explanation.

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

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)

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

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

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

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)

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

The paper is concerned with the psychological relevance of a logical model for deductive reasoning. We propose a new way to analyze logical reasoning in a deductive version of the Mastermind game implemented within a popular Dutch online educational learning system (Math Garden). Our main goal is to derive predictions about the difficulty of Deductive Mastermind tasks. By means of a logical analysis we derive the number of steps needed for solving these tasks (a proxy for working (...) memory load). Our model is based on the analytic tableaux method, known from proof theory. We associate the difficulty of Deductive Mastermind game-items with the size of the corresponding logical trees obtained by the tableaux method. We derive empirical hypotheses from this model. A large group of students (over 37 thousand children, 5–12 years of age) played the Deductive Mastermind game, which gave empirical difficulty ratings of all 321 game-items. The results show that our logical approach predicts these item ratings well, which supports the psychological relevance of our model. (shrink)

Deductive Irrationality examines and critiques economic rationalism by assessing the work of influential political philosophers and economic theorists such as Thomas Hobbes, John Locke, Adam Smith, Friedrich Hayek, Gunnar Myrdal, and John F. Muth. It is one of the first serious attempts to investigate the dominant sub-fields in economic theory through the lens of political philosophy.

If ever there were scientific procedures that seemed immune to history, induction and deduction would be them. Their validity seemingly unimpinged by the vicissitudes of history, they appear a proper subject of discussion for philosophers and scientists, but not for historians. Historians pride themselves on demonstrating that the internal logic of theory is historical — a response to particular conditions. Breakdowns in logic present historians with opportune moments for historicization, for showing how theoreticians’ efforts to respond to their situation made (...) them move inconsistently. When it comes to induction and deduction, however, they seem so universal and basic — the logic and methodology of science unthinkable without them — that any effort to demonstrate their historically bound character risks relativizing science and, some would argue, undermine rational exchange. Can the historian participate, qua historian, in the conversation on induction and deduction without unraveling science and undermining rational exchange? (shrink)

THE INDICATIVE CONDITIONAL. A PROBABILISTIC CRITERION OF SOUNDNESS FOR DEDUCTIVE INFERENCES Our objective in this section is to establish a prima facie case ...

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.

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)