Conditional Probability in the Light of Qualitative Belief Change. David Makinson LSE Pontignano November 2009

Size: px
Start display at page:

Download "Conditional Probability in the Light of Qualitative Belief Change. David Makinson LSE Pontignano November 2009"

Transcription

1 Conditional Probability in the Light of Qualitative Belief Change David Makinson LSE Pontignano November

2 Contents Explore ways in which qualitative belief change in AGM tradition throws light on options in the treatment of conditional probability. Why we sometimes need to go beyond ratio rule defining conditional from one-place probability. Clarify criteria for choosing between the various axiomatizations for the two-place functions. Suggest novel forms of conditional probability. 2

3 Why Go Beyond the Ratio Rule? Kolmogorov s postulates for one-place probability functions are simple, natural easy to work with Ratio definition of conditional probability is convenient They have become standard So why go beyond them? 3

4 Background One-Place Probability Functions Proper Kolmogorov functions p: L [0,1] such that: p(x) p(y) whenever x l- y p(x y) = p(x)+p(y) whenever x l- y p(x) = 1 for some formula x Improper one The unit function: p(x) = 1 for all formulae x 4

5 Background Ratio Definition Ratio Definition Given 1-place p( ), define 2-place p(, ) p(x a) = p(a x) / p(a) when p(a) >0, otherwise undefined Thus partial function, on Lx{a L: p(a) > 0} Two Problems Should we extend 2nd argument to whole of L? If so, how best to do it? 5

6 First Problem: Should We Extend? Metaphysical Reasons de Finetti, Rényi, Hájek, De Finetti 1974: Every evaluation of probability is conditional; not only on the mentality or psychology of the individual involved, at the time in question, but also, and especially, on the state of information in which he finds himself at that moment. 6

7 Not Very Convincing Substantive: infinite regress, unless you take the universe as your domain Historical: compare with old view universal quantification really conditional, should be over the universe Methodological: Even if conditional, should perhaps not be put in the theory itself. If conditions held fixed, leave them to stage of application. 7

8 Pragmatic Reason Limited expressive capacity Even when p(a) = 0, might like to consider what happens under the supposition that a Example of Borel: p(western hemisphere, equator) 8

9 Critical Zone Zone of difficulty for the second argument a (condition) of a 2-place prob. function p(x,a) {a L: a consistent but p(a) = 0}, {a L: a consistent but p(a,t) = 0} (resp.1-plac /2-place primitive) OK above critical zone: p(a) > 0 - use ratio rule OK below: a inconsistent put p(x,a)= 1 (left projection from a is unit function) 9

10 Degenerate Completions Traditional In critical zone (a consistent but p(a,t) = 0), again put p(x,a)= 1 Left projection from critical a is unit function Carnap Abolish critical zone Axiom: critical zone is empty: when p(a,t) = 0 then a is inconsistent 10

11 Work around the Problem (Rényi) Define 2-place from 1-place functions When p(a) > 0, use ratio rule, when a inconsistent,put p(x,a) = 1 In critical zone, take p(x,a) to be limit of values of p(x a ) for a suitable infinite sequence of noncritical approximations a to a Works well in some cases (eg Borel example) But only when in structure based on reals satisfying suitable conditions 11

12 A Leaf from the AGM Book Compare with situation in qualitative belief change A theory: set of propositions close under classical consequence Expand theory K: add, close: K+a = Cn(K {a}) When a inconsistent, gives blow-out When a in critical zone (consistent but inconsistent with K) also gives blow-out Same problem - how is it dealt with? 12

13 Qualitative Revision When a is in critical zone (consistent but inconsistent with K), first contract a from K, then add a and close under consequence K a = Cn((K a) {a}) where is suitable contraction operation forms a subset of K that is consistent with a (when a itself is consistent) and satisfying certain regularity conditions (AGM postulates) 13

14 Different Behaviour of Expansion and Revision Belief preservation: K K+a Expansion yes, revision no Blow-out: when a in critical zone (consistent but inconsistent with K) then K+a =L Expansion yes, revision no Consistency (of input) preservation: when a is consistent, so is K a Revision yes, expansion no 14

15 Similarly for Conditional Probability (ratio/unit like expansion) Belief preservation: p(x,a) = 1 when p(a,t) = 1 Ratio/unit yes, revisionary should not Blow-out: when a in critical zone (a consistent but p(a,t) = 0) then p(x,a) = 1 for all x Ratio/unit yes, revisionary should not Consistency (of input) preservation: when a is in critical zone, then p(x,a) 1 for some x (eg falsum) Ratio/unit no, revisionary should (?) 15

16 But More than one Kind of Essentially Two main candidates Conditional probability Hosiasson-Lindenbaum 1940 vs Popper 1959 (Rényi 1955 in effect gives a scheme with a parameter, which can be instantiated to either) What s the difference? Can be confusing Qualitative belief revision helps understand what is involved 16

17 Background: Modular Presentation Common postulates for p: L2 [0,1] (van Fraassen 1976, 1995) (vf1) p(x,a) = p(x,b) whenever a b (vf2) p a is a 1-place Kolmogorov fn with p a (a) = 1 (vf3) p(x y,a) = p(x,a) p(y,a x) for all a,x,y (vf2) does not tell us when p a is proper or improper (unit). Axioms consistent with every p a is unit function 17

18 van Fraassen Axioms Imply Write for {a: p a is unit function}. Then is Non-empty When a inconsistent then a Closed downwards When a, b - a then b Closed under disjunction When a,b then a b In summary: is non-empty ideal 18

19 Above the Critical Zone (RP) When p(a,t) > 0, then p a is a proper oneplace Kolmogorov function This gives us Popper system 1959 In it, we know what happens above critical zone (proper) and below (unit) but not within Could all be proper; could all be unit; could have some proper, some unit, depending on choice of a in critical zone 19

20 The Two Degenerate Systems Add to Popper respectively: (Carnap) Critical zone empty,i.e. when a is consistent then p(a,t) > 0 (Unit) When a is consistent but p(a,t) = 0, then p a is the unit function 20

21 Hosiasson-Lindenbaum 1940 Add to the van Fraassen axioms (or equivalently to Popper) (HL) When a is consistent but p(a,t) = 0, then p a is a proper one-place Kolmogorov function 21

22 Conceptual Differences Hosiasson-Lindenbaum radically revisionary Satisfies counterpart of consistency preservation i.e. for every consistent a, p a is a proper Kolmogorov function (no blow-out) Popper partly revisionary, partly expansionary Covers all the HL functions Also the Unit functions Many mixed functions 22

23 Hasse Diagram (mostly Leblanc, Roeper 1989, 1999) vf = Popper {1(, )} Popper Unit HL Unit HL Carnap = Unit HL 23

24 Choosing between Systems Not question of right system and wrong ones Rather: How revisionary do we want to be, in a given context? Completely revisionary: HL Leave degree of revision/expansion to the user: use Popper Not at all revisionary: use Unit system or ratio/unit definition) Different applications, different choices 24

25 Choice of Consequence Operation In a sense, the different systems do not reflect different conceptions of probability, but different choices of the underlying consequence relation = {a L: p a is unit function} is non-empty ideal = {a L: p a is unit function} is non-empty filter Determines a supraclassical consequence operation Cn (A) = Cn(A ) 25

26 Translation Theorem Any Popper function (modulo classical Cn) is itself a Hosiasson-Lindenbaum function modulo a suitably defined supraclassical consequence operation Cn, with certain elements of the critical zone becoming Cn -inconsistent (In field of sets mode, take quotient structure via the ideal, same result) 26

27 Screened Belief Revision Existing work on qualitative belief revision can lead us to further perspectives and ideas for conditional probability Screened revision (Theoria 1997) Basic idea: Two steps: a pre-processing step, possibly followed by an AGM revision 27

28 The Two Step Dance The pre-processor decides whether to revise Check whether proposed input is consistent with a central part of the belief set under consideration, i.e. a privileged subset If answer negative, theory remains unchanged. If it is positive, we apply an AGM revision in a manner that protects the privileged material 28

29 Properties of Screened Revision AGM Success postulate fails Can have a K a When a inconsistent K a = K Other changes also needed see Theoria

30 Probabilistic Analogue? Idea Conditionalize when appropriate, otherwise do nothing Like RP or HL except For values of a where left projection p a would be the unit function, we now put p a = p T 30

31 Properties? Stronger p a always proper Kolmogorov function Weaker Analogue of success is p(a,a) = 1 Fails: when we do nothing: p(a,a) = p a (a) = p T (a), which can be 1. Also forces restriction of product axiom Adequate axiomatization? Open question 31

32 Light in Reverse Direction We have been using AGM belief revision to help throw light on conditional probability. Also insight looking in other direction Natural map from two-place functions satisfying Hosiasson-Lindenbaum (HL) postulates into the family of AGM belief revision operations modulo classical consequence In fact onto. Not injective (essentially because distinct 2-place prob fns can have same top Omit details 32

33 General Moral of the Story Conceptual links between AGM qualitative belief revision Conditional probability Qualitative belief revision helps see conceptual options in probabilistic context, arising in critical zone Also maps in reverse direction Still much to explore, for both belief revision and probability 33

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Bayesian Epistemology Radical probabilism doesn t insists that probabilities be based on certainties;

More information

Metainduction in Operational Set Theory

Metainduction in Operational Set Theory Metainduction in Operational Set Theory Luis E. Sanchis Department of Electrical Engineering and Computer Science Syracuse University Syracuse, NY 13244-4100 Sanchis@top.cis.syr.edu http://www.cis.syr.edu/

More information

Belief revision: A vade-mecum

Belief revision: A vade-mecum Belief revision: A vade-mecum Peter Gärdenfors Lund University Cognitive Science, Kungshuset, Lundagård, S 223 50 LUND, Sweden Abstract. This paper contains a brief survey of the area of belief revision

More information

Conditional Logic and Belief Revision

Conditional Logic and Belief Revision Conditional Logic and Belief Revision Ginger Schultheis (vks@mit.edu) and David Boylan (dboylan@mit.edu) January 2017 History The formal study of belief revision grew out out of two research traditions:

More information

CS 486: Applied Logic Lecture 7, February 11, Compactness. 7.1 Compactness why?

CS 486: Applied Logic Lecture 7, February 11, Compactness. 7.1 Compactness why? CS 486: Applied Logic Lecture 7, February 11, 2003 7 Compactness 7.1 Compactness why? So far, we have applied the tableau method to propositional formulas and proved that this method is sufficient and

More information

CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010

CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 So far our notion of realistic computation has been completely deterministic: The Turing Machine

More information

Synthetic Probability Theory

Synthetic Probability Theory Synthetic Probability Theory Alex Simpson Faculty of Mathematics and Physics University of Ljubljana, Slovenia PSSL, Amsterdam, October 2018 Gian-Carlo Rota (1932-1999): The beginning definitions in any

More information

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including

More information

Ranking Theory. Franz Huber Department of Philosophy University of Toronto, Canada

Ranking Theory. Franz Huber Department of Philosophy University of Toronto, Canada Ranking Theory Franz Huber Department of Philosophy University of Toronto, Canada franz.huber@utoronto.ca http://huber.blogs.chass.utoronto.ca The Open Handbook of Formal Epistemology edited by Richard

More information

CHAPTER 1: Functions

CHAPTER 1: Functions CHAPTER 1: Functions 1.1: Functions 1.2: Graphs of Functions 1.3: Basic Graphs and Symmetry 1.4: Transformations 1.5: Piecewise-Defined Functions; Limits and Continuity in Calculus 1.6: Combining Functions

More information

Modal and temporal logic

Modal and temporal logic Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv pages

Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv pages Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv + 408 pages by Bradley Monton June 24, 2009 It probably goes without saying that

More information

Base Revision in Description Logics - Preliminary Results

Base Revision in Description Logics - Preliminary Results Base Revision in Description Logics - Preliminary Results Márcio Moretto Ribeiro and Renata Wassermann Institute of Mathematics and Statistics University of São Paulo Brazil, {marciomr,renata}@ime.usp.br

More information

SUPPLEMENT TO CHAPTER 3

SUPPLEMENT TO CHAPTER 3 SUPPLEMENT TO CHAPTER 3 1.1 Linear combinations and spanning sets Consider the vector space R 3 with the unit vectors e 1 = (1, 0, 0), e 2 = (0, 1, 0), e 3 = (0, 0, 1). Every vector v = (a, b, c) R 3 can

More information

Infinite Truth-Functional Logic

Infinite Truth-Functional Logic 28 Notre Dame Journal of Formal Logic Volume 29, Number 1, Winter 1988 Infinite Truth-Functional Logic THEODORE HAILPERIN What we cannot speak about [in K o or fewer propositions] we must pass over in

More information

DL-Lite Contraction and Revision

DL-Lite Contraction and Revision Journal of Artificial Intelligence Research 56 (2016) 329-378 Submitted 12/15; published 06/16 DL-Lite Contraction and Revision Zhiqiang Zhuang Institute for Integrated and Intelligent Systems Griffith

More information

Reasoning with Inconsistent and Uncertain Ontologies

Reasoning with Inconsistent and Uncertain Ontologies Reasoning with Inconsistent and Uncertain Ontologies Guilin Qi Southeast University China gqi@seu.edu.cn Reasoning Web 2012 September 05, 2012 Outline Probabilistic logic vs possibilistic logic Probabilistic

More information

Marc Lange -- IRIS. European Journal of Philosophy and Public Debate

Marc Lange -- IRIS. European Journal of Philosophy and Public Debate Structuralism with an empiricist face? Bas Van Fraassen s Scientific Representation: Paradoxes of Perspective is a rich, masterful study of a wide range of issues arising from the manifold ways in which

More information

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference

More information

Non-monotonic Logic I

Non-monotonic Logic I Non-monotonic Logic I Bridges between classical and non-monotonic consequences Michal Peliš 1 Common reasoning monotonicity Γ ϕ Γ ϕ can fail caused by: background knowledge, implicit facts, presuppositions,

More information

Equivalent Forms of the Axiom of Infinity

Equivalent Forms of the Axiom of Infinity Equivalent Forms of the Axiom of Infinity Axiom of Infinity 1. There is a set that contains each finite ordinal as an element. The Axiom of Infinity is the axiom of Set Theory that explicitly asserts that

More information

How Serious Is the Paradox of Serious Possibility?

How Serious Is the Paradox of Serious Possibility? How Serious Is the Paradox of Serious Possibility? Simone Duca Ruhr University Bochum simone.duca@gmail.com Hannes Leitgeb Ludwig Maximilian University hannes.leitgeb@lmu.de The so-called Paradox of Serious

More information

2.3 Measuring Degrees of Belief

2.3 Measuring Degrees of Belief Richard Johns From A Theory of Physical Probability, U. of T. Press, 2002 2.3 Measuring Degrees of Belief Having sketched out the nature of logical probability, let us now proceed to giving a precise account

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

Causal completeness of probability theories results and open problems

Causal completeness of probability theories results and open problems Causal completeness of probability theories results and open problems Miklós Rédei Department of Philosophy, Logic and Scientific Method London School of Economics and Political Science Houghton Street

More information

Stochastic Quantum Dynamics I. Born Rule

Stochastic Quantum Dynamics I. Born Rule Stochastic Quantum Dynamics I. Born Rule Robert B. Griffiths Version of 25 January 2010 Contents 1 Introduction 1 2 Born Rule 1 2.1 Statement of the Born Rule................................ 1 2.2 Incompatible

More information

Tree sets. Reinhard Diestel

Tree sets. Reinhard Diestel 1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked

More information

Probability theory basics

Probability theory basics Probability theory basics Michael Franke Basics of probability theory: axiomatic definition, interpretation, joint distributions, marginalization, conditional probability & Bayes rule. Random variables:

More information

On the Revision of Probabilistic Belief States. Craig Boutilier. Department of Computer Science. University of British Columbia

On the Revision of Probabilistic Belief States. Craig Boutilier. Department of Computer Science. University of British Columbia On the Revision of Probabilistic Belief States Craig Boutilier Department of Computer Science University of British Columbia Vancouver, British Columbia CANADA, V6T 1Z4 Abstract In this paper we describe

More information

Probability Basics. Robot Image Credit: Viktoriya Sukhanova 123RF.com

Probability Basics. Robot Image Credit: Viktoriya Sukhanova 123RF.com Probability Basics These slides were assembled by Eric Eaton, with grateful acknowledgement of the many others who made their course materials freely available online. Feel free to reuse or adapt these

More information

A Short Review of Cardinality

A Short Review of Cardinality Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the

More information

Proving Completeness for Nested Sequent Calculi 1

Proving Completeness for Nested Sequent Calculi 1 Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there

More information

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model)

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model) TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Final exam Logic & Set Theory (2IT61) (correction model) Thursday November 4, 2016, 9:00 12:00 hrs. (2) 1. Determine whether the abstract

More information

via Topos Theory Olivia Caramello University of Cambridge The unification of Mathematics via Topos Theory Olivia Caramello

via Topos Theory Olivia Caramello University of Cambridge The unification of Mathematics via Topos Theory Olivia Caramello in University of Cambridge 2 / 23 in in In this lecture, whenever I use the word topos, I really mean Grothendieck topos. Recall that a Grothendieck topos can be seen as: a generalized space a mathematical

More information

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1 Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in

More information

From Constructibility and Absoluteness to Computability and Domain Independence

From Constructibility and Absoluteness to Computability and Domain Independence From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main

More information

Geometry and Philosophy

Geometry and Philosophy Geometry and Philosophy Russell Marcus Hamilton College November 2007 Philosophy and Geometry, Slide 1 Plato s Academy Let no one ignorant of geometry enter here Philosophy and Geometry, Slide 2 The Big

More information

Three contrasts between two senses of coherence

Three contrasts between two senses of coherence Three contrasts between two senses of coherence Teddy Seidenfeld Joint work with M.J.Schervish and J.B.Kadane Statistics, CMU Call an agent s choices coherent when they respect simple dominance relative

More information

A Rejoinder to Mackintosh and some Remarks on the. Concept of General Intelligence

A Rejoinder to Mackintosh and some Remarks on the. Concept of General Intelligence A Rejoinder to Mackintosh and some Remarks on the Concept of General Intelligence Moritz Heene Department of Psychology, Ludwig Maximilian University, Munich, Germany. 1 Abstract In 2000 Nicholas J. Mackintosh

More information

1. what conditional independencies are implied by the graph. 2. whether these independecies correspond to the probability distribution

1. what conditional independencies are implied by the graph. 2. whether these independecies correspond to the probability distribution NETWORK ANALYSIS Lourens Waldorp PROBABILITY AND GRAPHS The objective is to obtain a correspondence between the intuitive pictures (graphs) of variables of interest and the probability distributions of

More information

Framing human inference by coherence based probability logic

Framing human inference by coherence based probability logic Framing human inference by coherence based probability logic Pfeifer, N., & Kleiter, G. D. University of Salzburg (Austria) p. 1 Why coherence based? Degrees of belief & subjective probabilities versus

More information

Measurement Independence, Parameter Independence and Non-locality

Measurement Independence, Parameter Independence and Non-locality Measurement Independence, Parameter Independence and Non-locality Iñaki San Pedro Department of Logic and Philosophy of Science University of the Basque Country, UPV/EHU inaki.sanpedro@ehu.es Abstract

More information

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula: Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and

More information

This is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability

This is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability 16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of

More information

The Integers. Peter J. Kahn

The Integers. Peter J. Kahn Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,

More information

Representability of Recursive Functions

Representability of Recursive Functions 16 Representability of Recursive Functions In the preceding chapter we connected our work on recursion with our work on formulas and proofs in one way, by showing that various functions associated with

More information

Proofs of Correctness: Introduction to Axiomatic Verification

Proofs of Correctness: Introduction to Axiomatic Verification Proofs of Correctness: Introduction to Axiomatic Verification Introduction Weak correctness predicate Assignment statements Sequencing Selection statements Iteration 1 Introduction What is Axiomatic Verification?

More information

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers: WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their

More information

A Way of Getting Rid of Things:

A Way of Getting Rid of Things: A Way of Getting Rid of Things: Higher-order Langauges, Priorian Nominalism, and Nihilism: Cian Dorr Rutgers Workshop on Structural Realism and the Metaphysics of Science 1. Higher-order quantification

More information

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted

More information

23.1 Gödel Numberings and Diagonalization

23.1 Gödel Numberings and Diagonalization Applied Logic Lecture 23: Unsolvable Problems in Logic CS 4860 Spring 2009 Tuesday, April 14, 2009 The fact that Peano Arithmetic is expressive enough to represent all computable functions means that some

More information

So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special!

So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special! Jerry Fodor and his Special Sciences So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special! ) The use of special in

More information

Revision of DL-Lite Knowledge Bases

Revision of DL-Lite Knowledge Bases Revision of DL-Lite Knowledge Bases Zhe Wang, Kewen Wang, and Rodney Topor Griffith University, Australia Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs).

More information

Identity in Physics and Elsewhere

Identity in Physics and Elsewhere Identity in Physics and Elsewhere Otávio Bueno Department of Philosophy University of Miami Coral Gables, FL 33124, USA E-mail: otaviobueno@mac.com 1. INTRODUCTION Is identity a fundamental concept? Of

More information

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring

More information

Section 2: Classes of Sets

Section 2: Classes of Sets Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks

More information

Justification logic - a short introduction

Justification logic - a short introduction Institute of Computer Science and Applied Mathematics University of Bern Bern, Switzerland January 2013 Modal Logic A Modal Logic A A B and Modal Logic A A B B and thus Modal Logic A A B B and thus A (A

More information

Chapter 2 Classical Probability Theories

Chapter 2 Classical Probability Theories Chapter 2 Classical Probability Theories In principle, those who are not interested in mathematical foundations of probability theory might jump directly to Part II. One should just know that, besides

More information

CONSTRUCTION OF THE REAL NUMBERS.

CONSTRUCTION OF THE REAL NUMBERS. CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to

More information

Capturing Lewis s Elusive Knowledge

Capturing Lewis s Elusive Knowledge Zhaoqing Xu Department of Philosophy, Peking University zhaoqingxu@gmail.com September 22, 2011 1 Introduction 2 Philosophical Background Dretske s Relevant Alternatives Theory Lewis s Elusive Knowledge

More information

Sequence convergence, the weak T-axioms, and first countability

Sequence convergence, the weak T-axioms, and first countability Sequence convergence, the weak T-axioms, and first countability 1 Motivation Up to now we have been mentioning the notion of sequence convergence without actually defining it. So in this section we will

More information

UNCERTAINTY. In which we see what an agent should do when not all is crystal-clear.

UNCERTAINTY. In which we see what an agent should do when not all is crystal-clear. UNCERTAINTY In which we see what an agent should do when not all is crystal-clear. Outline Uncertainty Probabilistic Theory Axioms of Probability Probabilistic Reasoning Independency Bayes Rule Summary

More information

A Primer on Boole s Algebra of Logic for Classes

A Primer on Boole s Algebra of Logic for Classes Outline The Paradigm Early Insights Boole s Algebra of Classes (Quick Overview) Defining Multiplication Numbers as Classes Schröder s Translations Two Cautions Boole s Equational System Def A B Def A B

More information

Lesson Objectives: we will learn:

Lesson Objectives: we will learn: Lesson Objectives: Setting the Stage: Lesson 66 Improper Integrals HL Math - Santowski we will learn: How to solve definite integrals where the interval is infinite and where the function has an infinite

More information

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1 Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of

More information

The Axiom of Infinity, Quantum Field Theory, and Large Cardinals. Paul Corazza Maharishi University

The Axiom of Infinity, Quantum Field Theory, and Large Cardinals. Paul Corazza Maharishi University The Axiom of Infinity, Quantum Field Theory, and Large Cardinals Paul Corazza Maharishi University The Quest for an Axiomatic Foundation For Large Cardinals Gödel believed natural axioms would be found

More information

The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)

The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:

More information

TR : Possible World Semantics for First Order LP

TR : Possible World Semantics for First Order LP City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2011 TR-2011010: Possible World Semantics for First Order LP Melvin Fitting Follow this and additional

More information

Computational Tasks and Models

Computational Tasks and Models 1 Computational Tasks and Models Overview: We assume that the reader is familiar with computing devices but may associate the notion of computation with specific incarnations of it. Our first goal is to

More information

MATH 3300 Test 1. Name: Student Id:

MATH 3300 Test 1. Name: Student Id: Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your

More information

A PECULIAR COIN-TOSSING MODEL

A PECULIAR COIN-TOSSING MODEL A PECULIAR COIN-TOSSING MODEL EDWARD J. GREEN 1. Coin tossing according to de Finetti A coin is drawn at random from a finite set of coins. Each coin generates an i.i.d. sequence of outcomes (heads or

More information

06 Recursive Definition and Inductive Proof

06 Recursive Definition and Inductive Proof CAS 701 Fall 2002 06 Recursive Definition and Inductive Proof Instructor: W. M. Farmer Revised: 30 November 2002 1 What is Recursion? Recursion is a method of defining a structure or operation in terms

More information

Canonical models for normal logics (Completeness via canonicity)

Canonical models for normal logics (Completeness via canonicity) 499 Modal and Temporal Logic Canonical models for normal logics (Completeness via canonicity) Marek Sergot Department of Computing Imperial College, London Autumn 2008 Further reading: B.F. Chellas, Modal

More information

Lecture 1: The Humean Thesis on Belief

Lecture 1: The Humean Thesis on Belief Lecture 1: The Humean Thesis on Belief Hannes Leitgeb LMU Munich October 2014 What do a perfectly rational agent s beliefs and degrees of belief have to be like in order for them to cohere with each other?

More information

Lecture Notes on The Curry-Howard Isomorphism

Lecture Notes on The Curry-Howard Isomorphism Lecture Notes on The Curry-Howard Isomorphism 15-312: Foundations of Programming Languages Frank Pfenning Lecture 27 ecember 4, 2003 In this lecture we explore an interesting connection between logic and

More information

Automata Theory and Formal Grammars: Lecture 1

Automata Theory and Formal Grammars: Lecture 1 Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)

More information

Bayesian Reasoning. Adapted from slides by Tim Finin and Marie desjardins.

Bayesian Reasoning. Adapted from slides by Tim Finin and Marie desjardins. Bayesian Reasoning Adapted from slides by Tim Finin and Marie desjardins. 1 Outline Probability theory Bayesian inference From the joint distribution Using independence/factoring From sources of evidence

More information

CHAPTER 8: MATRICES and DETERMINANTS

CHAPTER 8: MATRICES and DETERMINANTS (Section 8.1: Matrices and Determinants) 8.01 CHAPTER 8: MATRICES and DETERMINANTS The material in this chapter will be covered in your Linear Algebra class (Math 254 at Mesa). SECTION 8.1: MATRICES and

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

More information

Analysis of Probabilistic Systems

Analysis of Probabilistic Systems Analysis of Probabilistic Systems Bootcamp Lecture 2: Measure and Integration Prakash Panangaden 1 1 School of Computer Science McGill University Fall 2016, Simons Institute Panangaden (McGill) Analysis

More information

Math 109 September 1, 2016

Math 109 September 1, 2016 Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,

More information

First Steps Towards Revising Ontologies

First Steps Towards Revising Ontologies First Steps Towards Revising Ontologies Márcio Moretto Ribeiro and Renata Wassermann Institute of Mathematics and Statistics University of São Paulo Brasil, {marciomr,renata}@ime.usp.br Abstract. When

More information

2.1 Convergence of Sequences

2.1 Convergence of Sequences Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written

More information

MAGIC Set theory. lecture 2

MAGIC Set theory. lecture 2 MAGIC Set theory lecture 2 David Asperó University of East Anglia 22 October 2014 Recall from last time: Syntactical vs. semantical logical consequence Given a set T of formulas and a formula ', we write

More information

18.175: Lecture 2 Extension theorems, random variables, distributions

18.175: Lecture 2 Extension theorems, random variables, distributions 18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing

More information

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

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC) Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 15 Propositional Calculus (PC) So, now if you look back, you can see that there are three

More information

HELP US REMOVE OUTDATED BELIEFS?

HELP US REMOVE OUTDATED BELIEFS? CAN INFORMATION THEORY HELP US REMOVE OUTDATED BELIEFS? Erik J. Olsson Lund University Cognitive Science Kungshuset, Lundagård S-222 22 Lund, Sweden E-mail Erik.Olsson@filosofi.uu.se Abstract: It is argued

More information

ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 1. Reminder and Review of Probability Concepts

ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 1. Reminder and Review of Probability Concepts ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 1. Reminder and Review of Probability Concepts 1 States and Events In an uncertain situation, any one of several possible outcomes may

More information

Three Themes. A Historical Tradition. Events and Times: A Case Study in Means-ends Metaphysics. Immanuel Kant. Metaphysics: Methodology

Three Themes. A Historical Tradition. Events and Times: A Case Study in Means-ends Metaphysics. Immanuel Kant. Metaphysics: Methodology Three Themes Metaphysics: The nature of events The relation between events and time Events and Times: A Case Study in Means-ends Metaphysics Christopher Hitchcock California Institute of Technology Methodology

More information

Universal probability-free conformal prediction

Universal probability-free conformal prediction Universal probability-free conformal prediction Vladimir Vovk and Dusko Pavlovic March 20, 2016 Abstract We construct a universal prediction system in the spirit of Popper s falsifiability and Kolmogorov

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

Probability, Entropy, and Inference / More About Inference

Probability, Entropy, and Inference / More About Inference Probability, Entropy, and Inference / More About Inference Mário S. Alvim (msalvim@dcc.ufmg.br) Information Theory DCC-UFMG (2018/02) Mário S. Alvim (msalvim@dcc.ufmg.br) Probability, Entropy, and Inference

More information

The Evolution and Discovery of the Species of Equality in Euclid s Elements

The Evolution and Discovery of the Species of Equality in Euclid s Elements From the SelectedWorks of Lee T Nutini 2010 The Evolution and Discovery of the Species of Equality in Euclid s Elements Lee T Nutini Available at: https://works.bepress.com/nutini/2/ Nutini 1 The Evolution

More information

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12 Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth

More information

CSCI3390-Lecture 6: An Undecidable Problem

CSCI3390-Lecture 6: An Undecidable Problem CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or

More information

Polarization and Bipolar Probabilistic Argumentation Frameworks

Polarization and Bipolar Probabilistic Argumentation Frameworks Polarization and Bipolar Probabilistic Argumentation Frameworks Carlo Proietti Lund University Abstract. Discussion among individuals about a given issue often induces polarization and bipolarization effects,

More information

A Note on Negligible Functions

A Note on Negligible Functions Appears in Journal of Cryptology Vol. 15, 2002, pp. 271 284. Earlier version was Technical Report CS97-529, Department of Computer Science and Engineering, University of California at San Diego, March

More information

Notes 1 Autumn Sample space, events. S is the number of elements in the set S.)

Notes 1 Autumn Sample space, events. S is the number of elements in the set S.) MAS 108 Probability I Notes 1 Autumn 2005 Sample space, events The general setting is: We perform an experiment which can have a number of different outcomes. The sample space is the set of all possible

More information

Preference, Choice and Utility

Preference, Choice and Utility Preference, Choice and Utility Eric Pacuit January 2, 205 Relations Suppose that X is a non-empty set. The set X X is the cross-product of X with itself. That is, it is the set of all pairs of elements

More information