DOCSLIB.ORG

Propositional Logic Propositional Logic: Contents

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Propositional Logic Propositional Logic: Contents Propositional Logic Propositional Logic: Contents • Syntax and Semantics of Propositional Logic • Satisfiability (SAT) • Tableau Algorithm for SAT • Structural induction • Semantic consequence and logical equivalence • Conjunctive and disjunctive normal form (CNF and DNF) Logic in Computer Science 2 Formulas of propositional Logic The alphabet of propositional logic consists of • an infinite set p1; p2;::: of atomic formulas; • the logical connectives: – : (‘not’), called negation; – ^ (‘and’), called conjunction; – _ (‘or’), called disjunction; • brackets: ( and ). Remarks: • atomic formulas are also called propositional variables; • we use letters p; q; r and indexed letters q1; q2;::: to denote atomic for- mulas. Logic in Computer Science 3 Formulas of propositional logic The set P of all formulas of propositional logic is defined inductively: • all atomic formulas are formulas; • if P is a formula, then :P is a formula; • if P and Q are formulas, then (P ^ Q) is a formula; • if P and Q are formulas, then (P _ Q) is a formula; • Nothing else is a formula. Remarks: • So, formulas are just strings over a certain alphabet without truth values or meaning. • We use P , Q, R and indexed letters such as P1;P2;:::;Q1;Q2;::: to de- note formulas of propositional logic. Logic in Computer Science 4 Truth Values An interpretation I is a function which assigns to any atomic formula pi a truth value I(pi) 2 f0; 1g: • If I(pi) = 1, then pi is called true under the interpretation I. • If I(pi) = 0, then pi is called false under the interpretation I. Given an assignment I we can compute the truth value of compound formulas step by step using so-called truth tables. Logic in Computer Science 5 Truth tables: negation The negation :P of a formula P is true when P is false and false otherwise: Definition Suppose an interpretation I is given and we know the value I(P ). Then the value I(:P ) is computed by 0 if I(P ) = 1 I(:P ) = 1 if I(P ) = 0 Corresponding truth table: P :P 1 0 0 1 Logic in Computer Science 6 Truth tables: conjunction The conjunction (P ^ Q) is true if and only if both P and Q are true. Definition Suppose an interpretation I is given and we know I(P ) and I(Q). Then 1 if I(P ) = 1 and I(Q) = 1 I(P ^ Q) = 0 if I(P ) = 0 or I(Q) = 0 Corresponding truth table: P Q (P ^ Q) 1 1 1 1 0 0 0 1 0 0 0 0 Logic in Computer Science 7 Truth tables: disjunction The disjunction (P _ Q) is true if and only if P is true or Q is true. Definition Suppose an interpretation I is given and we know I(P ) and I(Q). Then 1 if I(P ) = 1 or I(Q) = 1 I(P _ Q) = 0 if I(P ) = 0 and I(Q) = 0 Corresponding truth table: P Q (P _ Q) 1 1 1 1 0 1 0 1 1 0 0 0 Logic in Computer Science 8 Truth under an interpretation So, given an interpretation I, we can compute the truth value I(P ) of any formula P under I. • If I(P ) = 1, then P is called true under the interpretation I. • If I(P ) = 0, then P is called false under the interpretation I. Logic in Computer Science 9 Example List the Interpretations I such that P = ((p1 _:p2) ^ p3) is true under I. p1 p2 p3 :p2 (p1 _:p2) P 1 1 1 0 1 1 1 1 0 0 1 0 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 1 1 1 0 0 0 1 1 0 P is true under I1;I2, and I3, where • I1(p1) = I1(p2) = I1(p3) = 1, • I2(p1) = I2(p3) = 1 and I2(p2) = 0, • I3(p1) = I3(p2) = 0 and I3(p3) = 1. Logic in Computer Science 10 Truth table for (:P _ Q) P Q :P (:P _ Q) 1 1 0 1 1 0 0 0 0 1 1 1 0 0 1 1 (:P _ Q) represents the assertion ‘if P is true, then Q is true’. Define a ‘new’ connective ! by: (P ! Q) = (:P _ Q): In what follows we use (P ! Q) as an abbreviation for (:P _ Q). Logic in Computer Science 11 Truth table for ((P ! Q) ^ (Q ! P )) P Q (P ! Q) (Q ! P ) ((P ! Q) ^ (Q ! P )) 1 1 1 1 1 1 0 0 1 0 0 1 1 0 0 0 0 1 1 1 ((P ! Q) ^ (Q ! P )) represents the assertion ‘P is true if and only if Q is true’. Define a ‘new’ connective $ by: (P $ Q) := ((P ! Q) ^ (Q ! P )): In what follows we use (P $ Q) as an abbreviation for ((P ! Q) ^ (Q ! P )). Logic in Computer Science 12 Satisfiability Definition A formula P is satisfiable if and only if there exists an interpretation I such that I(P ) = 1. Examples • Every atomic formula p is satisfiable: given p, take the interpretation I with I(p) = 1. • :p is satisfiable: take the interpretation I with I(p) = 0. Then I(:p) = 1. • (p ^ :p) is not satisfiable: for any interpretation I, I(p ^ :p) = 0. • (p ^ :q) is satisfiable: take the interpretation I with I(p) = 1 and I(q) = 0. Logic in Computer Science 13 Satisfiability and Puzzles (1) Isaac and Albert were excitedly describing the result of the Third Annual Inter- national Science Fair Extravaganza in Sweden. There were three contestants, Louis, Rene, and Johannes. Isaac reported that Louis won the fair, while Rene came in second. Albert, on the other hand, reported that Johannes won the fair, while Louis came in second. In fact, neither Isaac nor Albert had given a correct report of the results of the science fair. Each of them had given one true statement and one false statement. What was the actual placing of the three contestants? (Credits: based on slides by Andrei Voronkov) Logic in Computer Science 14 Encoding into SAT We take atomic formulas L1;L2;L3;R1;R2;R3;J1;J2;J3 with the intuitive meaning: • L1: Louis came in first, L2: Louis came in second, L3: Louis came in third. • R1: Rene came in first, R2: Rene came in second, R3: Rene came in third. • J1: Johannes came in first, J2: Johannes came in second, J3: Johannes came in third. We represent the information about Isaac’s report using the formula J: • J = ((L1 ^ :R2) _ (:L1 ^ R2)) We represent the information about Albert’s report using the formula A: • A = ((J1 ^ :L2) _ (:J1 ^ L2)) Logic in Computer Science 15 Encoding into SAT We have to encode additional information. Namely, • everybody comes in at exactly one place: represent this using (P1 ^ P2), where P1 = ((L1 _ L2 _ L3) ^ (R1 _ R2 _ R3) ^ (J1 _ J2 _ J3)) and P2 = (:(L1 ^ L2) ^ :(L1 ^ L3) ^ :(L2 ^ L3) ^ :(R1 ^ R2) ··· ) • Only one person can come in first, etc: represent this using Q, where Q = (:(L1 ^ R1) ^ :(L2 ^ R2) ^ :(L3 ^ R3) ^ (R1 ^ J1) ··· ) Any interpretation I with I(J ^ A ^ P1 ^ P2 ^ Q) = 1 corresponds to a possible placing of the three contestants. Logic in Computer Science 16 Note on Conjunctions and Disjunctions On the previous slide, we have used formulas (P1 ^ · · · ^ Pn) and (P1 _···_ Pn) which we have not defined yet. Note that according to the syntax of proposi- tional formulas we use brackets whenever we form the conjunction/disjunction of two formulas. (P1 ^ · · · ^ Pn) is defined by induction over n as follows: • (P1) = P1; • (P1 ^ · · · ^ Pn+1) = ((P1 ^ · · · ^ Pn) ^ Pn+1); (P1 _···_ Pn) is defined by induction over n as follows: • (P1) = P1; • (P1 _···_ Pn+1) = ((P1 _···_ Pn) _ Pn+1); Logic in Computer Science 17 Checking Satisfiability (SAT) We want an algorithm that checks whether a given propositional formula is satisfiable. In other words, for a given P , we search for an interpretation I such that I(P ) = 1. If this search is successful, then the output of the algorithm should be • “yes, P is satisfiable”. If no such interpretation can be found, then the output of the algorithm should be • “no, P is not satisfiable”. Logic in Computer Science 18 SAT applications SAT has numerous applications in computer and information science. Here are some: • Circuit design: e.g., when are two circuits equivalent? • Model checking: does a program represented as a graph structure satisfy its specification? • Planning in artificial intelligence; • Haplotyping in bioinformatics: derive haplotype data from genotype data. Logic in Computer Science 19 Satisfiability checking based on Truth Tables Here is an algorithm checking satisfiability that is directly based on truth tables: 1. Let P be the input formula; 2. Using truth tables, compute the value I(P ) for all interpretations I; 3. if an I is found such that I(P ) = 1, then output “P is satisfiable”; 4. If no such I is found, output “P is not satisfiable”. If P is not satisfiable, then this algorithms requires the computation of I(P ) for 2n many interpretations I, where n is the number of atomic formulas in P . Thus the running time of this algorithm is exponential. Major open problem in computer science: does there exist an algorithm check- ing satisfiability that runs in polynomial time? This problem is also known as the P=NP problem. Logic in Computer Science 20 Tableau Method Intuition: to check satisfiability of P , we apply tableau rules to P that make explicit the constraints that P imposes on formulas occuring in P (subformulas).
Load more

Recommended publications
  • Propositional Logic, Modal Logic, Propo- Sitional Dynamic Logic and first-Order Logic
    A I L Madhavan Mukund Chennai Mathematical Institute E-mail: [email protected] Abstract ese are lecture notes for an introductory course on logic aimed at graduate students in Com- puter Science. e notes cover techniques and results from propositional logic, modal logic, propo- sitional dynamic logic and first-order logic. e notes are based on a course taught to first year PhD students at SPIC Mathematical Institute, Madras, during August–December, . Contents Propositional Logic . Syntax . . Semantics . . Axiomatisations . . Maximal Consistent Sets and Completeness . . Compactness and Strong Completeness . Modal Logic . Syntax . . Semantics . . Correspondence eory . . Axiomatising valid formulas . . Bisimulations and expressiveness . . Decidability: Filtrations and the finite model property . . Labelled transition systems and multi-modal logic . Dynamic Logic . Syntax . . Semantics . . Axiomatising valid formulas . First-Order Logic . Syntax . . Semantics . . Formalisations in first-order logic . . Satisfiability: Henkin’s reduction to propositional logic . . Compactness and the L¨owenheim-Skolem eorem . . A Complete Axiomatisation . . Variants of the L¨owenheim-Skolem eorem . . Elementary Classes . . Elementarily Equivalent Structures . . An Algebraic Characterisation of Elementary Equivalence . . Decidability . Propositional Logic . Syntax P = f g We begin with a countably infinite set of atomic propositions p0, p1,... and two logical con- nectives : (read as not) and _ (read as or). e set Φ of formulas of propositional logic is the smallest set satisfying the following conditions: • Every atomic proposition p is a member of Φ. • If α is a member of Φ, so is (:α). • If α and β are members of Φ, so is (α _ β). We shall normally omit parentheses unless we need to explicitly clarify the structure of a formula.
    [Show full text]
  • On Basic Probability Logic Inequalities †
    mathematics Article On Basic Probability Logic Inequalities † Marija Boriˇci´cJoksimovi´c Faculty of Organizational Sciences, University of Belgrade, Jove Ili´ca154, 11000 Belgrade, Serbia; [email protected] † The conclusions given in this paper were partially presented at the European Summer Meetings of the Association for Symbolic Logic, Logic Colloquium 2012, held in Manchester on 12–18 July 2012. Abstract: We give some simple examples of applying some of the well-known elementary probability theory inequalities and properties in the field of logical argumentation. A probabilistic version of the hypothetical syllogism inference rule is as follows: if propositions A, B, C, A ! B, and B ! C have probabilities a, b, c, r, and s, respectively, then for probability p of A ! C, we have f (a, b, c, r, s) ≤ p ≤ g(a, b, c, r, s), for some functions f and g of given parameters. In this paper, after a short overview of known rules related to conjunction and disjunction, we proposed some probabilized forms of the hypothetical syllogism inference rule, with the best possible bounds for the probability of conclusion, covering simultaneously the probabilistic versions of both modus ponens and modus tollens rules, as already considered by Suppes, Hailperin, and Wagner. Keywords: inequality; probability logic; inference rule MSC: 03B48; 03B05; 60E15; 26D20; 60A05 1. Introduction The main part of probabilization of logical inference rules is defining the correspond- Citation: Boriˇci´cJoksimovi´c,M. On ing best possible bounds for probabilities of propositions. Some of them, connected with Basic Probability Logic Inequalities. conjunction and disjunction, can be obtained immediately from the well-known Boole’s Mathematics 2021, 9, 1409.
    [Show full text]
  • Propositional Logic - Basics
    Outline Propositional Logic - Basics K. Subramani1 1Lane Department of Computer Science and Electrical Engineering West Virginia University 14 January and 16 January, 2013 Subramani Propositonal Logic Outline Outline 1 Statements, Symbolic Representations and Semantics Boolean Connectives and Semantics Subramani Propositonal Logic (i) The Law! (ii) Mathematics. (iii) Computer Science. Definition Statement (or Atomic Proposition) - A sentence that is either true or false. Example (i) The board is black. (ii) Are you John? (iii) The moon is made of green cheese. (iv) This statement is false. (Paradox). Statements, Symbolic Representations and Semantics Boolean Connectives and Semantics Motivation Why Logic? Subramani Propositonal Logic (ii) Mathematics. (iii) Computer Science. Definition Statement (or Atomic Proposition) - A sentence that is either true or false. Example (i) The board is black. (ii) Are you John? (iii) The moon is made of green cheese. (iv) This statement is false. (Paradox). Statements, Symbolic Representations and Semantics Boolean Connectives and Semantics Motivation Why Logic? (i) The Law! Subramani Propositonal Logic (iii) Computer Science. Definition Statement (or Atomic Proposition) - A sentence that is either true or false. Example (i) The board is black. (ii) Are you John? (iii) The moon is made of green cheese. (iv) This statement is false. (Paradox). Statements, Symbolic Representations and Semantics Boolean Connectives and Semantics Motivation Why Logic? (i) The Law! (ii) Mathematics. Subramani Propositonal Logic (iii) Computer Science. Definition Statement (or Atomic Proposition) - A sentence that is either true or false. Example (i) The board is black. (ii) Are you John? (iii) The moon is made of green cheese. (iv) This statement is false.
    [Show full text]
  • Logic in Computer Science
    P. Madhusudan Logic in Computer Science Rough course notes November 5, 2020 Draft. Copyright P. Madhusudan Contents 1 Logic over Structures: A Single Known Structure, Classes of Structures, and All Structures ................................... 1 1.1 Logic on a Fixed Known Structure . .1 1.2 Logic on a Fixed Class of Structures . .3 1.3 Logic on All Structures . .5 1.4 Logics over structures: Theories and Questions . .7 2 Propositional Logic ............................................. 11 2.1 Propositional Logic . 11 2.1.1 Syntax . 11 2.1.2 What does the above mean with ::=, etc? . 11 2.2 Some definitions and theorems . 14 2.3 Compactness Theorem . 15 2.4 Resolution . 18 3 Quantifier Elimination and Decidability .......................... 23 3.1 Quantifiier Elimination . 23 3.2 Dense Linear Orders without Endpoints . 24 3.3 Quantifier Elimination for rationals with addition: ¹Q, 0, 1, ¸, −, <, =º ......................................... 27 3.4 The Theory of Reals with Addition . 30 3.4.1 Aside: Axiomatizations . 30 3.4.2 Other theories that admit quantifier elimination . 31 4 Validity of FOL is undecidable and is r.e.-hard .................... 33 4.1 Validity of FOL is r.e.-hard . 34 4.2 Trakhtenbrot’s theorem: Validity of FOL over finite models is undecidable, and co-r.e. hard . 39 5 Quantifier-free theory of equality ................................ 43 5.1 Decidability using Bounded Models . 43 v vi Contents 5.2 An Algorithm for Conjunctive Formulas . 44 5.2.1 Computing ¹º ................................... 47 5.3 Axioms for The Theory of Equality . 49 6 Completeness Theorem: FO Validity is r.e. ........................ 53 6.1 Prenex Normal Form .
    [Show full text]
  • CS245 Logic and Computation
    CS245 Logic and Computation Alice Gao December 9, 2019 Contents 1 Propositional Logic 3 1.1 Translations .................................... 3 1.2 Structural Induction ............................... 8 1.2.1 A template for structural induction on well-formed propositional for- mulas ................................... 8 1.3 The Semantics of an Implication ........................ 12 1.4 Tautology, Contradiction, and Satisfiable but Not a Tautology ........ 13 1.5 Logical Equivalence ................................ 14 1.6 Analyzing Conditional Code ........................... 16 1.7 Circuit Design ................................... 17 1.8 Tautological Consequence ............................ 18 1.9 Formal Deduction ................................. 21 1.9.1 Rules of Formal Deduction ........................ 21 1.9.2 Format of a Formal Deduction Proof .................. 23 1.9.3 Strategies for writing a formal deduction proof ............ 23 1.9.4 And elimination and introduction .................... 25 1.9.5 Implication introduction and elimination ................ 26 1.9.6 Or introduction and elimination ..................... 28 1.9.7 Negation introduction and elimination ................. 30 1.9.8 Putting them together! .......................... 33 1.9.9 Putting them together: Additional exercises .............. 37 1.9.10 Other problems .............................. 38 1.10 Soundness and Completeness of Formal Deduction ............... 39 1.10.1 The soundness of inference rules ..................... 39 1.10.2 Soundness and Completeness
    [Show full text]
  • Lecture 1: Propositional Logic
    Lecture 1: Propositional Logic Syntax Semantics Truth tables Implications and Equivalences Valid and Invalid arguments Normal forms Davis-Putnam Algorithm 1 Atomic propositions and logical connectives An atomic proposition is a statement or assertion that must be true or false. Examples of atomic propositions are: “5 is a prime” and “program terminates”. Propositional formulas are constructed from atomic propositions by using logical connectives. Connectives false true not and or conditional (implies) biconditional (equivalent) A typical propositional formula is The truth value of a propositional formula can be calculated from the truth values of the atomic propositions it contains. 2 Well-formed propositional formulas The well-formed formulas of propositional logic are obtained by using the construction rules below: An atomic proposition is a well-formed formula. If is a well-formed formula, then so is . If and are well-formed formulas, then so are , , , and . If is a well-formed formula, then so is . Alternatively, can use Backus-Naur Form (BNF) : formula ::= Atomic Proposition formula formula formula formula formula formula formula formula formula formula 3 Truth functions The truth of a propositional formula is a function of the truth values of the atomic propositions it contains. A truth assignment is a mapping that associates a truth value with each of the atomic propositions . Let be a truth assignment for . If we identify with false and with true, we can easily determine the truth value of under . The other logical connectives can be handled in a similar manner. Truth functions are sometimes called Boolean functions. 4 Truth tables for basic logical connectives A truth table shows whether a propositional formula is true or false for each possible truth assignment.
    [Show full text]
  • The Peripatetic Program in Categorical Logic: Leibniz on Propositional Terms
    THE REVIEW OF SYMBOLIC LOGIC, Page 1 of 65 THE PERIPATETIC PROGRAM IN CATEGORICAL LOGIC: LEIBNIZ ON PROPOSITIONAL TERMS MARKO MALINK Department of Philosophy, New York University and ANUBAV VASUDEVAN Department of Philosophy, University of Chicago Abstract. Greek antiquity saw the development of two distinct systems of logic: Aristotle’s theory of the categorical syllogism and the Stoic theory of the hypothetical syllogism. Some ancient logicians argued that hypothetical syllogistic is more fundamental than categorical syllogistic on the grounds that the latter relies on modes of propositional reasoning such as reductio ad absurdum. Peripatetic logicians, by contrast, sought to establish the priority of categorical over hypothetical syllogistic by reducing various modes of propositional reasoning to categorical form. In the 17th century, this Peripatetic program of reducing hypothetical to categorical logic was championed by Gottfried Wilhelm Leibniz. In an essay titled Specimina calculi rationalis, Leibniz develops a theory of propositional terms that allows him to derive the rule of reductio ad absurdum in a purely categor- ical calculus in which every proposition is of the form AisB. We reconstruct Leibniz’s categorical calculus and show that it is strong enough to establish not only the rule of reductio ad absurdum,but all the laws of classical propositional logic. Moreover, we show that the propositional logic generated by the nonmonotonic variant of Leibniz’s categorical calculus is a natural system of relevance logic ¬ known as RMI→ . From its beginnings in antiquity up until the late 19th century, the study of formal logic was shaped by two distinct approaches to the subject. The first approach was primarily concerned with simple propositions expressing predicative relations between terms.
    [Show full text]
  • Propositional Calculus
    CSC 438F/2404F Notes Winter, 2014 S. Cook REFERENCES The first two references have especially influenced these notes and are cited from time to time: [Buss] Samuel Buss: Chapter I: An introduction to proof theory, in Handbook of Proof Theory, Samuel Buss Ed., Elsevier, 1998, pp1-78. [B&M] John Bell and Moshe Machover: A Course in Mathematical Logic. North- Holland, 1977. Other logic texts: The first is more elementary and readable. [Enderton] Herbert Enderton: A Mathematical Introduction to Logic. Academic Press, 1972. [Mendelson] E. Mendelson: Introduction to Mathematical Logic. Wadsworth & Brooks/Cole, 1987. Computability text: [Sipser] Michael Sipser: Introduction to the Theory of Computation. PWS, 1997. [DSW] M. Davis, R. Sigal, and E. Weyuker: Computability, Complexity and Lan- guages: Fundamentals of Theoretical Computer Science. Academic Press, 1994. Propositional Calculus Throughout our treatment of formal logic it is important to distinguish between syntax and semantics. Syntax is concerned with the structure of strings of symbols (e.g. formulas and formal proofs), and rules for manipulating them, without regard to their meaning. Semantics is concerned with their meaning. 1 Syntax Formulas are certain strings of symbols as specified below. In this chapter we use formula to mean propositional formula. Later the meaning of formula will be extended to first-order formula. (Propositional) formulas are built from atoms P1;P2;P3;:::, the unary connective :, the binary connectives ^; _; and parentheses (,). (The symbols :; ^ and _ are read \not", \and" and \or", respectively.) We use P; Q; R; ::: to stand for atoms. Formulas are defined recursively as follows: Definition of Propositional Formula 1) Any atom P is a formula.
    [Show full text]
  • Foundations of Mathematics
    Foundations of Mathematics November 27, 2017 ii Contents 1 Introduction 1 2 Foundations of Geometry 3 2.1 Introduction . .3 2.2 Axioms of plane geometry . .3 2.3 Non-Euclidean models . .4 2.4 Finite geometries . .5 2.5 Exercises . .6 3 Propositional Logic 9 3.1 The basic definitions . .9 3.2 Disjunctive Normal Form Theorem . 11 3.3 Proofs . 12 3.4 The Soundness Theorem . 19 3.5 The Completeness Theorem . 20 3.6 Completeness, Consistency and Independence . 22 4 Predicate Logic 25 4.1 The Language of Predicate Logic . 25 4.2 Models and Interpretations . 27 4.3 The Deductive Calculus . 29 4.4 Soundness Theorem for Predicate Logic . 33 5 Models for Predicate Logic 37 5.1 Models . 37 5.2 The Completeness Theorem for Predicate Logic . 37 5.3 Consequences of the completeness theorem . 41 5.4 Isomorphism and elementary equivalence . 43 5.5 Axioms and Theories . 47 5.6 Exercises . 48 6 Computability Theory 51 6.1 Introduction and Examples . 51 6.2 Finite State Automata . 52 6.3 Exercises . 55 6.4 Turing Machines . 56 6.5 Recursive Functions . 61 6.6 Exercises . 67 iii iv CONTENTS 7 Decidable and Undecidable Theories 69 7.1 Introduction . 69 7.1.1 Gödel numbering . 69 7.2 Decidable vs. Undecidable Logical Systems . 70 7.3 Decidable Theories . 71 7.4 Gödel’s Incompleteness Theorems . 74 7.5 Exercises . 81 8 Computable Mathematics 83 8.1 Computable Combinatorics . 83 8.2 Computable Analysis . 85 8.2.1 Computable Real Numbers . 85 8.2.2 Computable Real Functions .
    [Show full text]
  • Lecture Notes for MATH 770 : Foundations of Mathematics — University of Wisconsin – Madison, Fall 2005
    Lecture notes for MATH 770 : Foundations of Mathematics — University of Wisconsin – Madison, Fall 2005 Ita¨ıBEN YAACOV Ita¨ı BEN YAACOV, Institut Camille Jordan, Universite´ Claude Bernard Lyon 1, 43 boulevard du 11 novembre 1918, 69622 Villeurbanne Cedex URL: http://math.univ-lyon1.fr/~begnac/ c Ita¨ıBEN YAACOV. All rights reserved. CONTENTS Contents Chapter 1. Propositional Logic 1 1.1. Syntax 1 1.2. Semantics 3 1.3. Syntactic deduction 6 Exercises 12 Chapter 2. First order Predicate Logic 17 2.1. Syntax 17 2.2. Semantics 19 2.3. Substitutions 22 2.4. Syntactic deduction 26 Exercises 35 Chapter 3. Model Theory 39 3.1. Elementary extensions and embeddings 40 3.2. Quantifier elimination 46 Exercises 51 Chapter 4. Incompleteness 53 4.1. Recursive functions 54 4.2. Coding syntax in Arithmetic 59 4.3. Representation of recursive functions 64 4.4. Incompleteness 69 4.5. A “physical” computation model: register machines 71 Exercises 75 Chapter 5. Set theory 77 5.1. Axioms for set theory 77 5.2. Well ordered sets 80 5.3. Cardinals 86 Exercises 94 –sourcefile– iii Rev: –revision–, July 22, 2008 CONTENTS 1.1. SYNTAX CHAPTER 1 Propositional Logic Basic ingredients: • Propositional variables, which will be denoted by capital letters P,Q,R,..., or sometimes P0, P1, P2,.... These stand for basic statements, such as “the sun is hot”, “the moon is made of cheese”, or “everybody likes math”. The set of propositional variables will be called vocabulary. It may be infinite. • Logical connectives: ¬ (unary connective), →, ∧, ∨ (binary connectives), and possibly others. Each logical connective is defined by its truth table: A B A → B A ∧ B A ∨ B A ¬A T T T T T T F T F F F T F T F T T F T F F T F F Thus: • The connective ¬ means “not”: ¬A means “not A”.
    [Show full text]
  • Axiomatization of Logic. Truth and Proof. Resolution
    H250: Honors Colloquium – Introduction to Computation Axiomatization of Logic. Truth and Proof. Resolution Marius Minea [email protected] How many do we need? (best: few) Are they enough? Can we prove everything? Axiomatization helps answer these questions Motivation: Determining Truth In CS250, we started with truth table proofs. Propositional formula: can always do truth table (even if large) Predicate formula: can’t do truth tables (infinite possibilities) ⇒ must use other proof rules Motivation: Determining Truth In CS250, we started with truth table proofs. Propositional formula: can always do truth table (even if large) Predicate formula: can’t do truth tables (infinite possibilities) ⇒ must use other proof rules How many do we need? (best: few) Are they enough? Can we prove everything? Axiomatization helps answer these questions Symbols of propositional logic: propositions: p, q, r (usually lowercase letters) operators (logical connectives): negation ¬, implication → parentheses () Formulas of propositional logic: defined by structural induction (how to build complex formulas from simpler ones) A formula (compound proposition) is: any proposition (aka atomic formula or variable) (¬α) where α is a formula (α → β) if α and β are formulas Implication and negation suffice! First, Define Syntax We define a language by its symbols and the rules to correctly combine symbols (the syntax) Formulas of propositional logic: defined by structural induction (how to build complex formulas from simpler ones) A formula (compound proposition) is: any
    [Show full text]
  • Lecture 4 1 Overview 2 Propositional Logic
    COMPSCI 230: Discrete Mathematics for Computer Science January 23, 2019 Lecture 4 Lecturer: Debmalya Panigrahi Scribe: Kevin Sun 1 Overview In this lecture, we give an introduction to propositional logic, which is the mathematical formaliza- tion of logical relationships. We also discuss the disjunctive and conjunctive normal forms, how to convert formulas to each form, and conclude with a fundamental problem in computer science known as the satisfiability problem. 2 Propositional Logic Until now, we have seen examples of different proofs by primarily drawing from simple statements in number theory. Now we will establish the fundamentals of writing formal proofs by reasoning about logical statements. Throughout this section, we will maintain a running analogy of propositional logic with the system of arithmetic with which we are already familiar. In general, capital letters (e.g., A, B, C) represent propositional variables, while lowercase letters (e.g., x, y, z) represent arithmetic variables. But what is a propositional variable? A propositional variable is the basic unit of propositional logic. Recall that in arithmetic, the variable x is a placeholder for any real number, such as 7, 0.5, or −3. In propositional logic, the variable A is a placeholder for any truth value. While x has (infinitely) many possible values, there are only two possible values of A: True (denoted T) and False (denoted F). Since propositional variables can only take one of two possible values, they are also known as Boolean variables, named after their inventor George Boole. By letting x denote any real number, we can make claims like “x2 − 1 = (x + 1)(x − 1)” regardless of the numerical value of x.
    [Show full text]