On the impediment of logical reasoning by non-logical inferential methods

Similar documents
Propositional Logic: Part II - Syntax & Proofs 0-0

Bar-Hillel and the Division of Labor in Language

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC

Relational Reasoning in Natural Language

Section 1.3: Valid and Invalid Arguments

Breaking de Morgan s law in counterfactual antecedents

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Truth-Functional Logic

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

[read Chapter 2] [suggested exercises 2.2, 2.3, 2.4, 2.6] General-to-specific ordering over hypotheses

Aristotle s Syllogistic

A Quick Lesson on Negation

Natural Deduction for Propositional Logic

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

Handout: Proof of the completeness theorem

From syllogism to common sense: a tour through the logical landscape. Categorical syllogisms

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Lecture Notes on The Curry-Howard Isomorphism

Natural deduction for truth-functional logic

Formal Logic. Critical Thinking

Model-theoretic Vagueness vs. Epistemic Vagueness

Monotonicity and the Complexity of Reasoning with Quantifiers

Deductive Systems. Lecture - 3

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

(1) You re allowed to draw at most three cards.

PHIL12A Section answers, 28 Feb 2011

Basics of conversational implicatures

6.825 Techniques in Artificial Intelligence. Logic Miscellanea. Completeness and Incompleteness Equality Paramodulation

ESSLLI 2007 COURSE READER. ESSLLI is the Annual Summer School of FoLLI, The Association for Logic, Language and Information

First Order Logic: Syntax and Semantics

Two sets of alternatives for numerals

Reading 5 : Induction

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )

CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

The predicate calculus is complete

Formal Logic Lecture 11

arxiv: v1 [cs.ai] 27 Nov 2014

SKETCHY NOTES FOR WEEKS 7 AND 8

Module 5 K and Equivalent Systems

Overview of Today s Lecture

First-Degree Entailment

Hoare Logic I. Introduction to Deductive Program Verification. Simple Imperative Programming Language. Hoare Logic. Meaning of Hoare Triples

Homogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations

Note: To avoid confusion with logical jargon, "nvt" means "not validated as tautologous"

Deductive and Inductive Logic

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )

Truth Tables for Arguments

Propositions and Proofs

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Propositional Logic Review

Chapter 1: The Logic of Compound Statements. January 7, 2008

CS 730/830: Intro AI. 3 handouts: slides, asst 6, asst 7. Wheeler Ruml (UNH) Lecture 12, CS / 16. Reasoning.

Ibn Sīnā s syllogistic: a logic between modal and many-valued

Logicality of Operators

Ling 130 Notes: Syntax and Semantics of Propositional Logic

Exhaustive interpretations: what to say and what not to say

Introduction to Logic: Argumentation and Interpretation. Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D

Intermediate Logic. Natural Deduction for TFL

A Weakness for Donkeys

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

Two-Dimensional Modal Logic

Two-Dimensional Modal Logic

Syllogistic Logic with Complements

Learning Goals of CS245 Logic and Computation

Logical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5

Introduction to Intuitionistic Logic

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final examination Logic & Set Theory (2IT61/2IT07/2IHT10) (correction model)

Overview of Today s Lecture

CS 730/730W/830: Intro AI

Week 4. COMP62342 Sean Bechhofer, Uli Sattler

Logic I - Session 22. Meta-theory for predicate logic

CSCI3390-Lecture 6: An Undecidable Problem

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

CITS2211 Discrete Structures (2017) Cardinality and Countability

Designing and Evaluating Generic Ontologies

Computational Cognitive Science

a. Introduction to metatheory

Generalized Quantifiers Logical and Linguistic Aspects

Arguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)

Semantics and Pragmatics of NLP

PUZZLE. You meet A, B, and C in the land of knights and knaves. A says Either B and I are both knights or we are both knaves.

Introduction to Logic in Computer Science: Autumn 2006

Relevant Logic. Daniel Bonevac. March 20, 2013

arxiv: v3 [cs.ai] 7 Mar 2018

CMPSCI 601: Tarski s Truth Definition Lecture 15. where

Some Logical Aspects of Mathematical Reasoning

McTaggart s Argument for the Unreality of Time:

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

Antecedents of counterfactuals violate de Morgan s law

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning

Propositional Logic: Review

26. Januar Introduction to Computational Semantics

Lecture 8 : Structural Induction DRAFT

(1) If Bush had not won the last election, then Nader would have won it.

Aristotle, Boole, and Chu Duality since 350 BC

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10

Transcription:

On the impediment of logical reasoning by non-logical inferential methods Andreas Haida, Luka Crnič & Yosef Grodzinsky ELSC & LLCC, The Hebrew University of Jerusalem grodzinskylab.com September 10, 2017 Sinn und Bedeutung 22 Special session Semantics and Natural Logic 1 / 23

Drawing inferences Assume that sentence (A) is true. Does it follow logically that (I) is true as well? (A) (I) All of the Ms are Ks Some of the Ms are Ks in 73% of all trials Now, assume that sentence (I) is true. Can you logically infer that (O) is true, too? (I) (O) Some of the Ms are Ks Some of the Ms are not Ks Finally, is the following inference logically valid? in 94% of all trials (A) (O) All of the Ms are Ks Some of the Ms are not Ks in 98% of all trials The numbers show the results of Newstead and Griggs (1983). 2 / 23

Logical validity vs. perceived validity This is how the observed behavior matches with logical behavior: Inference % accept expected in Aristotelian logic % accept observed % error (A) to (I) 100 73 27 (I) to (O) 0 94 94 (A) to (O) 0 2 2 What causes the two big error rates? Subjects compute scalar inferences (SIs). Why are the error rates not (close to) 100%? There are different populations: Some reasoners compute SIs, some don t. Why different error rates (27 vs. 94%)? Again, there are different populations: Some reasoners compute SIs for premises only. 3 / 23

SIs of existential sentences (I) sentences are systematically ambiguous: (I) Some of the Ms are Ks (I w ) There are Ms that are Ks (weak interpretation) (I s ) Only some of the Ms are Ks (strong interpretation) (I s ) is derived from (I w ) by a SI: (I s ) (I w ) All of the Ms are Ks The same holds for (O) sentences: (O) Some of the Ms are not Ks (O w ) There are Ms that are not Ks (O s ) Only some of the Ms are not Ks (I s ) (O s ) (O w ) All of the Ms are not Ks To test our hypothesis that there are different groups of reasoners with respect to SI computation, we re investigating syllogistic reasoning. 4 / 23

Syllogisms Syllogisms are arguments of the form Here s an example of a valid syllogism: (E) (A) (E) No Italians are miners All bikers are Italians No bikers are miners Premise 1 Premise 2 Conclusion New sentence type: (E) sentences; hence, 4 types overall Each syllogism has three terms in the premises. There are 4 possible arrangements of these three terms. The term arrangement in the conclusion is fixed: 4 sentence types for each of the 3 lines, and 4 arrangements: 4 3 4 = 256 syllogisms 5 / 23

How ambiguity impedes syllogistic reasoning performance Only 24 of the 256 syllogisms are valid in Aristotelian logic. Previous studies observed error rates of up to > 80% in performing syllogistic reasoning. These studies suggest that the linguistic ambiguity of existential sentences, i.e. of (I) and (O) sentences, impedes the reasoning performance. Importantly, the ambiguity of existential sentences can affect the (in)validity of a syllogism differently. This has been observed before (Rips 1994), but we re investigating this systematically. 6 / 23

Syllogism classes (granularity level I) We can identify 6 classes, which we characterize in terms of how they are affected by SI computation. There are 2 invariant classes: [ v SI v]: Invalid syllogisms that are unaffected by SI computation - Invalid syllogisms without existential premises - Syllogisms that are invalid on all readings of their existential premises [+v SI +v]: Valid syllogisms that are unaffected by SI computation - Valid syllogisms with an (A) or (E) conclusion 7 / 23

Syllogism classes (granularity level I) There are 4 variant classes: [ v SI +v]: Invalid syllogisms that are validated by SI computation - Invalid syllogisms with an existential premise (a necessary but not sufficient condition) [+v SI v]: Valid syllogisms that are invalidated by SI computation - Valid syllogisms with an existential conclusion [ v SI ±v]: Invalid syllogisms that are validated by the SI of a premise but only if the SI of the conclusion is not computed - Invalid syllogisms with an existential premise and an existential conclusion [+v SI ±v]: Valid syllogisms that are invalidated by the SI of the conclusion but only if the SI of a premise is not computed - Valid syllogisms with an existential premise and an existential conclusion 8 / 23

An example: how to identify class [ v SI +v] (A) and (E) conclusions can be only be validated by (A) and (E) premises. Thus, class [ v SI +v] can only contain syllogisms with (I) or (O) conclusions. However, the SI of the (I) or (O) conclusion must also be validated by the premises and their SIs, or else we end up in class [ v SI ±v]. This means we need to find a pair of valid syllogisms that differ only in that one contains (I) sentences in places where the other contains (O) sentences. Luckily, Aristotelian logic gives us such a pair (but only one such pair): IA3I and OA3O. This means that class [ v SI +v] has the following two members (and only these two members): IA3O and OA3I. Eventually, we wrote a theorem prover for Aristotelian logic to free us from such brain gymnastics. 9 / 23

Testing syllogistic reasoning performance We conducted an experiment with 120 participants over AMT. We restricted attention to 5 of the 6 classes. Each participant: 100 binary acceptability judgments for 20 tokens of each of 5 syllogism classes determined by the occurrence of existential sentences in premises and conclusion. Here are the mean acceptance rates of each class: Class % acc. [ v v] 19.0 [ v ±v] 56.4 ]? [ v +v] 64.6 [+v v] 60.7 [+v +v] 76.3 Some of these results are easily interpretable: e.g., syllogisms in [+v SI +v] are accepted more often than those in [ v SI v]. But what to make of the observation that e.g. syllogisms in [ v SI +v] are accepted more often than those in [ v SI ±v]? 10 / 23

Hypothesis and prediction There here are three groups of reasoners: Premise Strengtheners Conclusion Logicians weak (There are... ) Validators strong (Only some... ) strong weak weak strong validates an invalid argument invalidates a valid argument We expect to observe three different behavioral patterns: Syllogism class Logicians Validators Strengtheners [ v v] invariant [ v ±v] [ v +v] affected by [+v v] ambiguity [+v ±v] [+v +v] invariant 11 / 23

Results Now let s take another look at the mean acceptance rates: Class L V S % acc. [ v v] 19.0 [ v ±v] 56.4 [ v +v] 64.6 [+v v] 60.7 [+v +v] 76.3 ] ] ] ] ] Green links highlight the observations that we correctly predict. E.g., the acceptance rate of [ v SI +v] is higher than that of [ v SI ±v] because of the population of strengtheners. However, there s also a red link, where we fail: Because of the logicians, we expect syllogisms in [ v SI ±v] to be accepted less often than syllogisms in [+v SI v]; however, the difference doesn t reach significance. 12 / 23

Towards a more fine-grained classification No significant difference between [ v SI ±v] and [+v SI v] Reason: there s a lot of variation accross the syllogisms in [+v SI v]. For example: AI3I, IA4I: accepted 80% of all times AE4O, EA2O: only accepted 50% of all times Where does this variation come from? AI3I, IA4I: the SI of the conclusion invalidates the syllogism. AE4O, EA2O: the SI is inconsistent with the premises. Hypothesis: Inconsistency leads to better recognition of invalidity. To test this hypothesis, our classification needs to take inconsistency into account. 13 / 23

A more fine-grained classification Taking inconsistency into account leads to the following subclassifications: Subclass [+v SI c] of [+v SI v] Class % acc. our data % acc. Rips (1994) [+v v] 71.3% 65% [+v c] 51.9% 57% Subclass [ v SI c] of [ v SI v] Subclass [ c] of [ v SI v]: Syllogisms that are formed from sets of inconsistent sentences (counterparts of valid syllogisms, where the valid conclusion is replaced by the contradictory sentence). Class % acc. Rips (1994) [ v v] 10.3% [ v c] 1.5% [ c] 1% 14 / 23

Do the means reflect subpopulations? We expect that taking (SI induced) inconsistency into account will give us all the predicted differences between means. Let s assume that we ll indeed get the following result: Class L V S % acc. [ v v] m 1 ] [ v ±v] m 2 ] [ v +v] m 3 ] [+v v] m 4 ] ] [+v +v] m 5 How can we show that the means reflect homogeneous behavior within different groups and not heterogeneous behaviour of all subjects? Recall that every subject judged (will judge) 20 instances of each of the 5 syllogisms classes. This means that for every subject we have a rich behavioral profile so that we can detect (in)consistent behavior. 15 / 23

Do the means reflect subpopulations? To identify subpopulations, we used a density-based clustering algorithm: DBSCAN. We ll show you what DBSCAN gives us for the data of our AMT experiment. One thing you ll see is that the data is very noisy. In the AMT experiment, the reaction times show that most subjects started to give very quick responses after a while. To prevent this, we ll conduct our next experiment in the lab. However, even through the noise we can see that one of our hypothesized groups seems not to exist. 16 / 23

Identifying groups of reasoners The behavior towards the 2 invariant classes gives a measure of a subject s logical abilities. The behavior towards the 3 variant classes is represented by the deviance from the subject s logical abilities. 17 / 23

The results: two populations We eliminated subjects with > 12.5% error rate in the invariant classes (half of all subjects). Two density clusters: red and green; outliers are black Members of the green cluster are in the neighborhood of the logicians corner. A large group of members of the red cluster is in the neighborhood of the validators corner. The strengtheners corner is not populated. 18 / 23

The results: no systematic strengthening of conclusions Left of the diagonal: subjects that strengthen conclusions sometimes But: no systematic strengthening of conclusions; i.e. no strengtheners No evidence for other populations 19 / 23

Conclusions What we did: (i) We developed a quantitative method to study tendencies across syllogism types. (ii) We showed evidence for the existence of groups of reasoners. (iii) We identified a supra-sentential context in which some subjects systematically do not compute SIs. Overall, we observe behavior which is grounded in logical reasoning and natural language interpretation. We found initial evidence for two groups of reasoners: subjects who consistently employ Aristotelian logic and don t compute SIs (logicians) subjects who consistently employ Aristotelian logic and maximize derivable inferences by computing SIs for premises but not for conclusions (validators). 20 / 23

Appendix: How to explain the behavior of validators? In 27% of all (A) to (I) trials, (I) is interpreted as (I s ). In 94% of all (I) to (O) trials, (I) is interpreted as (I s ). We saw evidence that there are validators. Let s assume that the difference above is due to this group of reasoners: they don t compute the SI of the (I) conclusion. How can we explain this behavior? We ll discuss a linguistically interesting hypothesis, and why it cannot be maintained for syllogistic reasoning. 21 / 23

Appendix: A hypothesis regarding the behavior of validators SIs serve to eliminate speaker ignorance inferences (Fox 2007). Validators take the premise(s) and conclusion of an argument as utterances of one and the same speaker. Here is how the first assumption leads to (I) to (O) inferences: (I w ) Some Ms are Ks All Ms are Ks is a relevant alternative and not settled by (I w ) The speaker is ignorant about All Ms are Ks (by quantity) (SI) All Ms are Ks (from (I w ) to eliminate the ignorance inf.) (O s ) Some Ms are not Ks (by (I w ) and (SI)) Together, the two assumptions inhibit (A) to (I) inferences: (A) All Ms are Ks (I w ) Some Ms are Ks (by the Aristotelian meaning of (A)) All Ms are Ks is a relevant alternative of (I w ) All Ms are Ks is entailed, hence settled by (A) No ignorance inference from (I w ) by quantity reasoning No motivation to compute a SI for (I w ) 22 / 23

Appendix: A hypothesis regarding the behavior of validators Unfortunately, this account is not supported by the syllogism data that we have: Class % acc. our data % acc. Rips (1994) [+v v] 71.3% 65% [+v c] 51.9% 57% Being a member of [+v c] means that the premises entail the contradiction of the SI of the conclusion. Thus, the premises settle the stronger alternative to the conclusion. Given our assumptions, this means that there is no motivation for validators to compute the SI in the first place. Thus, our assumptions lead us to expect that syllogisms in [+v c] are accepted more often than syllogisms in [+v v], contrary to fact. 23 / 23