Overview of Today s Lecture
|
|
- Lee Boyd
- 6 years ago
- Views:
Transcription
1 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW #2 due on Friday (2/10). Adding 2-place (binary) predicates to the language (L2PL). Symbolizations in L2PL (Rewind) Definition of a Limit (Take Three!) L2PL semantics (Working with and constructing L2PL Interpretations ) Can no longer think in terms of & and for and Infinite domains are sometimes required for L2PL invalidity Next Topic: Proof Theory (Natural Deduction) for LSL (Chapter 4)
2 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 2 L2PL Symbolization (Rewind) The Definition of a Limit (Correction). Let f be a real-valued function (i.e., suppose f : R R). Then, a limiting value of f is defined as: lim f (x) = L ( y > 0)( z > 0)( x) [ 0 < x c < z ] f (x) L < y x c In order to symbolize this definition in L2PL, we ll need (i) one monadic predicate, (ii) two binary relations, and (iii) a domain D = R. The monadic predicate we ll need is: (i) Gv v > 0. The 2 binary relations we ll need are: Dxz 0 < x c < z, and Lxy f (x) L < y. With these ingredients, we can now write the definition of a limit in our L2PL notation. Let s do this in two stages. First, Logish, then L2PL. Last time, I skipped some steps... For every y, if Gy then there is a z such that Gz and for all x Dxz implies Lxy. ( y) { Gy ( z) [ Gz & ( x) ( Dxz Lxy )]} I had been too hasty in my previous L2PL symbolization, which explains why Mathematica wasn t giving the expected answers. This works.
3 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 3 L2PL Interpretations III (I 1 ) Let D be the set consisting of George W. Bush (α) and Jeb Bush (β). And, let Bxy: x is a brother of y. Determine I 1 -truth-values for: 1. ( x)( y)bxy 2. ( y)( x)bxy α β (1) is on I 1, since both of its D-instances are on I 1. ( y)bay is on I 1 because its instance Bab is on I 1. That is, α, β Ext(B). Note: Ext(B) = { α, β, β, α }. ( y)bby is on I 1 because its instance Bba is on I 1. (2) is on I 1, since both of its D-instances are on I 1. ( x)bxa is on I 1 because its instance Baa is on I 1. That is, α, α Ext(B). ( x)bxb is on I 1 because its instance Bbb is on I 1.
4 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 4 L2PL Interpretations IV Just as with LMPL, L2PL interpretations can be used as counterexamples to validity claims. Establishing claims works just as you d expect. We have just seen an L2PL interpretation that shows the following: ( x)( y)rxy ( x)( y)rxy Interpretation I 1 on the previous slide is a counterexample. Why? ( x)( y)bxy is on I 1, since both of its instances are on I 1. ( x)( y)rxy is on I 1, since both of its instances are on I 1. Here is a very important L2PL invalidity: ( x)( y)rxy, ( x)( y)( z)[(rxy & Ryz) Rxz] ( x)rxx ( ) ( ) reveals a surprising difference between LMPL (and LSL) and L2PL sometimes infinite interpretations are needed to prove in L2PL!
5 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 5 Why ( ) is So Important L2PL vs LMPL: Infinite Domains In LMPL, if p is true on any interpretation I, then it is true on a finite interpretation. Indeed, p will be true on an interpretation of size no greater than 2 k, where k is the # of monadic predicate letters in p. In L2PL, some statements are true only on infinite interpretations. It is for this reason that there is no general decision procedure for validity (or logical truth) in L2PL. ( ) on the last slide is a good example of this. ( ) ( x)( y)rxy, ( x)( y)( z)[(rxy & Ryz) Rxz] ( x)rxx Fact. Only infinite interpretations I can be counterexamples to the validity in ( ). To see why, try to construct such an interpretation. We start by showing that no interpretation I 1 with a 1-element domain can be an interpretation on which the premises of ( ) are and its conclusion is. Then, we will repeat this argument for I 2 and I 3. This reasoning can, in fact, be shown correct for all (finite) n. So, only I s with infinite domains will work [e.g., D = N, Rxy: x < y]. Begin with a 1-element domain {α}. For the conclusion of (4) to be, no
6 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 6 object can be related to itself: ( x) Rxx. Thus, we must have Raa: But, to make the first premise, we need there to be some y such that Ray is. That means we need another object β to allow Rab. Thus: α α β Now, because we need the conclusion to remain, we must have Rbb. And, because we need the first premise to remain, we need there to be some y such that Rby is. We could try to make Rba, as follows: α β
7 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 7 But, this picture is not consistent with the second premise being and (at the same time) the conclusion being. If R is transitive, then Rab & Rba (as pictured) entails Raa, which makes the conclusion. Transitivity of R and entails: α β α β Thus, the only way to consistently ensure that there is some y such that Rby is to introduce yet another object γ (such that Rbc), which yields: α β Again, in order to make the conclusion, we must have Rcc, and in order to make the first premise, there must be some y such that Rcy. We could try to make either Rca or Rcb true. But, both of these choices will end-up with the same sort of inconsistency we just saw with β.
8 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 8 In other words, no finite interpretation will give us what we want here. However, if we let D = N and Rxy: x < y, then we get what we want That is, the relation Rxy: x < y on the natural numbers N is such that: For all x, there exists a y such that x < y. [seriality] For all x, y, z, if x < y and y < z, then x < z. [transitivity] For all x, x x. [irreflexivity] It is crucial that the set N of all natural numbers is infinite. The relation < cannot satisfy all three of these properties on any finite domain. I.e., no finite subset of N will suffice to show that the invalidity in (4) holds. Equivalently, the following sentence of L2PL is on all finite I s: p ( x)( y)rxy & ( x)( y)( z)[(rxy & Ryz) Rxz] & ( x) Rxx This sort of thing cannot happen in LMPL. In this sense, the introduction of a single 2-place predicate involves a quantum leap in complexity.
9 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 9 Some Further Remarks on Validity in L2PL As I just explained, there is no general decision procedure for claims in L2PL. This is because we can t always establish claims in finite time. However, there is a method for proving claims natural deduction. And, L2PL s natural deduction system is exactly the same as LMPL s! Before we get to proofs, however, I want to look at the alternating quantifier example that I said separates LMPL and L2PL. As we have seen, ( x)( y)rxy ( y)( x)rxy. But, the converse entailment does hold. That is, ( y)( x)rxy ( x)( y)rxy. We will prove i.e., deduce ( y)( x)rxy ( x)( y)rxy shortly. Before we do that, let s think about ( y)( x)rxy ( x)( y)rxy using our definitions, and our informal method of thinking of as & and as. This is interesting for both directions of the entailment. But, we need to be much more careful here than with LMPL!
10 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 10 First, consider what ( y)( x)rxy says on a domain of size n: ( y)( x)rxy n ( x)rxa ( x)rxb ( x)rxn n (Raa & & Rna) (Rab & & Rnb) (Ran & & Rnn) Next, consider what ( x)( y)rxy says on a domain of size n: ( x)( y)rxy n ( y)ray & ( y)rby & & ( y)rny n (Raa Ran) & (Rba Rbn) & & (Rna Rnn) Then, we notice that these two sentential forms are intimately related. Specifically, we note that ( y)( x)rxy has the following n-form: X n = (p 1 & p 2 & & p n ) (q 1 & q 2 & & q n ) (r 1 & r 2 & & r n ) And, we notice that ( x)( y)rxy has the following n-form: Y n = (p 1 q 1 r 1 ) & (p 2 q 2 r 2 ) & & (p n q n r n ) Fact. X n Y n, for any n. Each disjunct of X n entails every conjunct of Y n. Caution! This doesn t show that ( y)( x)rxy ( x)( y)rxy! Fact. Y n X n, for all n > 1. This can be shown (next slide) using only LSL reasoning. This does show that ( x)( y)rxy ( y)( x)rxy.
11 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 11 The moral is that our informal semantical approach to the quantifiers works for LMPL, since no infinite domains are required for in LMPL. However, our informal semantical approach breaks down for L2PL, since we sometimes need an infinite domain to establish in L2PL. In L2PL, if the informal method above reveals p n q n for some finite n, then it does follow that p q. For instance, Y 2 X 2 on the last slide: (Raa Rab) & (Rba Rbb) (Raa & Rba) (Rab & Rbb) This is just an LSL problem with 4-atoms [A = Raa, B = Rab, C = Rba, D = Rbb]. Truth-tables will generate a counterexample. On the other hand, if (in L2PL) our informal method indicates (as above) that p n q n for all finite n, this does not guarantee p q. E.g.: p = ( x)( y)rxy & ( x)( y)( z)[(rxy & Ryz) Rxz]. q = ( x)rxx. We showed above (informally) that p n q n for all finite n. But, we also saw that there are infinite interpretations on which p is but q is.
12 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 12 Truth vs Proof ( vs ) Recall: p q iff it is impossible for p to be true while q is false. We have methods (truth-tables) for establishing and claims. These methods are especially good for claims, but they get very complex for claims. Is there another more natural way to prove s? Yes! In Chapter 4, we will learn a natural deduction system for LSL. This is a system of rules of inference that will allow us to prove all valid LSL arguments in a purely syntactical way (no appeal to semantics). The notation p q means that there exists a natural deduction proof of q from p in our natural deduction system for sentential logic. p q is short for p deductively entails q. While has to do with truth, does not. has only to do with what can be deduced, using a fixed set of formal, natural deduction rules.
13 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 13 Happily, our system of natural deduction rules is sound and complete: Soundness. If p q, then p q. [no proofs of invalidities!] Completeness. If p q, then p q. [proofs of all validities!] We will not prove the soundness and completeness of our system of natural deduction rules. I will say a few things about soundness as we go along, but completeness is much harder to establish (140A!). We ll have rules that permit the elimination or introduction of each of the connectives &,,,, within natural deductions. These rules will make sense, from the point of view of the semantics. A proof of q from p is a sequence of LSL formulas, beginning with p and ending with q, where each formula in the sequence is deduced from previous lines, via a correct application of one of the rules. Generally, we will be talking about deductions of formulas q from sets of premises p 1,..., p n. We call these p 1,..., p n q s sequents.
14 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 14 An Example of a Natural Deduction Involving & and The following is a valid LSL argument form: A & B C & D (A & D) H H Here s a (7-line) natural deduction proof of the sequent corresponding to this argument: A & B, C & D, (A & D) H H. 1 (1) A & B Premise 2 (2) C & D Premise 3 (3) (A & D) H Premise 1 (4) A 1 &E 2 (5) D 2 &E 1, 2 (6) A & D 4, 5 &I 1, 2, 3 (7) H 3, 6 E
15 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 15 The Rule of Assumptions (Preliminary Version) Rule of Assumptions (preliminary version): The premises of an argument-form are listed at the start of a proof in the order in which they are given, each labeled Premise on the right and numbered with its own line number on the left. Schematically: j (j) p Premise We can see that our example proof begins, as it should, with the three premises of the argument-form, written as follows: 1 (1) A & B Premise 2 (2) C & D Premise 3 (3) (A & D) H Premise
16 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 16 The Rule of &-Elimination (&E) Rule of &-Elimination: If a conjunction p & q occurs at line j, then at any later line k one may infer either conjunct, labeling the line j &E and writing on the left all the numbers which appear on the left of line j. Schematically: a 1,..., a n (j) p & q a 1,..., a n (j) p & q. OR. a 1,..., a n (k) p j &E a 1,..., a n (k) q j &E We can see that our example deduction continues, in lines (4) and (5), with two correct applications of the &-Elimination Rule: 1 (4) A 1 &E 2 (5) D 2 &E
17 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 17 The Rule of &-Introduction (&I) Rule of &-Introduction: For any formulae p and q, if p occurs at line j and q occurs at line k then the formula p & q may be inferred at line m, labeling the line j, k &I and writing on the left all numbers which appear on the left of line j and all which appear on the left of line k. [Note: we may have j < k, j > k, or j = k. Why?] a 1,..., a n (j) p. b 1,..., b u (k) q. a 1,..., a n, b 1,..., b u (m) p & q j, k &I We can see that our example deduction continues, in lines (6), with a correct application of the &-Introduction Rule: 1, 2 (6) A & D 4, 5 &I
18 Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 18 Deduction #2 Using the Rules &E and &I Consider the valid LSL argument form: A & (B & C) C & (B & A) Let s do a deduction of this argument form: 1 (1) A & (B & C) Premise 1 (2) A 1 &E 1 (3) B & C 1 &E 1 (4) B 3 &E 1 (5) C 3 &E 1 (6) B & A 4, 2 &I 1 (7) C & (B & A) 5, 6 &I NOTE: &E can only be applied to formulas whose main connective is &, and &E must be applied to that particular connective.
Overview of Today s Lecture
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW
More informationAnnouncements & Such
Branden Fitelson Philosophy 12A Notes 1 Announcements & Such Administrative Stuff HW #6 to be handed back today. Resubs due Thursday. I will be posting both the sample in-class final and the take-home
More information13. APPENDIX 1: THE SYNTAX OF PREDICATE LOGIC
394 Hardegree, Symbolic Logic 13. APPENDIX 1: THE SYNTAX OF PREDICATE LOGIC In this appendix, we review the syntactic features of predicate logic that are crucial to understanding derivations in predicate
More informationThe Natural Deduction Pack
The Natural Deduction Pack Alastair Carr March 2018 Contents 1 Using this pack 2 2 Summary of rules 3 3 Worked examples 5 31 Implication 5 32 Universal quantifier 6 33 Existential quantifier 8 4 Practice
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationInterpretations of PL (Model Theory)
Interpretations of PL (Model Theory) 1. Once again, observe that I ve presented topics in a slightly different order from how I presented them in sentential logic. With sentential logic I discussed syntax
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationPropositional Logic Arguments (5A) Young W. Lim 11/30/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationFirst-Order Logic with Identity
8 Validity and Provability in First-Order Logic with Identity 1 Interpretations in LFOL If an argument of English (or some other natural language) has a valid form in LFOL (the language of first-order
More informationPhilosophy 148 Announcements & Such. The Probability Calculus: An Algebraic Approach XI. The Probability Calculus: An Algebraic Approach XII
Branden Fitelson Philosophy 148 Lecture 1 Branden Fitelson Philosophy 148 Lecture 2 Philosophy 148 Announcements & Such Administrative Stuff Branden s office hours today will be 3 4. We have a permanent
More informationI thank the author of the examination paper on which sample paper is based. VH
I thank the author of the examination paper on which sample paper is based. VH 1. (a) Which of the following expressions is a sentence of L 1 or an abbreviation of one? If an expression is neither a sentence
More information2010 Part IA Formal Logic, Model Answers
2010 Part IA Formal Logic, Model Answers 1 Attempt all parts of this question (a) Carefully define the notions of (i) a truth-function A function is a map which assigns exactly one value to each given
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationAnnouncements & Overview
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Announcements & Overview Administrative Stuff HW #3 grades and solutions have been posted HW #4 s due date extended to next Friday (LMPL/L2PL proofs)
More informationLecture 15: Validity and Predicate Logic
Lecture 15: Validity and Predicate Logic 1 Goals Today Learn the definition of valid and invalid arguments in terms of the semantics of predicate logic, and look at several examples. Learn how to get equivalents
More informationPropositional Logic Arguments (5A) Young W. Lim 11/29/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationLecture 13: Soundness, Completeness and Compactness
Discrete Mathematics (II) Spring 2017 Lecture 13: Soundness, Completeness and Compactness Lecturer: Yi Li 1 Overview In this lecture, we will prvoe the soundness and completeness of tableau proof system,
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More information1A Logic 2015 Model Answers
1A Logic 2015 Model Answers Section A 1. (a) Show each of the following [40]: (i) P Q, Q R, P R P 1 P Q 2 Q R 3 P R 4 P 5 P R, 4 6 P 7 Q DS, 1, 6 8 R DS, 2, 7 9 R 10 I, 8, 9 11 R E, 9, 10 12 P MT, 3, 11
More informationArguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)
Arguments and Proofs For the next section of this course, we will study PROOFS. A proof can be thought of as the formal representation of a process of reasoning. Proofs are comparable to arguments, since
More informationPropositional Logic Arguments (5A) Young W. Lim 2/23/17
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationPropositional Logic Arguments (5A) Young W. Lim 10/11/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More informationOverview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading
Course staff CS389L: Automated Logical Reasoning Lecture 1: ntroduction and Review of Basics şıl Dillig nstructor: şil Dillig E-mail: isil@cs.utexas.edu Office hours: Thursday after class until 6:30 pm
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationModal Logic: Exercises
Modal Logic: Exercises KRDB FUB stream course www.inf.unibz.it/ gennari/index.php?page=nl Lecturer: R. Gennari gennari@inf.unibz.it June 6, 2010 Ex. 36 Prove the following claim. Claim 1. Uniform substitution
More informationCMPSCI 601: Tarski s Truth Definition Lecture 15. where
@ CMPSCI 601: Tarski s Truth Definition Lecture 15! "$#&%(') *+,-!".#/%0'!12 43 5 6 7 8:9 4; 9 9 < = 9 = or 5 6?>A@B!9 2 D for all C @B 9 CFE where ) CGE @B-HI LJKK MKK )HG if H ; C if H @ 1 > > > Fitch
More informationModal logics and their semantics
Modal logics and their semantics Joshua Sack Department of Mathematics and Statistics, California State University Long Beach California State University Dominguez Hills Feb 22, 2012 Relational structures
More informationModal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014
Modal Logic UIT2206: The Importance of Being Formal Martin Henz March 19, 2014 1 Motivation The source of meaning of formulas in the previous chapters were models. Once a particular model is chosen, say
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationIntroduction 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 informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationCHAPTER 2. FIRST ORDER LOGIC
CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationFinal Exam (100 points)
Final Exam (100 points) Honor Code: Each question is worth 10 points. There is one bonus question worth 5 points. In contrast to the homework assignments, you may not collaborate on this final exam. You
More informationTo every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.
Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the
More informationINTRODUCTION TO LOGIC 8 Identity and Definite Descriptions
INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions Volker Halbach The analysis of the beginning would thus yield the notion of the unity of being and not-being or, in a more reflected form, the
More informationAnnouncements For Methods of Proof for Boolean Logic Proof by Contradiction. Outline. The Big Picture Where is Today? William Starr
Announcements For 09.22 Methods of for Boolean Logic William Starr 1 HW1 grades will be on Bb by end of week 2 HW4 is due on Tuesday This one is mostly written Feel free to type it out! 3 If you have problems
More informationPhilosophy 240: Symbolic Logic
Philosophy 240: Symbolic Logic Russell Marcus Hamilton College Fall 2015 Class #41 - Second-Order Quantification Marcus, Symbolic Logic, Slide 1 Second-Order Inferences P Consider a red apple and a red
More informationRelational Reasoning in Natural Language
1/67 Relational Reasoning in Natural Language Larry Moss ESSLLI 10 Course on Logics for Natural Language Inference August, 2010 Adding transitive verbs the work on R, R, and other systems is joint with
More informationDeduction by Daniel Bonevac. Chapter 3 Truth Trees
Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties
More informationFIRST PUBLIC EXAMINATION. Preliminary Examination in Philosophy, Politics and Economics INTRODUCTION TO PHILOSOPHY LONG VACATION 2014
CPPE 4266 FIRST PUBLIC EXAMINATION Preliminary Examination in Philosophy, Politics and Economics INTRODUCTION TO PHILOSOPHY LONG VACATION 2014 Thursday 4 September 2014, 9.30am - 12.30pm This paper contains
More informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More information6c Lecture 14: May 14, 2014
6c Lecture 14: May 14, 2014 11 Compactness We begin with a consequence of the completeness theorem. Suppose T is a theory. Recall that T is satisfiable if there is a model M T of T. Recall that T is consistent
More informationPL: Truth Trees. Handout Truth Trees: The Setup
Handout 4 PL: Truth Trees Truth tables provide a mechanical method for determining whether a proposition, set of propositions, or argument has a particular logical property. For example, we can show that
More informationProperties of Relational Logic
Computational Logic Lecture 8 Properties of Relational Logic Michael Genesereth Autumn 2011 Programme Expressiveness What we can say in First-Order Logic And what we cannot Semidecidability and Decidability
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationCPPE TURN OVER
[4] [1] [4] [16] The solutions are highly incomplete and only intended to give a rough idea. 1. (a) Which of the following expressions is an abbreviation of a sentence of L 1? If an expression is an abbreviation
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More informationCS 730/730W/830: Intro AI
CS 730/730W/830: Intro AI 1 handout: slides 730W journal entries were due Wheeler Ruml (UNH) Lecture 9, CS 730 1 / 16 Logic First-Order Logic The Joy of Power Wheeler Ruml (UNH) Lecture 9, CS 730 2 / 16
More informationPHIL12A Section answers, 28 Feb 2011
PHIL12A Section answers, 28 Feb 2011 Julian Jonker 1 How much do you know? Give formal proofs for the following arguments. 1. (Ex 6.18) 1 A B 2 A B 1 A B 2 A 3 A B Elim: 2 4 B 5 B 6 Intro: 4,5 7 B Intro:
More informationCSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9
CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin Today 9/28 Review propositional logic Reasoning with Models Break More reasoning Knowledge Representation A knowledge representation is a formal scheme
More informationAn analogy from Calculus: limits
COMP 250 Fall 2018 35 - big O Nov. 30, 2018 We have seen several algorithms in the course, and we have loosely characterized their runtimes in terms of the size n of the input. We say that the algorithm
More informationWarm-Up Problem. Is the following true or false? 1/35
Warm-Up Problem Is the following true or false? 1/35 Propositional Logic: Resolution Carmen Bruni Lecture 6 Based on work by J Buss, A Gao, L Kari, A Lubiw, B Bonakdarpour, D Maftuleac, C Roberts, R Trefler,
More informationWarm-Up Problem. Write a Resolution Proof for. Res 1/32
Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you
More informationINTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims
Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationACLT: 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 informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationCompleteness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:
Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) First Lecture Today (Tue 21 Jun) Read Chapters 1 and 2 Second Lecture Today (Tue 21 Jun) Read Chapter 7.1-7.4 Next Lecture (Thu 23 Jun) Read Chapters 7.5 (optional:
More informationMeta-logic derivation rules
Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will
More informationLecture 9. Model theory. Consistency, independence, completeness, categoricity of axiom systems. Expanded with algebraic view.
V. Borschev and B. Partee, October 17-19, 2006 p. 1 Lecture 9. Model theory. Consistency, independence, completeness, categoricity of axiom systems. Expanded with algebraic view. CONTENTS 0. Syntax and
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order
More informationAI Programming CS S-09 Knowledge Representation
AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering
More informationLecture 4: Proposition, Connectives and Truth Tables
Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine
More informationPropositional Logic: Semantics and an Example
Propositional Logic: Semantics and an Example CPSC 322 Logic 2 Textbook 5.2 Propositional Logic: Semantics and an Example CPSC 322 Logic 2, Slide 1 Lecture Overview 1 Recap: Syntax 2 Propositional Definite
More information1A Logic 2013 Model Answers
1A Logic 2013 Model Answers Section A 1. This is a question about TFL. Attempt all parts of this question. [Note that most of the material in this question has been moved to the metatheory section of the
More informationChapter 11: Automated Proof Systems
Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are
More informationPhilosophy 148 Announcements & Such
Branden Fitelson Philosophy 148 Lecture 1 Philosophy 148 Announcements & Such I hope you all enjoyed Mike & Kenny s lectures last week! HW #3 grades are posted. People did very well (µ = 93, σ = 8). I
More informationFirst Order Logic Implication (4A) Young W. Lim 4/6/17
First Order Logic (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationInducing syntactic cut-elimination for indexed nested sequents
Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More information4 The semantics of full first-order logic
4 The semantics of full first-order logic In this section we make two additions to the languages L C of 3. The first is the addition of a symbol for identity. The second is the addition of symbols that
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationIdentity. "At least one dog has fleas" is translated by an existential quantifier"
Identity Quantifiers are so-called because they say how many. So far, we've only used the quantifiers to give the crudest possible answers to the question "How many dogs have fleas?": "All," "None," "Some,"
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationCS Lecture 19: Logic To Truth through Proof. Prof. Clarkson Fall Today s music: Theme from Sherlock
CS 3110 Lecture 19: Logic To Truth through Proof Prof. Clarkson Fall 2014 Today s music: Theme from Sherlock Review Current topic: How to reason about correctness of code Last week: informal arguments
More informationPropositional Logic: Bottom-Up Proofs
Propositional Logic: Bottom-Up Proofs CPSC 322 Logic 3 Textbook 5.2 Propositional Logic: Bottom-Up Proofs CPSC 322 Logic 3, Slide 1 Lecture Overview 1 Recap 2 Bottom-Up Proofs 3 Soundness of Bottom-Up
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationPhil Introductory Formal Logic
Phil 134 - Introductory Formal Logic Lecture 7: Deduction At last, it is time to learn about proof formal proof as a model of reasoning demonstrating validity metatheory natural deduction systems what
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationINTRODUCTION TO LOGIC
INTRODUCTION TO LOGIC 6 Natural Deduction Volker Halbach There s nothing you can t prove if your outlook is only sufficiently limited. Dorothy L. Sayers http://www.philosophy.ox.ac.uk/lectures/ undergraduate_questionnaire
More informationHandout: Proof of the completeness theorem
MATH 457 Introduction to Mathematical Logic Spring 2016 Dr. Jason Rute Handout: Proof of the completeness theorem Gödel s Compactness Theorem 1930. For a set Γ of wffs and a wff ϕ, we have the following.
More information