SlideShare une entreprise Scribd logo
1  sur  18
Télécharger pour lire hors ligne
Submission by Sruzan Lolla (19128410)
Suppression Task
Byrne’s Interpretation
How closed world reasoning explains suppression
CGS 651A - Logic and Cognitive Science
Definitions
• Credulous: Accommodating the truth of all the speaker’s utterances 

• Non-monotonicity: Addition of new information alters previously assigned conclusion

• Closed-World Reasoning(CWR): A formal logic system which allows non-monotonicity

Sample if-then statement: If I turn the switch on and nothing abnormal happens then, the light will turn on.

• Abnormality: All possible hinderances in the form of a proposition variable

E.g.: power cut, non functioning light, non functioning switch, dream, etc.

• Completion: In CWR, disjunction of known premisses will hold necessarily true due to an
assumption that no other premise is playing a role. We simply ignore whatever is unknown.

If A then B will convert to if and only if A then B
Definitions
p → q
p is given Modus Ponens (MP) 

¬p is given Denial of the Antecedent(DA) | Fallacy

q is given Affirmation of the Consequent (AC) | Fallacy

¬q is given Modus Tollens (MT)
4 Versions of argument
Task Statements
Conditional 1: If she has an essay to write she will study late in the library. 

Conditional 2: She has an essay to write.

Additional: If she has a textbook to read, she will study late in the library. (Optional 1)
Alternate: If the library is open, she will study late in the library. (Optional 2)
Conclusion: She will study late in the library.
Premisses and Conclusion - Modus Ponens
Task Results
Argument 2 Conditional Additional Alternative
MP 90 64 94
DA 49 49 22
AC 53 55 16
MT 69 44 69
Byrne’s Interpretation
Mental Models Theory
‘Mental models theory’ says that Human Reasoning doesn’t follow any sort of formal logic
system. Byrne further claims that the content of the optional premise is responsible for
interpretation by the participant based on their domain-specific knowledge. She doesn’t
offer any explanation for participant’s formulation out of discourse material.

• {p → q ; r → q}

• {p ∨ r → q} or {p ∧ r → q} (Connection is more or less given)

• Absence of Truth value of ‘r’ will suppress conjunction.
Criticism
The authors question the accuracy of Byrne’s explanation. They claim that logical forms are
the outcome of a rather laborious interpretive process and it thus becomes the task of the
process to explain the assignment of relation.
ResultMaterial
And Correction
Interpretive Process
(CWR)
CWR in Suppression Task
Conditional 1 : If she has an essay to write she will study late in the library. 

Enriched Conditional ( p ∧ ¬ab → q )

Additional: If the library is open, she will study late in the library.

Enriched Conditional ( r ∧ ¬ab' → q )

Alternate: If she has a textbook to read, she will study late in the library.

Enriched Conditional ( r ∧ ¬ab' → q )

Absence of Abnormality: (ab ⊥) or ¬ab.
Logical formulation of statements
The Forward Inferences
MP and DA
MP & DA for 2 Conditional Premises
{ p , ( p ∧ ¬ab → q ), ⊥ → ab }

Upon completion, 

{ p , (p ∧ ¬ab q) , ⊥ ab}

{ p , (p ∧ ⊤ q)}

{ p , (p q)}

{ p , (p q)} Given p, q is concluded. (MP)

{ ¬p , (p q)} Given ¬p, ¬q is concluded. (DA)
MP & DA for an Additional Premise
In real context, the library not being open is potential abnormality for visiting there. Similarly, the other
variant relation of not having a purpose to visit although it being open is another abnormality. Thus, we add
2 relational conditionals ¬p → ab’, ¬r → ab.

{ p , ( p ∧ ¬ab → q ), ( r ∧ ¬ab' → q ) , ⊥ → ab, ⊥ → ab', ¬p → ab’, ¬r → ab}

After grouping, { p , ( ( p ∧ ¬ab ) ∨ ( r ∧ ¬ab’) → q ) , ( ⊥ ∨ ¬r → ab ), ( ⊥ ∨ ¬p → ab’ ) }

Upon completion, { p , ( ( p ∧ ¬ab ) ∨ ( r ∧ ¬ab’) q ) , ( ⊥ ∨ ¬r ab ), ( ⊥ ∨ ¬p ab’ ) }

{ p , ( ( p ∧ ¬ab ) ∨ ( r ∧ ¬ab’) q ) , ( ¬r ab ), ( ¬p ab’ ) }

{ p , ( p ∧ r ) ∨ ( r ∧ p) q ) }

{ p , ( p ∧ r ) q ) }
Premise: If the library is open, she will study late in the library.
MP & DA for an Additional Premise
{ p , ( p ∧ r ) q ) } (MP)

From the reduced logical form, we can not conclude anything about q as the truth value of r is not available
to us. Thus, suppression of a valid argument (Modus Ponens) is expected. 

{ ¬p , ( p ∧ r ) q ) } (DA)

Given¬p, ¬q can be concluded as either of the proposition’s False truth value is sufficient to conclude
about conjunction.

Premise: If the library is open, she will study late in the library.
MP & DA for an Alternate Premise
For alternate premise, we do not add relational conditionals. According to our context, not having a
textbook may not hinder the purpose of going to library for writing an essay. Also, not having a task of
writing an essay has nothing to do with the sole purpose of visiting a library for reading a textbook. 

{ p , ( p ∧ ¬ab → q ), ( r ∧ ¬ab' → q ) , ⊥ → ab, ⊥ → ab’}

After grouping, { p , ( ( p ∧ ¬ab) ∨ ( r ∧ ¬ab’) → q ) , ⊥ → ab, ⊥ → ab’}

Upon completion, 

{ p , ( ( p ∧ ¬ab) ∨ ( r ∧ ¬ab’) q ) , ⊥ ab, ⊥ ab’}

{ p , ( ( p ∧ ⊤) ∨ ( r ∧ ⊤) q )}

{ p , ( p ∨ r q )}
Premise: If she has a textbook to read, she will study late in the library.
MP & DA for an Alternate Premise
{ p , ( p ∨ r q )} (MP)

Given p, q can be concluded. 

{ ¬p , ( p ∨ r ) q ) } (DA)

Truth value of q can not be concluded as r can alter the conclusion. Thus, suppression is expected.

Premise: If she has a textbook to read, she will study late in the library.
The Backward Inferences
AC and MT
AC & MT for 2 Conditional Premises
{ q , (p q)} Given q, p is concluded. (AC)



{ ¬q , (p q)} Given ¬q, ¬p is concluded. (MT)
AC & MT for an Additional Premise
Premise: If the library is open, she will study late in the library.
{ q , ( p ∨ r q )} (AC)

Given q, p is certain as p ∨ r holds true.

{ ¬q , ( p ∨ r ) q ) } (MT)

Given ¬q, truth value of p can not be concluded as either of p, r (or both) could be responsible for False
truth value of p ∨ r. Thus, Suppression is expected.
AC & MT for an Alternate Premise
{ q , ( p ∨ r q )} (AC)

Given q, the truth value of p can not be concluded as either of p, r (or both) could be responsible for p ∨ r
being true. Thus, Suppression is expected.

{ ¬q , ( p ∨ r ) q ) } (MT)

Given ¬q, not ¬(p ∨ r) follows which leads to ¬p and ¬r. Thus, ¬p can be concluded.
Premise: If she has a textbook to read, she will study late in the library.

Contenu connexe

Tendances

Logic (slides)
Logic (slides)Logic (slides)
Logic (slides)IIUM
 
CMSC 56 | Lecture 2: Propositional Equivalences
CMSC 56 | Lecture 2: Propositional EquivalencesCMSC 56 | Lecture 2: Propositional Equivalences
CMSC 56 | Lecture 2: Propositional Equivalencesallyn joy calcaben
 
Indexing Text with Approximate q-grams
Indexing Text with Approximate q-gramsIndexing Text with Approximate q-grams
Indexing Text with Approximate q-gramsYasmine Long
 
Discrete Structures lecture 2
 Discrete Structures lecture 2 Discrete Structures lecture 2
Discrete Structures lecture 2Ali Usman
 
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكروDiscrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكروDr. Khaled Bakro
 
Algebraic geometry and commutative algebra
Algebraic geometry and commutative algebraAlgebraic geometry and commutative algebra
Algebraic geometry and commutative algebraSpringer
 
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...Robert Rand
 
Discrete Structures. Lecture 1
 Discrete Structures. Lecture 1  Discrete Structures. Lecture 1
Discrete Structures. Lecture 1 Ali Usman
 
Local Closed World Semantics - DL 2011 Poster
Local Closed World Semantics - DL 2011 PosterLocal Closed World Semantics - DL 2011 Poster
Local Closed World Semantics - DL 2011 PosterAdila Krisnadhi
 
Mathematical foundations of computer science
Mathematical foundations of computer scienceMathematical foundations of computer science
Mathematical foundations of computer scienceBindhuBhargaviTalasi
 
Сергей Кольцов —НИУ ВШЭ —ICBDA 2015
Сергей Кольцов —НИУ ВШЭ —ICBDA 2015Сергей Кольцов —НИУ ВШЭ —ICBDA 2015
Сергей Кольцов —НИУ ВШЭ —ICBDA 2015rusbase
 
Brute force searching, the typical set and guesswork
Brute force searching, the typical set and guessworkBrute force searching, the typical set and guesswork
Brute force searching, the typical set and guessworkLisandro Mierez
 

Tendances (18)

True but Unprovable
True but UnprovableTrue but Unprovable
True but Unprovable
 
Logic (slides)
Logic (slides)Logic (slides)
Logic (slides)
 
CMSC 56 | Lecture 2: Propositional Equivalences
CMSC 56 | Lecture 2: Propositional EquivalencesCMSC 56 | Lecture 2: Propositional Equivalences
CMSC 56 | Lecture 2: Propositional Equivalences
 
Mathematical Logic
Mathematical LogicMathematical Logic
Mathematical Logic
 
Indexing Text with Approximate q-grams
Indexing Text with Approximate q-gramsIndexing Text with Approximate q-grams
Indexing Text with Approximate q-grams
 
Discrete Structures lecture 2
 Discrete Structures lecture 2 Discrete Structures lecture 2
Discrete Structures lecture 2
 
Truth table
Truth tableTruth table
Truth table
 
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكروDiscrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
Discrete mathematics Ch2 Propositional Logic_Dr.khaled.Bakro د. خالد بكرو
 
Algebraic geometry and commutative algebra
Algebraic geometry and commutative algebraAlgebraic geometry and commutative algebra
Algebraic geometry and commutative algebra
 
Propositional logic
Propositional logicPropositional logic
Propositional logic
 
Pnp
PnpPnp
Pnp
 
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation...
 
Discrete Structures. Lecture 1
 Discrete Structures. Lecture 1  Discrete Structures. Lecture 1
Discrete Structures. Lecture 1
 
Local Closed World Semantics - DL 2011 Poster
Local Closed World Semantics - DL 2011 PosterLocal Closed World Semantics - DL 2011 Poster
Local Closed World Semantics - DL 2011 Poster
 
Mathematical foundations of computer science
Mathematical foundations of computer scienceMathematical foundations of computer science
Mathematical foundations of computer science
 
Discrete mathematics
Discrete mathematicsDiscrete mathematics
Discrete mathematics
 
Сергей Кольцов —НИУ ВШЭ —ICBDA 2015
Сергей Кольцов —НИУ ВШЭ —ICBDA 2015Сергей Кольцов —НИУ ВШЭ —ICBDA 2015
Сергей Кольцов —НИУ ВШЭ —ICBDA 2015
 
Brute force searching, the typical set and guesswork
Brute force searching, the typical set and guessworkBrute force searching, the typical set and guesswork
Brute force searching, the typical set and guesswork
 

Similaire à Suppression task

CSE-203 Lec_1.pptx
CSE-203 Lec_1.pptxCSE-203 Lec_1.pptx
CSE-203 Lec_1.pptxMahdiHasan86
 
Chapter 01 - p1.pdf
Chapter 01 - p1.pdfChapter 01 - p1.pdf
Chapter 01 - p1.pdfsmarwaneid
 
Basic Connectives and Truth Tables.ppt
Basic Connectives and Truth Tables.pptBasic Connectives and Truth Tables.ppt
Basic Connectives and Truth Tables.pptsamalaramesh4
 
Logic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptxLogic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptxPriyalMayurManvar
 
Arguments and methods of proof
Arguments and methods of proofArguments and methods of proof
Arguments and methods of proofRobert Geofroy
 
[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf
[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf
[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdfrAjyarAjanItjJa
 
Drinkfromme.pptx
Drinkfromme.pptxDrinkfromme.pptx
Drinkfromme.pptxRavind8
 
Discrete Structures
Discrete Structures Discrete Structures
Discrete Structures AQCreations
 
Discrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and ProofsDiscrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and ProofsWongyos Keardsri
 
20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx
20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx
20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptxssuser92109d
 
Discrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete MathematicsDiscrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete MathematicsAbdulRehman378540
 
Valid & invalid arguments
Valid & invalid argumentsValid & invalid arguments
Valid & invalid argumentsAbdur Rehman
 
UNIT-III-PPT.pptx
UNIT-III-PPT.pptxUNIT-III-PPT.pptx
UNIT-III-PPT.pptxDakshBaveja
 
Valid and Invalid Arguments.pptx
Valid and Invalid Arguments.pptxValid and Invalid Arguments.pptx
Valid and Invalid Arguments.pptxLuisSalenga1
 

Similaire à Suppression task (20)

DS Lecture 2.ppt
DS Lecture 2.pptDS Lecture 2.ppt
DS Lecture 2.ppt
 
CSE-203 Lec_1.pptx
CSE-203 Lec_1.pptxCSE-203 Lec_1.pptx
CSE-203 Lec_1.pptx
 
Chapter1p1
Chapter1p1Chapter1p1
Chapter1p1
 
Chap05
Chap05Chap05
Chap05
 
Chapter 01 - p1.pdf
Chapter 01 - p1.pdfChapter 01 - p1.pdf
Chapter 01 - p1.pdf
 
Basic Connectives and Truth Tables.ppt
Basic Connectives and Truth Tables.pptBasic Connectives and Truth Tables.ppt
Basic Connectives and Truth Tables.ppt
 
Logic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptxLogic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptx
 
Chapter1p1.pdf
Chapter1p1.pdfChapter1p1.pdf
Chapter1p1.pdf
 
Arguments and methods of proof
Arguments and methods of proofArguments and methods of proof
Arguments and methods of proof
 
[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf
[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf
[gaNita] 2. Propositional Equivalences [math.fsu.edu].pdf
 
Drinkfromme.pptx
Drinkfromme.pptxDrinkfromme.pptx
Drinkfromme.pptx
 
Discrete Structures
Discrete Structures Discrete Structures
Discrete Structures
 
Discrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and ProofsDiscrete-Chapter 05 Inference and Proofs
Discrete-Chapter 05 Inference and Proofs
 
20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx
20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx
20220818151924_PPT01 - The Logic of Compound and Quantitative Statement.pptx
 
Discrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete MathematicsDiscrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete Mathematics
 
Lecture5
Lecture5Lecture5
Lecture5
 
DMS UNIT-1 ppt.pptx
DMS UNIT-1 ppt.pptxDMS UNIT-1 ppt.pptx
DMS UNIT-1 ppt.pptx
 
Valid & invalid arguments
Valid & invalid argumentsValid & invalid arguments
Valid & invalid arguments
 
UNIT-III-PPT.pptx
UNIT-III-PPT.pptxUNIT-III-PPT.pptx
UNIT-III-PPT.pptx
 
Valid and Invalid Arguments.pptx
Valid and Invalid Arguments.pptxValid and Invalid Arguments.pptx
Valid and Invalid Arguments.pptx
 

Plus de Sruzan Lolla

Branding of Assam State Zoo 2
Branding of Assam State Zoo 2Branding of Assam State Zoo 2
Branding of Assam State Zoo 2Sruzan Lolla
 
Capability Approach - Sustainability
Capability Approach - SustainabilityCapability Approach - Sustainability
Capability Approach - SustainabilitySruzan Lolla
 
SCOOTDENT - CAMPUS SCOOTER
SCOOTDENT - CAMPUS SCOOTERSCOOTDENT - CAMPUS SCOOTER
SCOOTDENT - CAMPUS SCOOTERSruzan Lolla
 

Plus de Sruzan Lolla (7)

Branding of Assam State Zoo 2
Branding of Assam State Zoo 2Branding of Assam State Zoo 2
Branding of Assam State Zoo 2
 
Capability Approach - Sustainability
Capability Approach - SustainabilityCapability Approach - Sustainability
Capability Approach - Sustainability
 
Design Analysis
Design AnalysisDesign Analysis
Design Analysis
 
First Passenger
First PassengerFirst Passenger
First Passenger
 
SCOOTDENT - CAMPUS SCOOTER
SCOOTDENT - CAMPUS SCOOTERSCOOTDENT - CAMPUS SCOOTER
SCOOTDENT - CAMPUS SCOOTER
 
hexkey redesign
hexkey redesignhexkey redesign
hexkey redesign
 
CONSTRUCTIVISM
CONSTRUCTIVISMCONSTRUCTIVISM
CONSTRUCTIVISM
 

Dernier

CHROMATOGRAPHY PALLAVI RAWAT.pptx
CHROMATOGRAPHY  PALLAVI RAWAT.pptxCHROMATOGRAPHY  PALLAVI RAWAT.pptx
CHROMATOGRAPHY PALLAVI RAWAT.pptxpallavirawat456
 
Ai in communication electronicss[1].pptx
Ai in communication electronicss[1].pptxAi in communication electronicss[1].pptx
Ai in communication electronicss[1].pptxsubscribeus100
 
Pests of jatropha_Bionomics_identification_Dr.UPR.pdf
Pests of jatropha_Bionomics_identification_Dr.UPR.pdfPests of jatropha_Bionomics_identification_Dr.UPR.pdf
Pests of jatropha_Bionomics_identification_Dr.UPR.pdfPirithiRaju
 
Dubai Calls Girl Lisa O525547819 Lexi Call Girls In Dubai
Dubai Calls Girl Lisa O525547819 Lexi Call Girls In DubaiDubai Calls Girl Lisa O525547819 Lexi Call Girls In Dubai
Dubai Calls Girl Lisa O525547819 Lexi Call Girls In Dubaikojalkojal131
 
Thermodynamics ,types of system,formulae ,gibbs free energy .pptx
Thermodynamics ,types of system,formulae ,gibbs free energy .pptxThermodynamics ,types of system,formulae ,gibbs free energy .pptx
Thermodynamics ,types of system,formulae ,gibbs free energy .pptxuniversity
 
The dark energy paradox leads to a new structure of spacetime.pptx
The dark energy paradox leads to a new structure of spacetime.pptxThe dark energy paradox leads to a new structure of spacetime.pptx
The dark energy paradox leads to a new structure of spacetime.pptxEran Akiva Sinbar
 
ECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptx
ECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptxECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptx
ECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptxmaryFF1
 
trihybrid cross , test cross chi squares
trihybrid cross , test cross chi squarestrihybrid cross , test cross chi squares
trihybrid cross , test cross chi squaresusmanzain586
 
Environmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial BiosensorEnvironmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial Biosensorsonawaneprad
 
Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024AyushiRastogi48
 
Observational constraints on mergers creating magnetism in massive stars
Observational constraints on mergers creating magnetism in massive starsObservational constraints on mergers creating magnetism in massive stars
Observational constraints on mergers creating magnetism in massive starsSérgio Sacani
 
Citronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyayCitronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyayupadhyaymani499
 
Microteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical EngineeringMicroteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical EngineeringPrajakta Shinde
 
Pests of soyabean_Binomics_IdentificationDr.UPR.pdf
Pests of soyabean_Binomics_IdentificationDr.UPR.pdfPests of soyabean_Binomics_IdentificationDr.UPR.pdf
Pests of soyabean_Binomics_IdentificationDr.UPR.pdfPirithiRaju
 
User Guide: Capricorn FLX™ Weather Station
User Guide: Capricorn FLX™ Weather StationUser Guide: Capricorn FLX™ Weather Station
User Guide: Capricorn FLX™ Weather StationColumbia Weather Systems
 
《Queensland毕业文凭-昆士兰大学毕业证成绩单》
《Queensland毕业文凭-昆士兰大学毕业证成绩单》《Queensland毕业文凭-昆士兰大学毕业证成绩单》
《Queensland毕业文凭-昆士兰大学毕业证成绩单》rnrncn29
 
Organic farming with special reference to vermiculture
Organic farming with special reference to vermicultureOrganic farming with special reference to vermiculture
Organic farming with special reference to vermicultureTakeleZike1
 
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...Universidade Federal de Sergipe - UFS
 
Speech, hearing, noise, intelligibility.pptx
Speech, hearing, noise, intelligibility.pptxSpeech, hearing, noise, intelligibility.pptx
Speech, hearing, noise, intelligibility.pptxpriyankatabhane
 

Dernier (20)

CHROMATOGRAPHY PALLAVI RAWAT.pptx
CHROMATOGRAPHY  PALLAVI RAWAT.pptxCHROMATOGRAPHY  PALLAVI RAWAT.pptx
CHROMATOGRAPHY PALLAVI RAWAT.pptx
 
Ai in communication electronicss[1].pptx
Ai in communication electronicss[1].pptxAi in communication electronicss[1].pptx
Ai in communication electronicss[1].pptx
 
Pests of jatropha_Bionomics_identification_Dr.UPR.pdf
Pests of jatropha_Bionomics_identification_Dr.UPR.pdfPests of jatropha_Bionomics_identification_Dr.UPR.pdf
Pests of jatropha_Bionomics_identification_Dr.UPR.pdf
 
Dubai Calls Girl Lisa O525547819 Lexi Call Girls In Dubai
Dubai Calls Girl Lisa O525547819 Lexi Call Girls In DubaiDubai Calls Girl Lisa O525547819 Lexi Call Girls In Dubai
Dubai Calls Girl Lisa O525547819 Lexi Call Girls In Dubai
 
Thermodynamics ,types of system,formulae ,gibbs free energy .pptx
Thermodynamics ,types of system,formulae ,gibbs free energy .pptxThermodynamics ,types of system,formulae ,gibbs free energy .pptx
Thermodynamics ,types of system,formulae ,gibbs free energy .pptx
 
The dark energy paradox leads to a new structure of spacetime.pptx
The dark energy paradox leads to a new structure of spacetime.pptxThe dark energy paradox leads to a new structure of spacetime.pptx
The dark energy paradox leads to a new structure of spacetime.pptx
 
ECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptx
ECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptxECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptx
ECG Graph Monitoring with AD8232 ECG Sensor & Arduino.pptx
 
trihybrid cross , test cross chi squares
trihybrid cross , test cross chi squarestrihybrid cross , test cross chi squares
trihybrid cross , test cross chi squares
 
Let’s Say Someone Did Drop the Bomb. Then What?
Let’s Say Someone Did Drop the Bomb. Then What?Let’s Say Someone Did Drop the Bomb. Then What?
Let’s Say Someone Did Drop the Bomb. Then What?
 
Environmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial BiosensorEnvironmental Biotechnology Topic:- Microbial Biosensor
Environmental Biotechnology Topic:- Microbial Biosensor
 
Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024Vision and reflection on Mining Software Repositories research in 2024
Vision and reflection on Mining Software Repositories research in 2024
 
Observational constraints on mergers creating magnetism in massive stars
Observational constraints on mergers creating magnetism in massive starsObservational constraints on mergers creating magnetism in massive stars
Observational constraints on mergers creating magnetism in massive stars
 
Citronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyayCitronella presentation SlideShare mani upadhyay
Citronella presentation SlideShare mani upadhyay
 
Microteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical EngineeringMicroteaching on terms used in filtration .Pharmaceutical Engineering
Microteaching on terms used in filtration .Pharmaceutical Engineering
 
Pests of soyabean_Binomics_IdentificationDr.UPR.pdf
Pests of soyabean_Binomics_IdentificationDr.UPR.pdfPests of soyabean_Binomics_IdentificationDr.UPR.pdf
Pests of soyabean_Binomics_IdentificationDr.UPR.pdf
 
User Guide: Capricorn FLX™ Weather Station
User Guide: Capricorn FLX™ Weather StationUser Guide: Capricorn FLX™ Weather Station
User Guide: Capricorn FLX™ Weather Station
 
《Queensland毕业文凭-昆士兰大学毕业证成绩单》
《Queensland毕业文凭-昆士兰大学毕业证成绩单》《Queensland毕业文凭-昆士兰大学毕业证成绩单》
《Queensland毕业文凭-昆士兰大学毕业证成绩单》
 
Organic farming with special reference to vermiculture
Organic farming with special reference to vermicultureOrganic farming with special reference to vermiculture
Organic farming with special reference to vermiculture
 
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
REVISTA DE BIOLOGIA E CIÊNCIAS DA TERRA ISSN 1519-5228 - Artigo_Bioterra_V24_...
 
Speech, hearing, noise, intelligibility.pptx
Speech, hearing, noise, intelligibility.pptxSpeech, hearing, noise, intelligibility.pptx
Speech, hearing, noise, intelligibility.pptx
 

Suppression task

  • 1. Submission by Sruzan Lolla (19128410) Suppression Task Byrne’s Interpretation How closed world reasoning explains suppression CGS 651A - Logic and Cognitive Science
  • 2. Definitions • Credulous: Accommodating the truth of all the speaker’s utterances • Non-monotonicity: Addition of new information alters previously assigned conclusion • Closed-World Reasoning(CWR): A formal logic system which allows non-monotonicity
 Sample if-then statement: If I turn the switch on and nothing abnormal happens then, the light will turn on. • Abnormality: All possible hinderances in the form of a proposition variable
 E.g.: power cut, non functioning light, non functioning switch, dream, etc. • Completion: In CWR, disjunction of known premisses will hold necessarily true due to an assumption that no other premise is playing a role. We simply ignore whatever is unknown.
 If A then B will convert to if and only if A then B
  • 3. Definitions p → q p is given Modus Ponens (MP) ¬p is given Denial of the Antecedent(DA) | Fallacy q is given Affirmation of the Consequent (AC) | Fallacy ¬q is given Modus Tollens (MT) 4 Versions of argument
  • 4. Task Statements Conditional 1: If she has an essay to write she will study late in the library. Conditional 2: She has an essay to write. Additional: If she has a textbook to read, she will study late in the library. (Optional 1) Alternate: If the library is open, she will study late in the library. (Optional 2) Conclusion: She will study late in the library. Premisses and Conclusion - Modus Ponens
  • 5. Task Results Argument 2 Conditional Additional Alternative MP 90 64 94 DA 49 49 22 AC 53 55 16 MT 69 44 69
  • 6. Byrne’s Interpretation Mental Models Theory ‘Mental models theory’ says that Human Reasoning doesn’t follow any sort of formal logic system. Byrne further claims that the content of the optional premise is responsible for interpretation by the participant based on their domain-specific knowledge. She doesn’t offer any explanation for participant’s formulation out of discourse material. • {p → q ; r → q} • {p ∨ r → q} or {p ∧ r → q} (Connection is more or less given) • Absence of Truth value of ‘r’ will suppress conjunction.
  • 7. Criticism The authors question the accuracy of Byrne’s explanation. They claim that logical forms are the outcome of a rather laborious interpretive process and it thus becomes the task of the process to explain the assignment of relation. ResultMaterial And Correction Interpretive Process (CWR)
  • 8. CWR in Suppression Task Conditional 1 : If she has an essay to write she will study late in the library. 
 Enriched Conditional ( p ∧ ¬ab → q ) Additional: If the library is open, she will study late in the library.
 Enriched Conditional ( r ∧ ¬ab' → q ) Alternate: If she has a textbook to read, she will study late in the library.
 Enriched Conditional ( r ∧ ¬ab' → q ) Absence of Abnormality: (ab ⊥) or ¬ab. Logical formulation of statements
  • 10. MP & DA for 2 Conditional Premises { p , ( p ∧ ¬ab → q ), ⊥ → ab }
 Upon completion, 
 { p , (p ∧ ¬ab q) , ⊥ ab}
 { p , (p ∧ ⊤ q)}
 { p , (p q)} { p , (p q)} Given p, q is concluded. (MP)
 { ¬p , (p q)} Given ¬p, ¬q is concluded. (DA)
  • 11. MP & DA for an Additional Premise In real context, the library not being open is potential abnormality for visiting there. Similarly, the other variant relation of not having a purpose to visit although it being open is another abnormality. Thus, we add 2 relational conditionals ¬p → ab’, ¬r → ab. { p , ( p ∧ ¬ab → q ), ( r ∧ ¬ab' → q ) , ⊥ → ab, ⊥ → ab', ¬p → ab’, ¬r → ab} After grouping, { p , ( ( p ∧ ¬ab ) ∨ ( r ∧ ¬ab’) → q ) , ( ⊥ ∨ ¬r → ab ), ( ⊥ ∨ ¬p → ab’ ) } Upon completion, { p , ( ( p ∧ ¬ab ) ∨ ( r ∧ ¬ab’) q ) , ( ⊥ ∨ ¬r ab ), ( ⊥ ∨ ¬p ab’ ) }
 { p , ( ( p ∧ ¬ab ) ∨ ( r ∧ ¬ab’) q ) , ( ¬r ab ), ( ¬p ab’ ) }
 { p , ( p ∧ r ) ∨ ( r ∧ p) q ) }
 { p , ( p ∧ r ) q ) } Premise: If the library is open, she will study late in the library.
  • 12. MP & DA for an Additional Premise { p , ( p ∧ r ) q ) } (MP)
 From the reduced logical form, we can not conclude anything about q as the truth value of r is not available to us. Thus, suppression of a valid argument (Modus Ponens) is expected. { ¬p , ( p ∧ r ) q ) } (DA)
 Given¬p, ¬q can be concluded as either of the proposition’s False truth value is sufficient to conclude about conjunction. Premise: If the library is open, she will study late in the library.
  • 13. MP & DA for an Alternate Premise For alternate premise, we do not add relational conditionals. According to our context, not having a textbook may not hinder the purpose of going to library for writing an essay. Also, not having a task of writing an essay has nothing to do with the sole purpose of visiting a library for reading a textbook. { p , ( p ∧ ¬ab → q ), ( r ∧ ¬ab' → q ) , ⊥ → ab, ⊥ → ab’} After grouping, { p , ( ( p ∧ ¬ab) ∨ ( r ∧ ¬ab’) → q ) , ⊥ → ab, ⊥ → ab’} Upon completion, 
 { p , ( ( p ∧ ¬ab) ∨ ( r ∧ ¬ab’) q ) , ⊥ ab, ⊥ ab’}
 { p , ( ( p ∧ ⊤) ∨ ( r ∧ ⊤) q )}
 { p , ( p ∨ r q )} Premise: If she has a textbook to read, she will study late in the library.
  • 14. MP & DA for an Alternate Premise { p , ( p ∨ r q )} (MP)
 Given p, q can be concluded. { ¬p , ( p ∨ r ) q ) } (DA)
 Truth value of q can not be concluded as r can alter the conclusion. Thus, suppression is expected. Premise: If she has a textbook to read, she will study late in the library.
  • 16. AC & MT for 2 Conditional Premises { q , (p q)} Given q, p is concluded. (AC) 
 { ¬q , (p q)} Given ¬q, ¬p is concluded. (MT)
  • 17. AC & MT for an Additional Premise Premise: If the library is open, she will study late in the library. { q , ( p ∨ r q )} (AC)
 Given q, p is certain as p ∨ r holds true. { ¬q , ( p ∨ r ) q ) } (MT)
 Given ¬q, truth value of p can not be concluded as either of p, r (or both) could be responsible for False truth value of p ∨ r. Thus, Suppression is expected.
  • 18. AC & MT for an Alternate Premise { q , ( p ∨ r q )} (AC)
 Given q, the truth value of p can not be concluded as either of p, r (or both) could be responsible for p ∨ r being true. Thus, Suppression is expected. { ¬q , ( p ∨ r ) q ) } (MT)
 Given ¬q, not ¬(p ∨ r) follows which leads to ¬p and ¬r. Thus, ¬p can be concluded. Premise: If she has a textbook to read, she will study late in the library.