INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4
|
|
- Gervais Mason
- 6 years ago
- Views:
Transcription
1 INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4 Neil D. Jones DIKU 2005 Some slides today new, some based on logic 2004 (Nils Andersen), some based on kernebegreber (NJ 2005)
2 PREDICATE LOGIC: SYNTAX AND SEMANTICS Quick review of models versus proofs Models of propositional logic, completeness Formal syntax of predicate logic Informal predicate logic Formal syntax of predicate logic Models and environments Semantic entailment 1
3 THREE WORLDS, TWO VIEWS ON MODELING Engineering The real world model in the sense of science World of models, meanings model in the sense of logic World of logical formulas M = φ Left side: scientific experiments, measurements, what is out there? Purpose: analytic, to understand nature. Right side: specifications to define what is to be done! Purpose: synthetic, to construct systems. 2
4 MODEL THEORY VERSUS PROOF THEORY M = φ Model (or system) M satisfies statement φ (a formula) - This says something about how system M behaves - It is about validity or truth (Alfred Tarski, 1930s) Γ φ Model M satisfies formula φ - This says that formula φ can be proven from assumptions Γ (dates back to the ancient Greeks) - It is about a formal system, not about truth Amazingly, these two approaches are often equivalent: One can prove: true properties about systems by means of : formal manipulation of symbols This is the central point of this course. (in spite of what sometimes looks like pedantic symbol pushing.) 3
5 MODELING ( =) VERSUS PROVING ( ) A major theme is the equivalence of the two: Soundness: implies =: What can be is true. Completeness: = implies : What is true can be proven. Propositional logic: is equivalent to =, but nontrivial (in spite of the simplicity of truth tables). Reason: SAT is NP-hard. 4
6 PROPOSITIONAL LOGIC Judgements formed with propositional variables p, q, r, p 1,..., and operators: Negation φ, φ, φ Disjunction Classically exclusive (lat. aut... aut... ), now always inclusive (lat. vel... vel... ), φ v ψ, φ ψ, φ + ψ Conjunction φ & ψ, φ ψ, φψ, φ ψ Implication φ ψ, φ < ψ, φ ψ, φ ψ Absurdity, contradiction 0, F,, Λ, (bottom) Priorities: binds tighter than {, }, We don t decide on a priority between and.) Other logical operators: Exclusive disjunction +,. Equivalence =,,,. Tautology 1, T,, 5
7 THE BOOLEAN UNIVERSE OF MEANINGS, AND OPERATIONS The Boolean universe: Bool = {0, 1} = {F, T}. Truth tables that define the semantic operations,,, on boolean values. x x x y x y x y x y x y x y
8 INTERPRETATION OF BOOLEAN FORMULAS We distinguish carefully between a Boolean formula and a Boolean value A Boolean formula is a piece of syntax such as 0 (0 0), i.e., a string of symbols. The value of this formula is the Boolean value 0, the same as the value of another formula 1 (0 1). If no variables, we write [[φ]] to denote the value of φ, one of the two elements of Bool. Using the rules just given, for instance, we would expect: [[0 (0 0)]] = 0 7
9 HOW TO EVALUATE A PROPOSITIONAL FORMULAS WITH VARIABLES? It seems natural, for example, that P P should evaluate to 1, and that P P should evaluate to 0, even if P is a Boolean variable. But what about formula P Q? Answer: it depends on the values that variables P and Q currently have. An interpretation of propositional formula φ is a function I : BooleanVariable Bool that assigns a value in Bool to every propositional variable in φ. In the book I is also called an environment or a look-up table. 8
10 EVALUATION OF PROPOSITIONAL FORMULAS. [[φ]] I this is defined in the natural way, using the interpretation l to find the values of propositional variables: [[T ]] I = 1 [[F ]] I = 0 [[P ]] I = I(P ) for any propositional variable P [[ φ]] I = ([[φ]] I ) [[φ 1 φ 2 ]] I [[φ 1 φ 2 ]] I = [[φ 1 ]] I [[φ 2 ]] I = [[φ 1 ]] I [[φ 2 ]] I [[φ 1 φ 2 ]] I Remarks. = [[φ 1 ]] I [[φ 2 ]] I This definition uses syntactic operations to the left, inside [[ ]]. On the right sides are their semantic counterparts. Thus the to the left of the = is a symbol appearing in Boolean formulas, and the to the right of the = is a function on Boolean values. 9
11 SATISFIABILITY, TAUTOLOGY, SEMANTIC ENTAILMENT Propositional φ is satisfiable if [[φ]] I = 1 for some interpretation I for φ: φ = (A B) (B C) ( A C) is satisfiable by interpretation (truth assignment) I = [A 0, B 0, C 1] φ is a tautology if [[φ]] I = 1 for all interpretations I: A A (A B) A B (A B) A B A (B C) (A B) (A C) We say φ 1,..., φ n semantically entail ψ, written φ 1,..., φ n = ψ if φ 1,..., φ n evaluate to 1 implies ψ evaluates to 1 for all interpretations I, i.e.: [[φ 1 φ 2... φ n ]] I = 1 implies [[φ 1 φ 2... φ n ]] I = 1 10
12 NEED FOR A MORE EXPRESSIVE LOGICAL LANGUAGE Not natural in simple propositional logic:not all birds can fly, x(b(x) F (x)) or perhaps x(b(x) F (x)) Andy and Paul have the same maternal grandmother (Da.: mormor), v w(a(v) P (w) x y z(m(z, x) M(z, y) M(x, v) M(y, w))). Ann likes Mary s brother: Do we mean or perhaps x y z(a(x) M(y) B(z, y) L(x, z)) x y z(a(x) M(y) B(z, y) L(x, z)) Function f (from one topological space to another one) is continuous in the point x... 11
13 NEW FEATURES IN PREDICATE LOGIC Individual variables: x, y, z,... may be considered to vary over one (or more) universes. (Letters in the propositional calculus denoted fixed statements, like it rains, taxis are available at the station, etc.) Predicate symbols: B( ), M(, ), etc. denote fixed relations is a bird, is mother of. Quantifiers: For all x ( x) and there exists an x ( x) bind the individual variable x. Limits to first order predicate logic: No quantifiers over predicates no predicates applied to predicates x y(s(y, x) P (P (x)...)) P (Q, x)... 12
14 A FAMILIAR EXAMPLE Beginning analysis texts usually define a function f : R R on the real numbers to be continuous iff it satisfies ε > 0( δ > 0( x y ( x y < δ f(x) f(y) < ε))) This could be expressed in our notation as where ε(p (ε) δ(p (δ) x y(l(a(x, y), δ) L(a(f(x), f(y)), ε)))) predicate name P : P (z) stands for z > 0, and function symbol: a(x, y) stands for x y, and predicate name L: L(r, s) stands for r < s. How can we make the phrase stands for more precise? 13
15 VARIANTS Quantifiers over several universes: (not studied!) may be expressed IR+ ε IN0 N IN0 n(n N a a n ε) ε(real(ε) ε > 0 N(Nat(N) n(nat(n) (n N a a n ε)))) Equality: A special predicate Equal(x, y), usually written with infix notation: x = y. (Reflexive, symmetric, transitive, substitutive.) Constants and function symbols: Could be eliminated, but are nice to have: mother(mother(andy)) = mother(mother(paul)) or z(b(z, mary) L(ann, z)) Constants can be considered functions of arity 0 (taking 0 arguments), but we write them without the parentheses: mary, rather than mary(). 14
16 There are two syntactic sorts: SYNTAX OF PREDICATE LOGIC formulas φ or ψ: denote true or false, i.e., 1 or 0; and terms t: denote values. Each predicate name P or function symbol f is pre-assigned an arity, a natural number n. φ, ψ ::= φ φ 1 φ 2 φ 1 φ 2 φ 1 φ 2 x φ x φ universal and existential quantifiers P (t 1,..., t n ) where n =arity(p ) t ::= x f(t 1,..., t n ) where n =arity(f) x ::= (individual) variable There are no propositional variables P ::= predicate symbol (including = with arity 2) f ::= function symbol (each has arity n 0) 15
17 PRIORITIES, FREE AND BOUND VARIABLES Priorities. has lowest priority,, have same priority, has highest priority. Free and bound variables. Each occurrence of a variable is either free or bound in a (sub)formula. An occurrence of x is bound by the smallest xϕ or xϕ where the ϕ contains this occurrence of x; unbound occurrences are free. In xϕ, ϕ, with the exception of any inner subformulas of form xψ or xψ, is said to be the scope of this x. The scope of an occurrence of x is defined similarly. Close analogy: scopes of declared variables in a programming language. Statement: a formula with no free variables. 16
18 MODEL (More complex than for the propositional calculus.) A first order language is specified by a pair (F, P) of function symbols F (we include constants as arity 0 function symbols) and predicate symbols P, each with a specified arity. A model M for such a pair has 1. A non-empty carrier or universe of values A 2. For each f F of arity m a concrete function f M : A m A (for a constant c a concrete value c M A) 3. For each P P of arity n a relation P M A n. 4. Constraint: If P is the equality symbol, then = M we will require to be the identity relation on A. = M = {(a, a) a A} 17
19 A SILLY EXAMPLE: LOLA S LOVERS Predicates: one 2-ary L ( loves ) Constants: one 0-ary lola (a function symbol ) A statement: φ x (L(lola, x) L(x, lola)) Anyone Lola loves, loves Lola A model M of φcould have 1. Universe A M = {lola, john, harry} 2. Constant lola M = lola (in the flesh!) 3. Loves relation interpretation: L M = {(lola, lola), (lola, john), (john, lola), (harry, john)} A non-model M of φ has same Universe and Constant, but L interpreted: L M = {(lola, lola), (lola, john), (lola, harry), (john, lola), (harry, john)} 18
20 An environment l for the model interprets variables ENVIRONMENT M = (A, (f M ) f F, (P M ) P P ) l : var A Term evaluation. Presented with a model M for (F, P) and an environment l for M we may interpret any term over (F, P): [[x]] M l = l(x) [[c]] M l = c M [[f(t 1,..., t m )]] M l = f M ([[t 1 ]] M l,..., [[t m]] M l ) 19
21 SATISFACTION IN AN ENVIRONMENT ϕ is satisfied in M with respect to l, written M = l ϕ is defined by M = l ϕ ψ if and only if M = l ψ whenever M = l ϕ M = l ϕ ψ if and only if M = l ϕ and M = l ψ M = l ϕ ψ if and only if M = l ϕ or M = l ψ M = l ϕ if and only if M = l ϕ does not hold M = l xϕ M = l xϕ if and only if M = l[x a] ϕ holds for all a A if and only if M = l[x a] ϕ holds for some a A M = l P (t 1,..., t n ) if and only if { ([[t 1 ]] M l,..., [[t n]] M l ) P M l[x a](y) = a if y = x l(y) otherwise M = l ϕ means: M = l ϕ does not hold We write just I = φ in case φ is closed, since the value of l plays no role. 20
22 SEMANTIC ENTAILMENT If l and l only differ outside of the free variables of ϕ, then M = l ϕ if and only if M = l ϕ. For statements the environment is irrelevant and may be omitted: M = ϕ. For n IN 0 and formulas ϕ 1,..., ϕ n, ψ over some (F, P) the relation ϕ 1,..., ϕ n = ψ is defined by: For all models M for (F, P) and all environments l for M we have M = l ψ whenever M = l ϕ 1,..., M = l ϕ n all hold. Some authors use the terminology that in this case ψ is a (semantic) consequence of ϕ 1,..., ϕ n. 21
23 A model MODEL CHECKING: THE FINITE CASE M = (A, (f M ) f F, (P M ) P P ) for (F, P) where A, F and P are all finite, can be represented finitely, via, e.g., a table of m + 1-tuples for each function symbol of arity m and a table of n-tuples for each predicate symbol of arity n. Consequently, the term evaluation function [[t]] M l is computable by a simple recursive algorithm. (We may assume l finite, only dealing with the variables of t.) Similarly, the satisfaction relation M = l ϕ is algorithmically decidable. 22
24 SUPPLEMENTARY EXERCISES Assume F = {f}, P = {P }, where f and P are both binary, and model M = (A, {f M }, {P M }), where A has n elements. 1. How much memory is required to represent M? 2. Outline an algorithm to compute [[t]] M l. 3. Outline an algorithm to decide M = l ϕ. Argue that it terminates. 4. Find an upper bound on the time the algorithm takes to decide M = xp (x, x). Find an upper bound on the time the algorithm takes to decide M = x yp (x, y). 5. Find an upper bound on the time the algorithm takes to decide M = ϕ where ϕ is a sentence with q quantifiers. 23
06 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 informationPROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2
PROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 12 September, 2005 Some slides today new, some based on logic 2004 (Nils
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 informationA Logic Primer. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2015 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley. Stavros Tripakis (UC Berkeley) EE 144/244, Fall 2014 A Logic Primer 1 / 35
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationPredicate Calculus. CS 270 Math Foundations of Computer Science Jeremy Johnson
Predicate Calculus CS 270 Math Foundations of Computer Science Jeremy Johnson Presentation uses material from Huth and Ryan, Logic in Computer Science: Modelling and Reasoning about Systems, 2nd Edition
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 informationPREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today s class will be an introduction
More information15414/614 Optional Lecture 3: Predicate Logic
15414/614 Optional Lecture 3: Predicate Logic Anvesh Komuravelli 1 Why Predicate Logic? Consider the following statements. 1. Every student is younger than some instructor. 2. Not all birds can fly. Propositional
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 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 informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2008/09
More informationPropositional and Predicate Logic - II
Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic
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 informationTHE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)
THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16) FOL: A language to formulate knowledge Logic is the study of entailment relationslanguages, truth conditions and rules of inference. FOL or Predicate
More informationIntroduction to first-order logic:
Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September
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 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 informationCSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Propositional Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Propositions A proposition is a declarative sentence that is either true or false
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2009/2010 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2009/10
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 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 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 informationGS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen Anthony Hall
GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen www.cs.ucl.ac.uk/staff/j.bowen/gs03 Anthony Hall GS03 W1 L3 Predicate Logic 12 January 2007 1 Overview The need for extra structure
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 informationLogic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies
Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions 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 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 informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
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 informationStanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014
Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014 Notes for Lecture 9 Mathematical logic is the rigorous study of the way in which we prove the validity of mathematical
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationLogic. Readings: Coppock and Champollion textbook draft, Ch
Logic Readings: Coppock and Champollion textbook draft, Ch. 3.1 3 1. Propositional logic Propositional logic (a.k.a propositional calculus) is concerned with complex propositions built from simple propositions
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
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 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 informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
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 informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
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 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 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 informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
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 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 informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationLecture 1: Logical Foundations
Lecture 1: Logical Foundations Zak Kincaid January 13, 2016 Logics have two components: syntax and semantics Syntax: defines the well-formed phrases of the language. given by a formal grammar. Typically
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 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 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 information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationPROPOSITIONAL LOGIC. VL Logik: WS 2018/19
PROPOSITIONAL LOGIC VL Logik: WS 2018/19 (Version 2018.2) Martina Seidl (martina.seidl@jku.at), Armin Biere (biere@jku.at) Institut für Formale Modelle und Verifikation BOX Game: Rules 1. The game board
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 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 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 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 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 informationFirst-Order Logic. Chapter Overview Syntax
Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts
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 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 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 informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationIntroduction to Theoretical Computer Science
Introduction to Theoretical Computer Science Zdeněk Sawa Department of Computer Science, FEI, Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba 708 33 Czech republic February 11, 2018 Z.
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationPredicate Logic: Sematics Part 1
Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationLecture 11: Measuring the Complexity of Proofs
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July
More informationLogical Structures in Natural Language: Propositional Logic II (Truth Tables and Reasoning
Logical Structures in Natural Language: Propositional Logic II (Truth Tables and Reasoning Raffaella Bernardi Università degli Studi di Trento e-mail: bernardi@disi.unitn.it Contents 1 What we have said
More informationReasoning with Quantified Boolean Formulas
Reasoning with Quantified Boolean Formulas Martina Seidl Institute for Formal Models and Verification Johannes Kepler University Linz 1 What are QBF? Quantified Boolean formulas (QBF) are formulas of propositional
More informationif t 1,...,t k Terms and P k is a k-ary predicate, then P k (t 1,...,t k ) Formulas (atomic formulas)
FOL Query Evaluation Giuseppe De Giacomo Università di Roma La Sapienza Corso di Seminari di Ingegneria del Software: Data and Service Integration Laurea Specialistica in Ingegneria Informatica Università
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 informationSupplementary exercises in propositional logic
Supplementary exercises in propositional logic The purpose of these exercises is to train your ability to manipulate and analyze logical formulas. Familiarize yourself with chapter 7.3-7.5 in the course
More informationExample. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
More informationNotes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )
Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the
More informationThe non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω
1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the
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 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 informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationPř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 informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationA brief introduction to Logic. (slides from
A brief introduction to Logic (slides from http://www.decision-procedures.org/) 1 A Brief Introduction to Logic - Outline Propositional Logic :Syntax Propositional Logic :Semantics Satisfiability and validity
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 informationFirst Order Logic (FOL)
First Order Logic (FOL) Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel based on slides by Prof. Ruzica Piskac, Nikolaj Bjorner, and others References Chpater 2 of Logic for
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
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 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 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 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 informationOutline. Formale Methoden der Informatik First-Order Logic for Forgetters. Why PL1? Why PL1? Cont d. Motivation
Outline Formale Methoden der Informatik First-Order Logic for Forgetters Uwe Egly Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Motivation Syntax of PL1
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 information