A D EFENSE OF T EMPERATE E PISTEMIC T RANSPARENCY ELEONORA CRESTO CONICET (Argentina) University of Konstanz – July 2011.

Slides:



Advertisements
Similar presentations
Knowledge as JTB Someone S has knowledge of P IFF: 1. S believes P 2. S is justified in believing P 3. P is true.
Advertisements

Constructing the World Week 5 David Chalmers. The Case for A Priori Scrutability (1) Apriority (2) Argument 1: Suspension of Judgment (3) Argument 2:
Moral Relativism and Conceptual Analysis David J. Chalmers.
The Fregean Content of Perception. Varieties of Representationalism Representationalism: Phenomenal property = representing content C in manner M Pure.
Hyperintensionality and Impossible Worlds: An Introduction
Tests of Hypotheses Based on a Single Sample
Theories of Knowledge Knowledge is Justified-True-Belief Person, S, knows a proposition, y, iff: Y is true; S believes y; Y is justified for S. (Note:
Introduction to Proofs
From Anti-Scepticism to the Contingent A Priori Brian Weatherson Cornell University.
Possible World Semantics for Modal Logic
Tarski’s T-scheme: S is true iff s. To be substituted with a sentence To be substituted with a name of the same sentence Tarski: A necessary condition.
The Liar and Dialetheism The Liar, the Strengthened Liar Dialetheism: Motivations and Problems Keith Allen Office Hour: Weds (D/140)
Hume’s Problem of Induction 2 Seminar 2: Philosophy of the Sciences Wednesday, 14 September
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Conceptualization and Measurement
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
Verificationism and religious language Michael Lacewing
James Hawthorne Workshop: Conditionals Counterfactuals and Causes In Uncertain Environments Düsseldorf 19/5/2011 – 22/5/
Copyright Dennis Patterson 2006 The Methodology Debate in Analytic Jurisprudence What is At Stake and What Comes Next Dennis Patterson Rutgers University.
1 OSCAR: An Architecture for Generally Intelligent Agents John L. Pollock Philosophy and Cognitive Science University of Arizona
Reasoning with testimony Argumentation vs. Explanatory Coherence Floris Bex - University of Groningen Henry Prakken - University of Groningen - Utrecht.
NaLIX: A Generic Natural Language Search Environment for XML Data Presented by: Erik Mathisen 02/12/2008.
Dutch books and epistemic events Jan-Willem Romeijn Psychological Methods University of Amsterdam ILLC 2005 Interfacing Probabilistic and Epistemic Update.
Formalizing Alpha: Soundness and Completeness Bram van Heuveln Dept. of Cognitive Science RPI.
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
Alpha: Symbolization and Inference Bram van Heuveln Minds and Machines Lab RPI.
Let remember from the previous lesson what is Knowledge representation
Logical Agents Chapter 7 Feb 26, Knowledge and Reasoning Knowledge of action outcome enables problem solving –a reflex agent can only find way from.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Chapter 5.
Belief Revision Lecture 1: AGM April 1, 2004 Gregory Wheeler
Effective Questioning in the classroom
Error theory Michael Lacewing
Romaric GUILLERM Hamid DEMMOU LAAS-CNRS Nabil SADOU SUPELEC/IETR.
Can Big Questions Be Begged?. Fallacies are mistakes in inference, BUT Begging the question is not a mistake in inference. Is it a fallacy at all? Robinson.
Mood and Modality Rajat Kumar Mohanty rkm[AT]cse[DOT]iitb[DOT]ac[DOT]in Centre for Indian Language Technology Department of Computer Science and Engineering.
Copyright © Cengage Learning. All rights reserved. 8 Tests of Hypotheses Based on a Single Sample.
Discrete Mathematics and Its Applications
Chapter 13 Science and Hypothesis.  Modern science has had a profound impact on our lives— mostly for the better.  The laws and principles of science.
The physical reductive explainability of phenomenal consciousness and the logical impossibility of zombies Marco Giunti University of Cagliari (Italy)
Between proof and truth Gabriel Sandu Univ. of Helsinki.
Today’s Quote Use soft words and hard arguments English Proverb.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Basics of Probability. A Bit Math A Probability Space is a triple, where  is the sample space: a non-empty set of possible outcomes; F is an algebra.
Software Engineering Saeed Akhtar The University of Lahore Lecture 8 Originally shared for: mashhoood.webs.com.
Pattern-directed inference systems
Infallible Justification Markus Lammenranta Humanistinen tiedekunta / Markus Lammenranta / Infallible Justification1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
Ethical non-naturalism
Lecture 2 (Chapter 2) Introduction to Semantics and Pragmatics.
CHAPTER SIX: TRUTH P H I L O S O P H Y A Text with Readings ELEVENTH EDITION M A N U E L V E L A S Q U E Z.
Feng Zhiyong Tianjin University Fall  An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that.
Transient Unterdetermination and the Miracle Argument Paul Hoyningen-Huene Leibniz Universität Hannover Center for Philosophy and Ethics of Science (ZEWW)
The Logic of Atomic Sentences Chapter 2 Language, Proof and Logic.
WHAT SKILLS AND UNDERSTANDINGS DO I NEED TO DEMONSTRATE? HOW CAN I MAKE SURE I HAVE PRODUCED A HIGH QUALITY RESPONSE? (OR TWO!) Literature : Close Passage.
1 Lecture 3 The Languages of K, T, B and S4. 2 Last time we extended the language PC to the language S5 by adding two new symbols ‘□’ (for ‘It is necessary.
ORBChapter 51 ORGANIZATIONAL BEHAVIOR Chapter 5 Perception & Individual Decision Making.
Decision Support Systems INF421 & IS Introduction To distinguish between normative theories, descriptive studies and prescriptive analysis; To.
Stages of Research and Development
Religious language: cognitive or non-cognitive?
Documentation of Assumptions and System Vulnerability Monitoring: the Case of System Theoretic Process Analysis (STPA) Dr. Nektarios Karanikas, CEng, PMP,
If You Aren’t Dong Arguments, You Aren’t Doing Evidence
Introduction to Logic PHIL 240 Sections
Henry Prakken COMMA 2016 Berlin-Potsdam September 15th, 2016
Chapter 14 Communicative Language Teaching
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

A D EFENSE OF T EMPERATE E PISTEMIC T RANSPARENCY ELEONORA CRESTO CONICET (Argentina) University of Konstanz – July 2011

EPISTEMIC TRANSPARENCY If S knows that p, S knows that she knows that p: KK Principle:Kp  KKp Knowledge reflexivity Positive introspection Self-knowledge Transparency Luminosity 2

GOAL A defense of a moderate version of KK 3

RISE AND FALL OF KK 1960 s: Dogma Then…. Externalism – e.g.: Reliabilism Williamson (2000) 4

STRATEGY (A) Why do we want transparency? (B) Indirect argument 5

WHY DO WE CARE ABOUT TRANSPARENCY? Ideal agents Ideally rational? 6

WHY DO WE CARE ABOUT TRANSPARENCY? Knowledge and responsibility How? 7

WHY DO WE CARE ABOUT TRANSPARENCY? Responsibility demands us to be in an appropriate reflective state. What reflective state? Epistemic responsibility entails “ratifiability”. 8

A MODAL FRAME F = K  = {w  W:  x  W (wRx  x   )} R(w) = {x  W: wRx} 9

WILLIAMSON: IMPROBABLE KNOWING P w (  ): the evidential probability of  in w. P w (  ) = P prior (  | R(w)) = P prior (   R(w)) / P prior (R(w)) P w (R(w)) = 1 [P(  ) = r] = def. {w  W: P w (  ) = r} 10

IMPROBABLE KNOWING “The KK principle is equivalent to the principle that if the evidential probability of p is 1, then the evidential probability that the evidential probability of p is 1 is itself 1” (Williamson, p. 8). We can build a model in which P w ([P(R(w))=1]) is as low as we want. 11

PROBLEMS  Why should we say that the evidential basis (in w) is always R(w)? 12

PROBLEMS Recall that: [P(  ) = r] = {w  W: P w (  ) = r} [P w (  ) = r] ? 13

PROPOSAL (FIRST VERSION) We’ll have a sequence of languages L 0, L 1, … L n ….with probability operators P 0, …P n … We’ll have a sequence of functions P 1 w … P n w … on sentences  i of language L i P i w : L i-1  ℝ 14

PROPOSAL (FIRST VERSION) Expressions of the form P prior (  ) or P i w (  ) do not belong to any language of the sequence L 0, L 1 …L n …. “ P i (  )=r” is true in w iff P i w (  )=r. 15

PROPOSAL (FIRST VERSION) How should we conditionalize? 16

PROPOSAL (FIRST VERSION) For P 1 w (  ), the relevant evidence is R(w). For P 2 w ( P 1 (  )=r), the relevant evidence is KR(w). 17

CONDITIONALIZATION (FIRST VERSION) C* rule: For i  1: P i w ( P i-1 (… P (  )=r...)) = P prior ( P i-1 (… P (  )=r…) | K i-1...KR(w)) where K i-1 is the same K-operator iterated i-1 times 18

DIFFICULTIES C* divorces probability 1 from knowledge. 19

A MODEL FOR MODERATE TRANSPARENCY (SECOND VERSION) M = New operators K 0 …K n …, in addition to P 0, …P n … We define a sequence of relations R 1 …R n which correspond to the different Ks. The Rs are nested: R i  R i-1...  R 1 R i is a reflexive relation over W, for all i, and transitive for i > 1. 20

A MODEL FOR MODERATE TRANSPARENCY Our conditionalization rule now incorporates operators K 1,… K n … defined on the basis of relations R 1,… R n … C** rule: For i  1: P i w ( P i-1 (… P (  )=r...)) = P prior ( P i-1 (… P (  )=r | K i-1...KR(w)) where “K i-1 …KR(w)” includes i-1 higher-order K- operators 21

A MODEL FOR MODERATE TRANSPARENCY Intended interpretation of the formalism: “K 2 p” does not make sense! A second-order evidential probability claim is the evidential probability of a probability statement. Mutatis mutandis for higher-order levels and for conditional evidential probabilities. 22

SOME CONSEQUENCES Why should we demand such requirements for the Rs? They are not ad hoc! Higher-order probability requires increasingly complex probabilistic claims. For second-order evidential probability in w:  We conditinalize over KR(w)  Thus the second-order probability of P 1 (R(w)) is 1  Thus the agent knows that KR(w)  K 2 KR(w) should be true in w 23

SOME CONSEQUENCES K   K 2 K  KK 2 Principle (if [K 2 KR(w)] is not empty, for any w)  (K   K 2 K  )KK  Principle (if [K 2 KR(w)] is not empty, for some w) K 2 K   K 3 K 2 K  KK + Principle 24

SOME CONSEQUENCES A restricted version of possitive introspection holds:  Quasi-transparency principles KK +, KK  and KK 2 result from conditionalizing over higher-order levels of evidence and from the attempt to adjust probability language and knowledge attribution in a progressively coherent way. 25

SOME CONSEQUENCES Links between lower- and higher-order probabilities: If P 1 w (  ) = r = 1 or 0, then P 2 w (P 1 (  )=r) = 1. If R 1 is an equivalence relation, P 2 w (P 1 (  )=r) is either 1 or 0. Suppose P 2 w (P(  )=r) = s. If 0  r  1 and R 1 is not transitive, then s need not be either 1 or 0. 26

ON THE PROBABILISTIC REFLECTION PRINCIPLE (PRP) PRP: P 2 w (  | P 1 (  )=r) = r (for w  W) Iterated PRP: P i w (  | P i-1 (  | P i-2 (  |…)….)=r) = r Is PRP a theoretical truth of M ? 27

ON PROBABILISTIC REFLECTION Necessary and sufficient condition for Iterated PRP R i is an equivalence relation and R i = R i-1 iff for all w  W and any   L 0 : if P i+1 w (-|-) exists, then P i+1 w (  | P i (  | P i-1 (  |…)….) = r) = r 28

RELATION TO OTHER WORK Paul Egré/ Jérôme Dokic Principal motivation: to deactivate Williamson’s soritic argument on inexact knowledge Perceptual vs. reflective knowledge (KK’) K    KK   Transparency failures do not generalize 29

RELATION TO OTHER WORK Differences 1. Egré/ Dokic do not offer a probabilistic framework. 2. They focus on reflection over perceptual knowledge, exclusively. 3. KK’ Principle is imposed “from the outside”.  The present model for quasi-transparency can be seen as a refinement and extension of some aspects of the system suggested by Egré - Dokic. 30

CONCLUSIONS Once we clarify some conceptual aspects of higher- order probabilities… …we obtain the vindication of a number of introspective principles, or principles of quasi- transparency. 31

CONCLUSIONS Quasi-transparency principles were not just assumed to hold, but they have been obtained as a result of implementing a number of natural constraints on the structure of the system.  Formally speaking, they behave quite differently from presuppositions of consistency or deductive closure. 32

CONCLUSIONS The framework vindicates the intuition that first- and second-order knowledge differ substantially: Different attitudes about ignorance Different attitudes toward “margin of error” principles Second-order knowledge is concerned with the “ratification” of first-order attitudes. 33

CONCLUSIONS Quasi-transparency fully vindicates the normative link between self-knowledge and responsibility.  K + Kp: “responsible knowledge” of p. 34

CONCLUSIONS  Second-order knowledge, as a state of epistemic responsibility, is a desideratum we have qua agents. 35

Thank you! 36