Using a latent variable modelling strategy we study individual differences in patterns of answers to the selection task and to the truth table task. Specifically we investigate the prediction of mental model theory according to which the individual tendency to select the false consequent card (in the selection task) is negatively correlated with the tendency to judge the false antecedent cases as irrelevant (in the truth table task). We fit a psychometric model to two large samples (...) ( N = 486, twice), and find no evidence for this negative correlation. We examine which of the assumptions of the model theory must be amended to accommodate our findings. (shrink)

While there is now considerable experimental evidence that, on the one hand, participants assign to the indicative conditional as probability the conditional probability of consequent given antecedent and, on the other, they assign to the indicative conditional the “defective truth-table” in which a conditional with false antecedent is deemed neither true nor false, these findings do not in themselves establish which multi-premise inferences involving conditionals participants endorse. A natural extension of the truth-table semantics pronounces as (...) valid numerous inference patterns that do seem to be part of ordinary usage. However, coupled with something the probability account gives us—namely that when conditional-free ϕ entails conditional-free ψ, “if ϕ then ψ” is a trivial, uninformative truth—we have enough logic to derive the paradoxes of material implication. It thus becomes a matter of some urgency to determine which inference patterns involving indicative conditionals participants do endorse. Only thus will we be able to arrive at a realistic, systematic semantics for the indicative conditional. (shrink)

Two types of truth table tasks are used investigating mental representations of conditionals: a possibilities-based and a truth-based one. In possibilities tasks, participants indicate whether a situation is possible or impossible according to the conditional rule. In truth tasks participants evaluate whether a situation makes the rule true or false, or is irrelevant with respect to the truth of the rule. Comparing the two-option version of the possibilities task with the truth task in Experiment (...) 1, the possibilities task yields logical answer patterns whereas the truth task yields defective patterns. Adding the irrelevant option to the possibilities task in Experiment 2 leads to a considerable amount of defective patterns in the possibilities task, but still to more logical patterns in the possibilities task than in the truth task. Experiment 3 shows that directionality matters since rule-to-situation tasks yield more logical answer patterns than do situation-to-rule tasks. We conclude that both task types are not comparable as such since wording, number of options and directionality influence the results. (shrink)

Psychological research on people’s understanding of natural language connectives has traditionally used truth table tasks, in which participants evaluate the truth or falsity of a compound sentence given the truth or falsity of its components in the framework of propositional logic. One perplexing result concerned the indicative conditional if A then C which was often evaluated as true when A and C are true, false when A is true and C is false but irrelevant“ (devoid of (...) value) when A is false (whatever the value of C). This was called the “psychological defective table of the conditional.” Here we show that far from being anomalous the “defective” table pattern reveals a coherent semantics for the basic connectives of natural language in a trivalent framework. This was done by establishing participants’ truth tables for negation, conjunction, disjunction, conditional, and biconditional, when they were presented with statements that could be certainly true, certainly false, or neither. We review systems of three-valued tables from logic, linguistics, foundations of quantum mechanics, philosophical logic, and artificial intelligence, to see whether one of these systems adequately describes people’s interpretations of natural language connectives. We find that de Finetti’s (1936/1995) three-valued system is the best approximation to participants’ truth tables. (shrink)

Given a basic conditional of the form, If A then C, individuals usually list three cases as possible: A and C, not‐A and not‐C, not‐A and C. This result corroborates the theory of mental models. By contrast, individuals often judge that the conditional is true only in the case of A and C, and that cases of not‐A are irrelevant to its truth or falsity. This result corroborates other theories of conditionals. To resolve the discrepancy, we devised two new (...) tasks: the “collective” truth task, in which participants judged whether sets of assertions about a specific individual, such as: If A then C, not‐A, C, could all be true at the same time; and one in which participants judged the truth of conditional predictions about specific future events. The results consistently matched the three possibilities, thereby corroborating the model theory. They also showed a massive violation of the probability calculus in estimates of the probabilities of the four cases in the partition of conditionals (A and C, A and not‐C, not‐A and C, and not‐A and not‐C), which summed to over 200%. (shrink)

The new paradigm in the psychology of reasoning adopts a Bayesian, or prob- abilistic, model for studying human reasoning. Contrary to the traditional binary approach based on truth functional logic, with its binary values of truth and falsity, a third value that represents uncertainty can be introduced in the new paradigm. A variety of three-valued truth table systems are available in the formal literature, including one proposed by de Finetti. We examine the descriptive adequacy of these (...) systems for natural language indicative condi- tionals and bets on conditionals. Within our framework the so-called “defective” truth table, in which participants choose a third value when the antecedent of the indicative conditional is false, becomes a coherent response. We show that only de Finetti’s system has a good descriptive fit when uncer- tainty is the third value. (shrink)

The new Bayesian paradigm in the psychology of reasoning aims to integrate the study of human reasoning, decision making, and rationality. It is supported by two findings. One, most people judge the probability of the indicative conditional, P(if A then B), to be the conditional probability, P(B|A), as implied by the Ramsey test. Two, they judge if A then B to be void when A is false. Their three-valued response table used to be called ‘defective’, but should be (...) termed the de Finetti table. We show how to study general de Finetti truth tables for negations, conjunctions, disjunctions, and conditionals. (shrink)

Iterated conditionals of the form If p, then if q, r are an important topic in philosophical logic. In recent years, psychologists have gained much knowledge about how people understand simple conditionals, but there are virtually no published psychological studies of iterated conditionals. This paper presents experimental evidence from a study comparing the iterated form, If p, then if q, r with the “imported,” noniterated form, If p and q, then r, using a probability evaluation task and a truth- (...) class='Hi'>table task, and taking into account qualitative individual differences. This allows us to critically contrast philosophical and psychological approaches that make diverging predictions regarding the interpretation of these forms. The results strongly support the probabilistic Adams conditional and the “new paradigm” that takes this conditional as a starting point. (shrink)

Abstract: From familiar concepts like TALL and TABLE to exotic ones like GRAVITY and GENOCIDE, they guide our lives and are the basis for how we represent the world. However, there is good reason to think that many of our most cherished concepts, like TRUTH, FREEDOM, KNOWLEDGE, and RATIONALITY are defective in the sense that the rules for using them are inconsistent. This defect leads those who possess these concepts into paradoxes and absurdities. Indeed, I argue that (...) many of the central problems of contemporary philosophy should be thought of as having their source in philosophical concepts that are defective in this way. If that is right, then we should take a more active role in crafting and sculpting our conceptual repertoire. We need to explore various ways of replacing these defective concepts with ones that will still do the work we need them to do without leading us into contradictions. (shrink)

The new Bayesian paradigm in the psychology of reasoning aims to integrate the study of human reasoning, decision making, and rationality. It is supported by two findings. One, most people judge the probability of the indicative conditional, P, to be the conditional probability, P, as implied by the Ramsey test. Two, they judge if A then B to be void when A is false. Their three‐valued response table used to be called ‘defective’, but should be termed the de (...) Finetti table. We show how to study general de Finetti truth tables for negations, conjunctions, disjunctions, and conditionals. (shrink)

Developing a suggestion of Wittgenstein, I provide an account of truth tables as formulas of a formal language. I define the syntax and semantics of TPL (the language of Tabular Propositional Logic), and develop its proof theory. Single formulas of TPL, and finite groups of formulas with the same top row and TF matrix (depiction of possible valuations), are able to serve as their own proofs with respect to metalogical properties of interest. The situation is different, however, for groups (...) of formulas whose top rows differ. For them I provide (i) a tree-style system of ‘row tree proofs’, which is shown to be sound and complete, and (ii) an alternative, re-writing strategy. (shrink)

We study the weak truth table degree spectra of first-order relational structures. We prove a dichotomy among the possible wtt degree spectra along the lines of Knight’s upward-closure theorem for Turing degree spectra. We prove new results contrasting the wtt degree spectra of finite- and infinite-signature structures. We show that, as a method of defining classes of reals, the wtt degree spectrum is, except for some trivial cases, strictly more expressive than the Turing degree spectrum.

Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen’s Theorem fails for both randomnesses. In this paper we define truth-table Schnorr randomness and truth-table reducible randomness, for which we prove that van Lambalgen's Theorem holds. We also show that the classes of truth-table Schnorr random reals relative to a high set contain reals Turing equivalent to the high set. It follows that each high Schnorr random real is half of (...) a real for which van Lambalgen's Theorem fails. Moreover we establish the coincidence between triviality and lowness notions for truth-table Schnorr randomness. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

In our former works, for a given concept of reduction, we study the following hypothesis: “For a random oracle A, with probability one, the degree of the one-query tautologies with respect to A is strictly higher than the degree of A.” In our former works (Suzuki in Kobe J. Math. 15, 91–102, 1998; in Inf. Comput. 176, 66–87, 2002; in Arch. Math. Logic 44, 751–762), the following three results are shown: The hypothesis for p-T (polynomial-time Turing) reduction is equivalent to (...) the assertion that the probabilistic complexity class R is not equal to NP; The hypothesis for p-tt (polynomial-time truth-table) reduction implies that P is not NP; The hypothesis holds for each of the following: disjunctive reduction, conjunctive reduction, and p-btt (polynomial-time bounded-truth-table) reduction. In this paper, we show the following three results: (1) Let c be a positive real number. We consider a concept of truth-table reduction whose norm is at most c times size of input, where for a relativized propositional formula F, the size of F denotes the total number of occurrences of propositional variables, constants and propositional connectives. Then, our main result is that the hypothesis holds for such tt-reduction, provided that c is small enough. How small c can we take so that the above holds? It depends on our syntactic convention on one-query tautologies. In our setting, the statement holds for all c < 1. (2) The hypothesis holds for monotone truth-table reduction (also called positive reduction). (3) Dowd (in Inf. Comput. 96, 65–76, 1992) shows a polynomial upper bound for the minimum sizes of forcing conditions associated with a random oracle. We apply the above result (1), and get a linear lower bound for the sizes. (shrink)

The relativized propositional calculus is a system of Boolean formulas with query symbols. A formula in this system is called a one-query formula if the number of occurrences of query symbols is just one. If a one-query formula is a tautology with respect to a given oracle A then it is called a one-query tautology with respect to A. By extending works of Ambos-Spies (1986) and us (2002), we investigate the measure of the class of all oracles A such that (...) the set of all one-query tautologies with respect to A does not p-btt-reduce to A, where p-btt denotes polynomial-time bounded-truth-table. We show that certain Dowd-type generic oracles all belong to the class, and hence measure of the class is one. (shrink)

Iterated conditionals of the form If p, then if q, r are an important topic in philosophical logic. In recent years, psychologists have gained much knowledge about how people understand simple conditionals, but there are virtually no published psychological studies of iterated conditionals. This paper presents experimental evidence from a study comparing the iterated form, If p, then if q, r with the “imported,” noniterated form, If p and q, then r, using a probability evaluation task and a truth‐ (...) class='Hi'>table task, and taking into account qualitative individual differences. This allows us to critically contrast philosophical and psychological approaches that make diverging predictions regarding the interpretation of these forms. The results strongly support the probabilistic Adams conditional and the “new paradigm” that takes this conditional as a starting point. (shrink)

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. (...) Rather than any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

Two types of truth table task are used to examine people's mental representation of conditionals. In two within-participants experiments, participants either receive the same task-type twice (Experiment 1) or are presented successively with both a possibilities task and a truth task (Experiment 2). Experiment 3 examines how people interpret the three-option possibilities task and whether they have a clear understanding of it. The present study aims to examine, for both task-types, how participants' cognitive ability relates to the (...) classification of the truth table cases as irrelevant, and their consistency in doing so. Looking at the answer patterns, participants' cognitive ability influences their classification of the truth table cases: A positive correlation exists between cognitive ability and the number of false-antecedent cases classified as ?irrelevant?, both in the possibilities task and the truth task. This favours a suppositional representation of conditionals. (shrink)

Let $D_{tt} $ denote the set of truth-table degrees. A bijection π: $D_{tt} \to \,D_{tt} $ is an automorphism if for all truth-table degrees x and y we have $ \leqslant _{tt} \,y\, \Leftrightarrow \,\pi (x)\, \leqslant _{tt} \,\pi (y)$ . We say an automorphism π is fixed on a cone if there is a degree b such that for all $x \geqslant _{tt} b$ we have π(x) = x. We first prove that for every 2-generic (...) real X we have X' $X' \le _{tt} \,X\, \oplus \,0'$ . We next prove that for every real $X \ge _{tt} \,0'$ there is a real Y such that $Y \oplus 0{\text{'}}\, \equiv _{tt} \,Y{\text{'}} \equiv _{tt} \,X$ . Finally, we use this to demonstrate that every automorphism of the truth-table degrees is fixed on a cone. (shrink)

There are certain uses of and and or that cannot be explained by their normal meanings as truth-functional connectives, even with sophisticated pragmatic resources. These include examples such as The cops show up, and a fight will break out (‘If the cops show up, a fight will break out’), and I have no friends, or I would throw a party (‘I have no friends. If I did have friends, I would throw a party.’). We argue that these uses are (...) indeed distinct from the more ordinary uses of and and or, but that they are nonetheless related in a principled way. To explain them we give an analysis of what we call the dynamic effects of connectives, which arise in all their uses. The special uses at issue are then argued to be instances where the connectives exhibit their dynamic effects without their truth-conditional meaning. (shrink)

Kalrnaric. We set out a system T, consisting of normal proofs constructed by means of elegantly symmetrical introduction and elimination rules. In the system T there are two requirements, called ( ) and ()), on applications of discharge rules. T is sound and complete for Kalmaric arguments. ( ) requires nonvacuous discharge of assumptions; ()) requires that the assumption discharged be the sole one available of highest degree. We then consider a 'Duhemian' extension T*, obtained simply by dropping the requirement (...) ()). T* is a proper subsystem of intuitionistic relevant logic. Our main result is that T* is a double negation consistency companion to classical logic. Thus all one needs to add to T* to obtain classical logic is the (intuitionistic) absurdity rule, and the (classical) rule of double nega-. (shrink)

We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey, Griffiths and LaForte.

In this paper, a novel experimental task is developed for testing the highly influential, but experimentally underexplored, possible worlds account of conditionals (Stalnaker, 1968; Lewis, 1973). In Experiment 1, this new task is used to test both indicative and subjunctive conditionals. For indicative conditionals, five competing truth tables are compared, including the previously untested, multi-dimensional possible worlds semantics of Bradley (2012). In Experiment 2, these results are replicated and it is shown that they cannot be accounted for by an (...) alternative hypothesis proposed by our reviewers. In Experiment 3, individual variation in truth assignments of indicative conditionals is investigated via Bayesian mixture models that classify participants as following one of several competing models. As a novelty of this study, it is found that a possible worlds semantics of Lewis and Stalnaker is capable of accounting for participants’ aggregate truth value assignments in this task. Applied to indicative conditionals, we show across three experiments, that the theory both captures participants’ truth values at the aggregate level (Experiments 1 and 2) and that it makes up the largest subgroup in the analysis of individual variation in our experimental paradigm (Experiment 3). (shrink)

It has been suggested that Russell and or Wittgenstein arrived at a truth-table device in or around 1912 [Shosky 1997], and that, since the history of its development is so complex, the best one can claim is that theirs may be the first identifiably ascribable example. However, Charles Peirce had, unbeknownst to most logicians of the time, already developed a truth table for binary connectives of his algebra of logic in 1902.

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two (...) ways out of the predicament: one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

Informal construction -- Formal construction -- Limiting results.

This dissertation is devoted to empirically contrasting the Suppositional Theory of conditionals, which holds that indicative conditionals serve the purpose of engaging in hypothetical thought, and Inferentialism, which holds that indicative conditionals express reason relations. Throughout a series of experiments, probabilistic and truth-conditional variants of Inferentialism are investigated using new stimulus materials, which manipulate previously overlooked relevance conditions. These studies are some of the first published studies to directly investigate the central claims of Inferentialism empirically. In contrast, the Suppositional (...) Theory of conditionals has an impressive track record through more than a decade of intensive testing. The evidence for the Suppositional Theory encompasses three sources. Firstly, direct investigations of the probability of indicative conditionals, which substantiate “the Equation” (P(if A, then C) = P(C|A)). Secondly, the pattern of results known as “the defective truth table” effect, which corroborates the de Finetti truth table. And thirdly, indirect evidence from the uncertain and-to-if inference task. Through four studies each of these sources of evidence are scrutinized anew under the application of novel stimulus materials that factorially combine all permutations of prior and relevance levels of two conjoined sentences. The results indicate that the Equation only holds under positive relevance (P(C|A) – P(C|¬A) > 0) for indicative conditionals. In the case of irrelevance (P(C|A) – P(C|¬A) = 0), or negative relevance (P(C|A) – P(C|¬A) < 0), the strong relationship between P(if A, then C) and P(C|A) is disrupted. This finding suggests that participants tend to view natural language conditionals as defective under irrelevance and negative relevance (Chapter 2). Furthermore, most of the participants turn out only to be probabilistically coherent above chance levels for the uncertain and-to-if inference in the positive relevance condition, when applying the Equation (Chapter 3). Finally, the results on the truth table task indicate that the de Finetti truth table is at most descriptive for about a third of the participants (Chapter 4). Conversely, strong evidence for a probabilistic implementation of Inferentialism could be obtained from assessments of P(if A, then C) across relevance levels (Chapter 2) and the participants’ performance on the uncertain-and-to-if inference task (Chapter 3). Yet the results from the truth table task suggest that these findings could not be extended to truth-conditional Inferentialism (Chapter 4). On the contrary, strong dissociations could be found between the presence of an effect of the reason relation reading on the probability and acceptability evaluations of indicative conditionals (and connate sentences), and the lack of an effect of the reason relation reading on the truth evaluation of the same sentences. A bird’s eye view on these surprising results is taken in the final chapter and it is discussed which perspectives these results open up for future research. (shrink)

If r is a reducibility between sets of numbers, a natural question to ask about the structure ? r of the r-degrees containing computably enumerable sets is whether every element not equal to the greatest one is branching (i.e., the meet of two elements strictly above it). For the commonly studied reducibilities, the answer to this question is known except for the case of truth-table (tt) reducibility. In this paper, we answer the question in the tt case by (...) showing that every tt-incomplete computably enumerable truth-table degree a is branching in ? tt . The fact that every Turing-incomplete computably enumerable truth-table degree is branching has been known for some time. This fact can be shown using a technique of Ambos-Spies and, as noticed by Nies, also follows from a relativization of a result of Degtev. We give a proof here using the Ambos-Spies technique because it has not yet appeared in the literature. The proof uses an infinite injury argument. Our main result is the proof when a is Turing-complete but tt-incomplete. Here we are able to exploit the Turing-completeness of a in a novel way to give a finite injury proof. (shrink)

This essay provides an intuitive technique that illustrates why a conditional must be true when the antecedent is false and the consequent is either true or false. Other techniques for explaining the conditional’s truth table are unsatisfactory.

There is ample evidence that in classical truth table task experiments false antecedents are judged as ?irrelevant?. Instead of interpreting this in support of a suppositional representation of conditionals, Schroyens (2010a, 2010b) attributes it to the induction problem: the impossibility of establishing the truth of a universal claim on the basis of a single case. In the first experiment a truth table task with four options is administered and the correlation with intelligence is inspected. It (...) is observed that ?undetermined? is chosen in one third of the judgements and ?irrelevant? in another third. A positive correlation is revealed between intelligence and the number of ?irrelevant? and ?undetermined? judgements. The data do not exclude that a part of the ?irrelevant? judgements in classical truth table task experiments might be caused by the induction problem. In the second experiment participants are presented with a simplified four-option truth table task and asked for a justification of their judgements. These justifications show the induction problem is not the reason for choosing the ?irrelevant? or ?undetermined? option, which is supportive for a suppositional representation of conditionals. (shrink)

The following theorems on the structure inside nonrecursive truth-table degrees are established: Dëgtev's result that the number of bounded truth-table degrees inside a truth-table degree is at least two is improved by showing that this number is infinite. There are even infinite chains and antichains of bounded truth-table degrees inside every truth-table degree. The latter implies an affirmative answer to the following question of Jockusch: does every truth-table degree (...) contain an infinite antichain of many-one degrees? Some but not all truth-table degrees have a least bounded truth-table degree. The technique to construct such a degree is used to solve an open problem of Beigel, Gasarch and Owings: there are Turing degrees (constructed as hyperimmune-free truth-table degrees) which consist only of 2-subjective sets and therefore do not contain any objective set. Furthermore, a truth-table degree consisting of three positive degrees is constructed where one positive degree consists of enumerable semirecursive sets, one of coenumerable semirecursive sets and one of sets, which are neither enumerable nor coenumerable nor semirecursive. So Jockusch's result that there are at least three positive degrees inside a truth-table degree is optimal. The number of positive degrees inside a truth-table degree can also be some other odd integer as for example nineteen, but it is never an even finite number. (shrink)

We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can be built into a tableau-like method without affecting its analytic nature.

We explore the technical details and historical evolution of Charles Peirce's articulation of a truth table in 1893, against the background of his investigation into the truth-functional analysis of propositions involving implication. In 1997, John Shosky discovered, on the verso of a page of the typed transcript of Bertrand Russell's 1912 lecture on ?The Philosophy of Logical Atomism? truth table matrices. The matrix for negation is Russell's, alongside of which is the matrix for material implication (...) in the hand of Ludwig Wittgenstein. It is shown that an unpublished manuscript identified as composed by Peirce in 1893 includes a truth table matrix that is equivalent to the matrix for material implication discovered by John Shosky. An unpublished manuscript by Peirce identified as having been composed in 1883?1884 in connection with the composition of Peirce's ?On the Algebra of Logic: A Contribution to the Philosophy of Notation? that appeared in the American Journal of Mathematics in 1885 includes an example of an indirect truth table for the conditional. (shrink)