Reasoning From Uncertain Premises

Previous studies have shown that 1 participants are reluctant to accept a conclusion as certainly true when it is derived from a valid conditional argument that includes a doubtful premise, and 2 participants typically link the degree of uncertainty found in a given premise set to its conclusion. Two experiments were designed to further investigate these phenomena. Ninety adult participants in Experiment 1 were first asked to judge the validity of three conditional arguments Modus Ponens, Denial of the Antecedent, and Affirmation of the Consequent. They were then required to evaluate conclusion uncertainty as a function of two degrees of asserted uncertainty in the major conditional premise (If p then it is very probable that q and if p then it is not very probable that q) of the arguments from the first task that were otherwise unchanged. Results revealed an effect for asserted-uncertainty in two of the three argument forms. Marginal support was found for the hypothesis that perceived argument validity would be a predictor of performance. Experiment 2 investigated the way 40 adult participants combined two sources of asserted uncertainty, one in the major premise and another in the minor premise, when they had to score the uncertainty of the conclusion. The two most prominent kinds of responses were to choose the same likelihood as the weaker of the two expressed in the premises, or a lower one. However, the within-subject consistency was poor. Theoretical implications are discussed.     

Deduction from if-then personality signatures

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.     

Moderate Realism and Deduction from Truthlike Theories

Journal of Indian Council of Philosophical Research - Moderate realists hold that scientific theories are truthlike, rather than exactly true. Although scientific realism has been challenged by...     

Contextual Deduction Theorems

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.     

Deduction without awareness

We investigated whether two basic forms of deductive inference, Modus Ponens and Disjunctive Syllogism, occur automatically and without awareness. In Experiment 1, we used a priming paradigm with a set of conditional and disjunctive problems. For each trial, two premises were shown. The second premise was presented at a rate designed to be undetectable. After each problem, participants had to evaluate whether a newly-presented target number was odd or even. The target number matched or did not match a conclusion endorsed by the two previous premises. We found that when the target matched the conclusion of a Modus Ponens inference, the evaluation of the target number was reliably faster than baseline even when participants reported that they were not aware of the second premise. This priming effect did not occur for any other valid or invalid inference that we tested, including the Disjunctive Syllogism. In Experiment 2, we used a forced-choice paradigm in which we found that some participants were able to access some information on the second premise when their attention was explicitly directed to it. In Experiment 3, we showed that the priming effect for Modus Ponens was present also in subjects who could not access any information about P(2). In Experiment 4 we explored whether spatial relations (e.g., "a before b") or sentences with quantifiers (e.g., "all a with b") could generate a priming effect similar to the one observed for Modus Ponens. A priming effect could be found for Modus Ponens only, but not for the other relations tested. These findings show that the Modus Ponens inference, in contrast to other deductive inferences, can be carried out automatically and unconsciously. Furthermore, our findings suggest that critical deductive inference schemata can be included in the range of high-level cognitive activities that are carried out unconsciously.     

A Double Deduction System for Quantum Logic Based On Natural Deduction

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.The author uses his system to prove the following theorem: if propositions of a quantum logical propositional calculus system are mutually compatible, they form a classical subsystem.     

Models of Deduction*

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. *Since the text of this talk was written in 1999, the author has published several papers about related matters (see ‘Identity of proofs based on normalization and generality’, The Bulletin of Symbolic Logic 9 (2003), 477–503, corrected version available at: http://arXiv.org/math.LO/0208094; other titles are available in the same archive).     

The Content of Deduction

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.     

The Scandal of Deduction

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.     

Deduction chains for common knowledge

Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built up by systematically decomposing into its subformulae. In the case where is a valid formula, the decomposition yields a (usually cut-free) proof of . If is not valid, the decomposition produces a countermodel for . In the current paper, we extend this technique to a semiformal system for the Logic of Common Knowledge. The presence of fixed point constructs in this logic leads to potentially infinite-length deduction chains of a non-valid formula, in which case fairness of decomposition requires special attention. An adequate order of decomposition also plays an important role in the reconstruction of the proof of a valid formula from the set of its deduction chains.     

Historic-sociocultural Premises (HSCPs) and Global Change

Global change occurs at many, often interrelated levels. This paper is angled specifically to identify: 1.) Dimensions of similarity and difference across societies. Representative conclusions from anthropology, sociology and cross-cultural psychology are explored. These dimensions could serve to determine base-lines to study global change in cultural traits and beliefs over time; 2.) It is argued, however, that for practical purposes, aimed at faster global change to a better world, with pluralism, human rights and ecological consciousness, it is better to proceed ethnopsychologically. The case of Mexico regarding generalized beliefs and their change over time is considered.     

The Logical Deduction of Doctrine

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.     

Natural Deduction and Curry's Paradox

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.