Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )
|
|
- Joella Quinn
- 5 years ago
- Views:
Transcription
1 Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January ) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the study of mathematical logic. Like the lectures that were based on it, these notes are intended to supplement rather than replace the more informal treatment given in Critchlow & Eck. My hope is that you ll come away with a good intuition for the precision in reasoning that these formal systems capture, and that you will in turn find this experience of precision helpful in the more informal mathematical explorations of the rest of this course. For the curious, this presentation only explores the surface of this rich and powerful branch of mathematics. In particular, it elides all mention of the rich metatheory surrounding first-order logic, including the interplay of provability and semantic entailment, satisfiability and validity of formulas, consistency and completeness, the role of equality judgments, compactness, expressivity, undecidability, and alternative systems of inference rules. 1 Propositional Logic 1.1 Syntax Syntax describes the ways in which we can combine the symbols of a formal language into valid sentences or well-formed formulas (WFFs). In the case of propositional logic, this means that WFFs consist of propositional variables and the application of the logical connectives {,,, } to other WFFs. To jump ahead to a notation we ll see later in the semester, we can describe WFFs in propositional logic by the following grammar: 1
2 φ ::= [constants] P [propositional variables] φ 1 [logical negation] φ 1 φ 2 [conjunction] φ 1 φ 2 [disjunction] φ 1 φ 2 [implication] The constants bottom and top are used to denote the canonical contradiction and tautology. Their interpretations (see the following subsection on Truth Tables are, respectively, false and true 1. For clarity, we will often surround a formula with parenthesis, much as we do with arithmetic formulas. Usually, this is not necessary, as the operators are given here in decreasing order of precedence, which means that operators listed earlier group more tightly than those given later. For example, the formula P Q R S T should be read as (P (( Q) R)) (S T ). 1.2 Truth Tables Truth tables define the meaning of a WFF by providing an exhaustive list of all the possible truth values of the propositional variables in an expression, together with the corresponding truth value for the expression itself. In the following, we ll adopt the convention of writing 0 for false and 1 for true. As we saw in class, this helps to provide a reliable technique for making a complete truth table: think of each combination of the variables truth values as a binary number. P P P Q P Q P Q P Q P Q P Q The constants and, of course, have only one possibility each: 0 1 Strictly speaking, neither nor are necessary, but they allow us to include more intuitive rules for reasoning about contradiction. 1 2
3 1.3 Algebraic Equivalences Here are some useful identities. In each one, the lowercase Greek letters represent WFFs of propositional logic. All of the identities can be verified by examining their truth tables. Associativity of and Distributivity Commutativity Identity Elements Annihilators Idempotence DeMorgan s Laws Complementation (φ ψ) R φ (ψ R) (φ ψ) R φ (ψ R) φ (ψ R) (φ ψ) (φ R) φ (ψ R) (φ ψ) (φ R) φ ψ ψ φ φ ψ ψ φ φ φ φ φ φ φ φ φ φ φ φ (φ ψ) φ ψ (φ ψ) φ ψ φ φ (excluded middle) φ φ (noncontradiction) Double Negation φ φ Transposition φ ψ ψ φ Material Implication φ ψ φ ψ Exportation (φ ψ) R φ (ψ R) 3
4 In a related vein, we will occasionally use the macro operator φ ψ ( if and only if ) to denote the formula (φ ψ) (ψ φ). Note that some formulations of logic add this as an additional operator, in which case we add this identity to our algebra as the Law of Material Equivalence. 1.4 Rules of Inference For each of the three binary operators, we will need rules for inferring a formula that contains them (the introduction rules) and for inferring formulas that delete them ( elimination ): Introduction Elimination φ φ ψ ψ [ I] φ ψ [ E1 ] φ φ ψ [ E2 ] ψ φ [ I 1 ] φ ψ ψ [ I2 ] φ ψ φ R ψ R φ ψ [ E] R φ ψ [ I] φ ψ φ ψ φ [ E] ψ Rules for negation are a little different in that φ is really equivalent to the formula φ. On the other hand, proof by contradiction is an important technique, so we add here two inference rules, reductio ad absurdum ( reduction to absurdity ) and ex falso quodlibet ( from contradiction anything [can be derived] ), to shortcut some of the work of this task: φ φ [RAA] [EF Q] φ 4
5 Finally, we have the following two rules of syllogism (a kind of argument that goes back to Aristotle), Disjunctive Syllogism and Hypothetical Syllogism. Strictly speaking neither rule is necessary, in that both can be derived from other inference rules and identities given above. φ ψ ψ φ [DS] φ ψ φ R ψ R [HS] 1.5 Example Derivations In carrying out a formal derivation, it is important to remember that each judgement must be justified from the premises and judgements that have already been made, using only the equivalence laws and rules of inference that are given. If there is no available rule, it does not matter how obvious that inference may seem to you, the human reader. You have to find another way to get there, using the rules alone (usually, you can). The derivation style given in Critchlow and Eck, as well as in class, is known as a Fitch-style derivation. Here is one of the examples from class, illustrating the use of conditional proof to derive an implication (in this case, two of them). The proof makes use of two applications of the I rule, in which we add a new assumption, show that this implies a desired result, and thereby conclude an implication between the assumption and the conclusion. While this assumption is being used, we say that it is open. For example, the assumption of G in Line 4 is open between Lines When we no longer need an open assumption, we say that it is discharged. To save space, all applications of the algebraic rewriting laws are abbreviated with the justification R. 5
6 1 (F G) (H I) 2 F H 3 (F I) (H G) G I 4 G 5 H G E, 3 6 G H R, 5 7 G R, 4 8 H E, 5, 6 9 F DS, 2, 8 10 F I E, 3 11 I E, 9, 8 12 G I I, I 14 H I E, 1 15 I H R, H E, 15, F DS, 2, F G E, 1 19 G E, 18, I G I, (G I) ( I G) I, 12, 20 2 Predicate Logic Predicate logic adds to propositional logic the ability to express that a proposition is true for all elements in a domain, some, or none. In class, we have studied only first-order predicate logic (FOPL), meaning that we only consider quantification that ranges over individual elements, excluding quantification on propositions themselves Syntax The syntax for predicate logic is similar to propositional logic, with three significant additions: We define a set of terms, which consist of variables and functions whose arguments are themselves terms. In class, we considered only constants instead of functions. These may be thought of a functions 2 Logics of this sort are known as second-order (which allows quantification over firstorder predicates), third-order (with quantification over first and second order predicates), and so on. They are strictly more expressive than FOPL, but at the cost of undecidability of many properties. 6
7 with arity 0 (i.e., a function that takes no arguments). Examples of constant or higher-arity functions depend on our domain of discourse ( universe ). For example, if our domain consists of the real numbers, the binary functions would include the standard arithmetic operators ({+,,, }), exponentiation, logarithms, roots, and so on. Unary functions would include negation, the trigonometric functions, and others. The constants are just the real numbers themselves. By convention, we will use lower case letters near the end of the alphabet for variables and lower case letters near the beginning of the alphabet for constants (and other functions). We define a set of predicate symbols whose arguments are terms. By convention, these are written as uppercase letters. Predicates can be of any arity, though the most common forms we ve seen are unary ( one place ) and binary ( two place ) predicates. An arity 0 predicate is just an ordinary propositional variable. We add two quantifier symbols, ( for all ) and ( there exists ). This gives us the following definitions for well-formed formulas: φ ::= [constants] P (t 1,..., t n ), where t 1,..., t n are terms [propositional variables] φ 1 [negation] φ 1 φ 2 φ 1 φ 2 φ 1 φ 2 [binary connectives] x.φ 1 [universal quantification] x.φ 1 [existential quantification] Free and Bound Variables Programmers will find this idea familiar, as the free/bound variable distinction corresponds to the difference between a method s global (free) and local (bound) variables. We didn t spend much time with the technical details of this in class, but like the corresponding notion of scope in programming, it s important to have at least a working intuition of the definitions. 7
8 The set F V (t) of free variables of a term t is defined to be: F V (x) = {x}, if x is a variable F V (c) =, if c is a constant for a function f of arity n, F V (f(t 1,..., t n ) = F V (t 1 )... F V (t n ) (i.e., collect the free variables of all the argument terms). The free variables F V (φ) of a formula φ are defined by: F V ( ) = F V ( ) = F V (P (t 1,..., t n )) = F V (t 1 )... F V (t n ) F V (φ 1 ) F V (φ 2 ) = F V (φ 1 ) F V (φ 2 ), where is one of the binary connectives,,, or. F V ( φ 1 ) = F V (φ 1 ) F V ( x.φ 1 ) = F V ( x.φ 1 ) = F V (φ 1 ) {x} A variable that is not free in φ is bound. 3 The distinction between free and bound depends on whether we are considering a formula φ along with its quantifier. For example, the variable x is bound in the formula x.( P (x) Q(x, y)), but it is free in P (x) Q(x, y). The variable y is free in both. It is also possible for a variable to be both free and bound in the same formula. In (P (x) R(x)) ( x.[ (Q(x) R(x))] S(x)) for example, x is free in (P (x) R(x)) and S(x), but it is bound in x.[ (Q(x) R(x))]. 4 Among other things, the free/bound variable distinction helps to simplify the presentation of FOPL. In particular, we will informally distort the syntax for a quantified formula by writing x.φ(x) (resp. x.φ(x)) to indicate that the variable x in φ is bound by the associated quantifier. Similarly, for x.φ (resp. x.φ(x)) we will write φ(u) to denote φ, where all free occurrences of x in φ are replaced by u. 3 If inductive definitions like this are unfamiliar to you, it will suffice in most cases to think of free variables as those that are not quantified and bound variables as the ones that are. 4 As with methods in a programming language, this just means we re using the same name for different variables. 8
9 2.2 Algebraic Laws All of the algebraic laws from propositional logic apply to formulas in predicate logic, as well. In addition, we have rules for expanding/contracting the scope of a quantifier, plus versions of DeMorgan s Laws. DeMorgan s Laws Bound Variable Renaming Order of Variable Bindings Quantifiaction over Conjunction and Disjunction Non-Capture of Free Variables x.φ(x) x. φ(x) x.φ(x) x. φ(x) x.φ(x) y.[y/x]φ(x) = y.φ(y), y / F V (φ(x)) x.φ(x) y.[y/x]φ(x) = y.φ(y), y / F V (φ(x)) x. y.ψ(x, y) y. x.ψ(x, y) x. y.ψ(x, y) y. x.ψ(x, y) x.φ(x) x.ψ(x) x.(φ(x) ψ(x)) x.φ(x) x.ψ(x) x.(φ(x) ψ(x)) ψ x.φ(x) x.(ψ φ(x)), if x / F V (ψ) ψ x.φ(x) x.(ψ φ(x)), if x / F V (ψ) In the laws for bound variable renaming (often called α equivalence), we write [y/x]φ(x) to indicate the replacement of all free occurrences of x in φ(x) with y, provided that y does not already occur free in φ(x) Inference Rules All of the inference rules for propositional logic are valid in FOPL, as well. In addition, we have rules for the introduction and elimination of the universal ( ) and existential ( ) quantifiers: 5 The details of this obscure what is really a very simple intuition for any programmer: you can always change the name of a parameter in a function definition, so long as you do so consistently throughout the definition. 9
10 Introduction (Generalization) φ(u) [ I] x.φ(x) φ(u) [ I] x.φ(x) Elimination (Instantiation) x.φ(x) [ E] φ(u) x.φ(x) [ E] φ(u) Note that every application of E is actually a form of conditional proof, since the rule introduces an assumption for x.φ(x) in the form of a witness u, for which φ(u) is assumed to hold. This means that every application of E gives us an open assumption which should be closed when it is no longer needed. We ll adopt the convention here of reiterating the conclusion of an E assumption, immediately after closing the assumption (see Example 2.4.2). 2.4 Examples Existential and Universal Generalization ( I and I) 1 ( x.a(x)) ( y.b(y)) x.[a(x) y.b(y)] 2 u A(u) 3 x.a(x) I, 2 4 y.b(y) E, 1, 3 5 A(u) y.b(y) I, x.[a(x) y.b(y)] I,
11 2.4.2 Existential and Universal Instantiation ( E and E) 1 x.p (x) 2 x. y.[p (x) (Q(y) R(x, y))] 3 x.r(x, x) x.q(x) 4 u P (u) E, 1 5 y.[p (u) (Q(y) R(u, y))] E, 2 6 P (u) (Q(u) R(u, u)) E, 5 7 Q(u) R(u, u) E, 6, 4 8 x. R(x, x) R, 3 9 R(u, u) E, 8 10 Q(u) DS, 7, 9 11 x.q(x) I, x.q(x) R, Restrictions and Pitfalls The I and E rules require special care. In the I antecedent, u must be an arbitrary variable: it must not occur free in x.φ(x), and φ(u) must not follow from any open assumption containing u. This prevents invalid proofs that attempt to generalize from a variable that actually has specific assumptions. The restriction on free occurrences of u in an application of I, for example, prevents this proof that if anyone is wealthy then everyone is: 1 x.w (x) W (x) x. y.w (x) W (y) 2 u W (u) W (u) E, 1 3 y.w (u) W (y) I, 2 11
12 [wrong: the arbitrary u assumed at (2) cannot be free in (3)] 4 x. y.w (x) W (y) I, 3 The requirement that φ(u) cannot follow from an assumption containing u prevents certain kinds of misuse that arise from the interaction with E. For example, this proof that, since there are two things that are not equal, then nothing is equal to itself: 1 x. y. E(x, y) x. E(x, x) 2 u y. E(u, y) E, 1 3 v E(u, v) E, 1 4 y. E(u, y) I, 3 [wrong: E(u, v) (3) is part of the assumption containing v] 5 y. E(u, y) R, x. y. E(x, y) I, 3 [wrong: y. E(u, y) (5) derives from an assumption containing u] 7 x. y. E(x, y) R, u y. E(u, y) E, 7 9 E(u, u) E, 8 10 x. E(x, x) I, 9 [OK: An application of E is valid for u or any other variable.] 11 x. E(x, x) R, 7 10 Finally, in the witness that we assume in the E rule, u must be a new variable, which does not occur free in an earlier line of an open assumption. Among other mistakes, this prevents faulty derivations, in which we confuse the witness from two or more applications of the E rule. For example, we might attempt to prove that, because there is at least one dog and at least one cat, there is some animal that is both dog and cat: 12
13 1 ( x.d(x)) ( y.c(x)) x.(d(x) C(x)) 2 x.d(x) E, 1 3 u D(u) E, 2 4 x.c(x) E, 1 5 u C(u) E, 2 [wrong: u (Line 5) already occurs free in Line 3, which is open.] 6 D(u) C(u) I, 3, 5 7 x.(d(x) C(x)) I, 6 8 x.(d(x) C(x)) R, x.(d(x) C(x)) R,
Supplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
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 informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationFormal (Natural) Deduction for Predicate Calculus
Formal (Natural) Deduction for Predicate Calculus Lila Kari University of Waterloo Formal (Natural) Deduction for Predicate Calculus CS245, Logic and Computation 1 / 42 Formal deducibility for predicate
More informationLogic Part I: Classical Logic and Its Semantics
Logic Part I: Classical Logic and Its Semantics Max Schäfer Formosan Summer School on Logic, Language, and Computation 2007 July 2, 2007 1 / 51 Principles of Classical Logic classical logic seeks to model
More informationPredicate Logic - Introduction
Outline Motivation Predicate Logic - Introduction Predicates & Functions Quantifiers, Coming to Terms with Formulas Quantifier Scope & Bound Variables Free Variables & Sentences c 2001 M. Lawford 1 Motivation:
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
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 informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationAll psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates
Predicate Logic In what we ve discussed thus far, we haven t addressed other kinds of valid inferences: those involving quantification and predication. For example: All philosophers are wise Socrates is
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationIntelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.
Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015
More informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
More informationMAI0203 Lecture 7: Inference and Predicate Calculus
MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture
More informationFormal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures
Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,
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 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 informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
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 informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
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 informationPredicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
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 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 information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
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 information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationCS 2800: Logic and Computation Fall 2010 (Lecture 13)
CS 2800: Logic and Computation Fall 2010 (Lecture 13) 13 October 2010 1 An Introduction to First-order Logic In Propositional(Boolean) Logic, we used large portions of mathematical language, namely those
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 information06 From Propositional to Predicate Logic
Martin Henz February 19, 2014 Generated on Wednesday 19 th February, 2014, 09:48 1 Syntax of Predicate Logic 2 3 4 5 6 Need for Richer Language Predicates Variables Functions 1 Syntax of Predicate Logic
More informationPHIL 50 INTRODUCTION TO LOGIC 1 FREE AND BOUND VARIABLES MARCELLO DI BELLO STANFORD UNIVERSITY DERIVATIONS IN PREDICATE LOGIC WEEK #8
PHIL 50 INTRODUCTION TO LOGIC MARCELLO DI BELLO STANFORD UNIVERSITY DERIVATIONS IN PREDICATE LOGIC WEEK #8 1 FREE AND BOUND VARIABLES Before discussing the derivation rules for predicate logic, we should
More informationMathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy
Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No
More informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationPredicate Logic. Predicates. Math 173 February 9, 2010
Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables
More information4 Quantifiers and Quantified Arguments 4.1 Quantifiers
4 Quantifiers and Quantified Arguments 4.1 Quantifiers Recall from Chapter 3 the definition of a predicate as an assertion containing one or more variables such that, if the variables are replaced by objects
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationLogic As Algebra COMP1600 / COMP6260. Dirk Pattinson Australian National University. Semester 2, 2017
Logic As Algebra COMP1600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2017 Recap: And, Or, and Not x AND y x y x y 0 0 0 0 1 0 1 0 0 1 1 1 x OR y x y x y 0 0 0 0 1 1 1 0 1 1 1
More information1 Propositional Logic
1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are
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 informationProof strategies, or, a manual of logical style
Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting
More information1 Introduction to Predicate Resolution
1 Introduction to Predicate Resolution The resolution proof system for Predicate Logic operates, as in propositional case on sets of clauses and uses a resolution rule as the only rule of inference. The
More informationLogics - Introduction
Logics 1 Logics - Introduction So far we have seen a variety of operational formalisms based on some some notion of state and event/transition model the evolution of the system Now instead we will analyze
More informationIt rains now. (true) The followings are not propositions.
Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the
More informationClass 29 - November 3 Semantics for Predicate Logic
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationWhat is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.
Question 1. [10 marks] Part (a) [2 marks] What is the decimal (base 10) representation of the binary number 110101? Show your work and place your final answer in the box. 2 0 + 2 2 + 2 4 + 2 5 = 1 + 4
More informationLogical Structures in Natural Language: First order Logic (FoL)
Logical Structures in Natural Language: First order Logic (FoL) Raffaella Bernardi Università degli Studi di Trento e-mail: bernardi@disi.unitn.it Contents 1 How far can we go with PL?................................
More informationCSC165 Mathematical Expression and Reasoning for Computer Science
CSC165 Mathematical Expression and Reasoning for Computer Science Lisa Yan Department of Computer Science University of Toronto January 21, 2015 Lisa Yan (University of Toronto) Mathematical Expression
More informationPredicate Logic: Syntax
Predicate Logic: Syntax Alice Gao Lecture 12 Based on work by J. Buss, L. Kari, A. Lubiw, B. Bonakdarpour, D. Maftuleac, C. Roberts, R. Trefler, and P. Van Beek 1/31 Outline Syntax of Predicate Logic Learning
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationPHIL12A Section answers, 16 February 2011
PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationSYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES
SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES Singular Sentences name Paris is beautiful (monadic) predicate (monadic) predicate letter Bp individual constant Singular Sentences Bp These are our new simple
More informationPropositional natural deduction
Propositional natural deduction COMP2600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2016 Major proof techniques 1 / 25 Three major styles of proof in logic and mathematics Model
More informationPropositional Logic: Syntax
Logic 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 programs) epistemic
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
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 informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationPropositional and Predicate Logic
Propositional and Predicate Logic CS 536-05: Science of Programming This is for Section 5 Only: See Prof. Ren for Sections 1 4 A. Why Reviewing/overviewing logic is necessary because we ll be using it
More informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
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 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 informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationAutomated Reasoning Lecture 5: First-Order Logic
Automated Reasoning Lecture 5: First-Order Logic Jacques Fleuriot jdf@inf.ac.uk Recap Over the last three lectures, we have looked at: Propositional logic, semantics and proof systems Doing propositional
More information1 First-order logic. 1 Syntax of first-order logic. 2 Semantics of first-order logic. 3 First-order logic queries. 2 First-order query evaluation
Knowledge Bases and Databases Part 1: First-Order Queries Diego Calvanese Faculty of Computer Science Master of Science in Computer Science A.Y. 2007/2008 Overview of Part 1: First-order queries 1 First-order
More informationOverview of Logic and Computation: Notes
Overview of Logic and Computation: Notes John Slaney March 14, 2007 1 To begin at the beginning We study formal logic as a mathematical tool for reasoning and as a medium for knowledge representation The
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More information1 IPL and Heyting Prelattices
CHAPTER 11: FULL PROPOSITIONAL LOGICS 1 IPL and Heyting Prelattices By full PLs, we mean ones with the complete inventory of standard connectives: those of PIPL (,, T), as well as, F, and. In this section
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationPropositional and Predicate Logic
8/24: pp. 2, 3, 5, solved Propositional and Predicate Logic CS 536: Science of Programming, Spring 2018 A. Why Reviewing/overviewing logic is necessary because we ll be using it in the course. We ll be
More informationLIN1032 Formal Foundations for Linguistics
LIN1032 Formal Foundations for Lecture 5 Albert Gatt In this lecture We conclude our discussion of the logical connectives We begin our foray into predicate logic much more expressive than propositional
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationExamples: 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 informationDay 5. Friday May 25, 2012
Day 5 Friday May 5, 01 1 Quantifiers So far, we have done math with the expectation that atoms are always either true or false. In reality though, we would like to talk about atoms like x > Whose truth
More informationPropositional, First-Order And Higher-Order Logics: Basic Definitions, Rules of Inference, and Examples
Propositional, First-Order And Higher-Order Logics: Basic Definitions, Rules of Inference, and Examples Stuart C. Shapiro Department of Computer Science and Engineering University at Buffalo, The State
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More informationPredicate Calculus - Syntax
Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language
More informationSection 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.
Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency
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 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 informationSymbolising Quantified Arguments
Symbolising Quantified Arguments 1. (i) Symbolise the following argument, given the universe of discourse is U = set of all animals. Animals are either male or female. Not all Cats are male, Therefore,
More informationFirst Order Logic (1A) Young W. Lim 11/18/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationMATH 22 INFERENCE & QUANTIFICATION. Lecture F: 9/18/2003
MATH 22 Lecture F: 9/18/2003 INFERENCE & QUANTIFICATION Sixty men can do a piece of work sixty times as quickly as one man. One man can dig a post-hole in sixty seconds. Therefore, sixty men can dig a
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationAutomata 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