Unary negation: T F F T
|
|
|
- Kristian Ford
- 6 years ago
- Views:
Transcription
1 Unary negation: ϕ 1 ϕ 1 T F F T
2 Binary (inclusive) or: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T T T F T F T T F F F Binary (exclusive) or: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T F T F T F T T F F F
3 Classical (material) conditional: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T T T F F F T T F F T Classical (material) biconditional: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T T T F F F T F F F T
4 How many (two-valued) binary truth functions are there? ϕ 1 ϕ 2 T T T T T T T T T T F F F F F F F F T F T T T T F F F F T T T T F F F F F T T T F F T T F F T T F F T T F F F F T F T F T F T F T F T F T F T F
5 How many (two-valued) binary truth functions are there? ϕ 1 ϕ 2 T T T T T T T T T T F F F F F F F F T F T T T T F F F F T T T T F F F F F T T T F F T T F F T T F F T T F F F F T F T F T F T F T F T F T F T F 16 (= 2 (22) ) Which ones are in common use?
6 How many (two-valued) unary truth functions are there? ϕ 1 T T T F F F T F T F 4 (= 2 (21) )
7 How many 0-ary connectives are there? T F 2 (= 2 (20) ) What s the difference between, (ϕ 1 ), and (ϕ 1, ϕ 2 )?
8 Logic textbooks don t usually discuss connectives of higher adicity, although the following one is sometimes mentioned (e.g., by Alonzo Church, 1956). He called it conditional disjunction, although most of the rest of us call it if then else : ϕ 1 ϕ 2 ϕ 3 (ϕ 1, ϕ 2, ϕ 3 ) T T T T T T F T T F T F T F F F F T T T F T F F F F T T F F F F How many ternary connectives are there?
9 How many ternary connectives are there? 256 (= 2 (23) ) How many quadrinary? 65, 536 (= 2 (24) ) How many truth functions are there all told? So why do logic textbooks stick with just the few common ones???
10 A combination of: These connectives correspond (sort of) to natural language connectives, and they are functionally complete [also known as expressively complete ] This means that all of the infinite number of truth functions can be expressed as some combination of the ones they chose. How do we prove that??
11 By showing how to construct a formula that corresponds to any arbitrary truth table: Here s an example truth function (represented by this arbitrary truth table. (I m just using a ternary truth function, so as to be able to fit it on the page... the method works with any adicity). ϕ 1 ϕ 2 ϕ 3 Ψ T T T T T T F F T F T F T F F F F T T T F T F F F F T T F F F F Step 1: For each line of the truth table where Ψ is T, write a formula that is true in that row and in no other row.
12 ϕ 1 ϕ 2 ϕ 3 Ψ T T T T (ϕ 1 ϕ 2 ϕ 3 ) T T F F T F T F T F F F F T T T ( ϕ 1 ϕ 2 ϕ 3 ) F T F F F F T T ( ϕ 1 ϕ 2 ϕ 3 ) F F F F Note that each of those formulas is true in just exactly their one corresponding row of the truth table. Now, put a between each of those formulas: ((ϕ 1 ϕ 2 ϕ 3 ) ( ϕ 1 ϕ 2 ϕ 3 ) ( ϕ 1 ϕ 2 ϕ 3 )) This is true in one of the three rows, but not in any other row. Thus it characterizes Ψ.
13 Did it really work?? Did the demonstration cover all the cases?? What do you think?
14 The formula thus generated is in what is called Disjunctive Normal Form (DNF): (a) The main connectives are disjunctions ( ). (b) Each of the disjuncts is a conjunction, so their main connectives are (c) Each of the items thus conjoined is a literal either a sentence letter or the negation of a sentence letter. Every formula can be put into DNF (and there is a corresponding CNF). This shows that every one of the infinite number of truth functions can be written using only the unary and the binary and. Alternatively put: The set of connectives, {,, } is functionally complete.
15 Who remembers the DeMorgan Laws?? So this means that each of {, } and {, } are functionally complete, since using just the connectives in one of these sets, one can define everything in an already-known-to-be-functionally-complete set (namely {,, }) And we all know the definition of p q as either (p q) or p q. So {, } is also functionally complete.
16 Maybe you also know that the connectives and are each functionally complete by themselves? Their truth tables are: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) (ϕ 1 ϕ 2 ) T T F F T F F T F T F T F F T T Can you show how to use one of these to define the connectives of an already-known-to-be-functionally-complete set of connectives? Exercise: Show that {, } is functionally complete. Show that {,, } is functionally complete.
17 Ok that s all well and good. But WHY: How come {, }, {, }, {, }, {,, }, {, }, { }, and { } are functionally complete, but nonetheless {, } is not functionally complete?? {,, } is not functionally complete?? The answer is given in Post s Functional Completeness Theorem (Emil Post, 1941). The most AMAZING and AWE-INSPIRING thing ever proved about two-valued truth-functional logic!!
18 But first some preliminaries. We need to define five abstract properties of truth functions: 1. Closed under T 2. Closed under F 3. Self-Dual 4. Monotonic (requires preliminary notion of truth-vector order) 5. Counting (requires preliminary notions of truth-vector order and of dummy variable) Easy definitions: A truth-function is closed under T iff it has a T in its first row (i.e., if all its arguments are T then so is its resulting value) A truth-function is closed under F iff it has a F in its last row (i.e., if all its arguments are F then so is its resulting value) So:,,,,, are all closed under T.,,,, are all closed under F.
19 SELF-DUALITY: Let p be the name of the truth value that is the opposite of the value of p. A truth function f is self-dual iff for each input vector (line of truth table) < p 1,, p n >, f (< p 1,, p n >) = f (< p 1,, p n >) So therefore a function f is not self-dual iff there is a row of the truth table, < q 1,, q n > such that f (< p 1,, p n >) = f (< p 1,, p n >) For example,,, are self-dual.,,,,, are not.
20 Background notion: truth-vector ordering. This is an ordering of the input rows of a truth table (technically, it s a partial order not every pair of rows can be compared). Maybe clearest with an example. Suppose a truth vector of three elements. Here s an ordering: < T, T, T > < F, T, T > < T, F, T > < T, T, F > < F, F, T > < F, T, F > < T, F, F > < F, F, F > T is considered greater than F. And so each member of each level is greater than any of the ones in the next level lower. Being greater than is transitive, so that following a pathway downward always will yield cases of greater than.
21 MONOTONIC TRUTH FUNCTION: The n-ary truth function f n is monotonic iff whenever n-ary truth vectors are such that V 1 V 2, f n (V 1 ) f n (V 2 ) So, a (two-valued) truth function f is not monotonic iff there is a row of the truth table where the value of f at that row is F while the value of f at some row that is less than the first is T. For example:,,, are monotonic.,,,, are not.
22 DUMMY POSITION (for a truth function f ): A position in a truth function s input values is dummy iff it never makes a difference in evaluating the truth function. That is: The i th position of < x 1,, x n > is a dummy position iff f n (x 1,, x i 1, F, x i+1,, x n ) = f n (x 1,, x i 1, T, x i+1,, x n ) for every combination of values of all the other positions. Consider this imaginary binary connective (p q): ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T F T F T F T F F F T Obviously, this is really just ϕ 2. ϕ 1 never makes a difference.
23 COUNTING FUNCTIONS: A function f is a counting function iff (i) No position is dummy. (ii) if V i and V j are immediately adjacent in the truth-vector ordering, then f (V i ) f (V j ) Or in other words, if two input vectors differ in only one value, but the values of the function applied to those two rows are the same, then the function is not counting (well, unless that position is dummy).
24 ϕ 1 ϕ 1 T F F T Negation is self-dual and counting (but not the other properties) ϕ 1 ϕ 2 T T T T T T F T F T F F T F F T T F F T F T T F T T F F F F F T T F T F, are T-preserving, F-preserving, monotonic is T-preserving is T-preserving and counting is F-preserving and counting is T-preserving, monotonic and counting is F-preserving, monotonic and counting And of course, atomic sentences themselves (or, if you prefer, the identity function on truth values) are T-preserving, F-preserving, self-dual, monotonic, and counting.
25 POST S FUNCTIONAL COMPLETENESS THEOREM The most amazing theorem about two-valued truth functions ever!!
26 A set of (2-valued) truth functions, X, is functionally complete iff for each of: closed under T closed under F monotonic self-dual counting, there is a member of X which does not manifest that property.
27 HOW TO PROVE THIS BEAUTIFUL THEOREM?? Well, it s an iff theorem, so let s try proving each of the two directions separately: (i) If X is a functionally complete set, then for each of the properties, some member of X does not manifest it. (ii) Given any set of connectives X such that, for each of the properties, there is at least one connective in X lacks that property, then X is functionally complete. Let s prove (ii) first. We ll do it by construction that is, I will assume I have connectives that lack the five properties, and will then show you how to define a set of connectives that you already know to be functionally complete (such as {, } or {, }, etc.) Afterwards I ll show you how a proof of (i) proceeds, but won t actually present the detailed proof.
28 ϕ 1 ϕ 2 ϕ 3 f 1 f 2 f 3 f 4 f 5 f 6 T T T F T T F T F T T F T F F 1 T 1 T T T F T T F F T 1 F F T F F T T F T T 1 F F T T T T T T T 1 F F T F F T T 1 F F T F F T T T T F F T F F F F T F T F T f 1 and f 2 are non-t- and non-f-preserving (respectively). f 3 is non-monotonic (as proved by the 1 s). f 4 is non-counting [no dummies: rows 1 & 5 for 1st position, 6 & 8 for 2nd position, 1 & 2 for 3rd position]. The 1 s show where it isn t counting. f 5 is non-self-dual, as shown by the 1 s. f 6 is a function that is non-t-and-non-f-preserving, non-monotonic, non-self-dual, non-counting.
Truth-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
PHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
Deduction by Daniel Bonevac. Chapter 3 Truth Trees
Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties
More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic
More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences Computability and Logic Equivalences Involving Conditionals Some Important Equivalences Involving Conditionals
Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
Propositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.
January 22, 2013 Modal logic is, among other things, the logic of possibility and necessity. Its history goes back at least to Aristotle s discussion of modal syllogisms in the Prior Analytics. But modern
Example. 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.
The statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
Lecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
1 Propositional Logic
CS 2800, Logic and Computation Propositional Logic Lectures Pete Manolios Version: 384 Spring 2011 1 Propositional Logic The study of logic was initiated by the ancient Greeks, who were concerned with
Philosophy 220. Truth-Functional Equivalence and Consistency
Philosophy 220 Truth-Functional Equivalence and Consistency Review Logical equivalency: The members of a pair of sentences [of natural language] are logically equivalent if and only if it is not [logically]
Lecture 4: Proposition, Connectives and Truth Tables
Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine
What is Logic? Introduction to Logic. Simple Statements. Which one is statement?
What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo
Tecniche 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
Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
Comp487/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
Chapter 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
Solutions to Sample Problems for Midterm
Solutions to Sample Problems for Midterm Problem 1. The dual of a proposition is defined for which contains only,,. It is For a compound proposition that only uses,, as operators, we obtained the dual
Lecture 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
Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov
Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob
Description 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
Logic: 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.
INTRODUCTION 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
CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS
CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency
AI 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
Tautological equivalence. entence equivalence. Tautological vs logical equivalence
entence equivalence Recall two definitions from last class: 1. A sentence is an X possible sentence if it is true in some X possible world. Cube(a) is TW possible sentence. 2. A sentence is an X necessity
Semantic Metatheory of SL: Mathematical Induction
Semantic Metatheory of SL: Mathematical Induction Preliminary matters: why and when do we need Mathematical Induction? We need it when we want prove that a certain claim (n) holds for all n N (0, 1, 2,
Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese
Section 1.1 Propositional Logic proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese go to town! X - imperative What time is it? X - interrogative propositional
1.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
2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
Discrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives
KRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
02 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
MA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
Topic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
A 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
Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
Mathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical
cis32-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
CS 486: Lecture 2, Thursday, Jan 22, 2009
CS 486: Lecture 2, Thursday, Jan 22, 2009 Mark Bickford January 22, 2009 1 Outline Propositional formulas Interpretations and Valuations Validity and Satisfiability Truth tables and Disjunctive Normal
Introduction. Applications of discrete mathematics:
Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design Relational Database Theory Complexity
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.
![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.](/thumbs/87/97228443.jpg "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.")
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.
First Degree Entailment
First Degree Entailment Melvin Fitting March 30, 2018 1 Truth Tables First Degree Entailment is a four-valued logic whose importance has become ever more apparent over the years. It arose out of work on
a. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
Exclusive Disjunction
Exclusive Disjunction Recall A statement is a declarative sentence that is either true or false, but not both. If we have a declarative sentence s, p: s is true, and q: s is false, can we rewrite s is
Introduction to Logic
Introduction to Logic L. Marizza A. Bailey June 21, 2014 The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra
DERIVATIONS AND TRUTH TABLES
DERIVATIONS AND TRUTH TABLES Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 3: DERIVATIONS AND TRUTH TABLES 1 / 65 WHAT
We last time we began introducing equivalency laws.
Monday, January 14 MAD2104 Discrete Math 1 Course website: www/mathfsuedu/~wooland/mad2104 Today we will continue in Course Notes Chapter 22 We last time we began introducing equivalency laws Today we
INTRODUCTION TO LOGIC
INTRODUCTION TO LOGIC L. MARIZZA A. BAILEY 1. The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra and geometry.
Chapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
Propositional Calculus: Formula Simplification, Essential Laws, Normal Forms
P Formula Simplification, Essential Laws, Normal Forms Lila Kari University of Waterloo P Formula Simplification, Essential Laws, Normal CS245, Forms Logic and Computation 1 / 26 Propositional calculus
Compound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
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
Boolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
1 Boolean Algebra Simplification
cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.
CSCI3390-Lecture 17: A sampler of NP-complete problems
CSCI3390-Lecture 17: A sampler of NP-complete problems 1 List of Problems We now know that if L is any problem in NP, that L P SAT, and thus SAT is NP-hard. Since SAT is also in NP we find that SAT is
Introducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
Manual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
Logic 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:
CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC
1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of
Section 1.1: Logical Form and Logical Equivalence
Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,
Section 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
Propositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
Conjunctive Normal Form and SAT
Notes on Satisfiability-Based Problem Solving Conjunctive Normal Form and SAT David Mitchell mitchell@cs.sfu.ca September 19, 2013 This is a preliminary draft of these notes. Please do not distribute without
CS 380: ARTIFICIAL INTELLIGENCE PREDICATE LOGICS. Santiago Ontañón
CS 380: RTIFICIL INTELLIGENCE PREDICTE LOGICS Santiago Ontañón so367@drexeledu Summary of last day: Logical gents: The can reason from the knowledge they have They can make deductions from their perceptions,
Chapter 1, Section 1.1 Propositional Logic
Discrete Structures Chapter 1, Section 1.1 Propositional Logic These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6 th ed., by Kenneth H. Rosen, published
8. Reductio ad absurdum
8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, 10 Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual
Propositional 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
Discrete Mathematics
Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous
Natural 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
The Samson-Mills-Quine theorem
The Samson-Mills-Quine theorem Intermediate Logic The dnf simplification procedure can greatly simplify the complexity of truth-functional formulas, but it does not always turn up a simplest possible Boolean
Chapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14
0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents
A 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
Artificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
ICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
Propositional Logic and Semantics
Propositional Logic and Semantics English is naturally ambiguous. For example, consider the following employee (non)recommendations and their ambiguity in the English language: I can assure you that no
INTRODUCTION TO LOGIC 3 Formalisation in Propositional Logic
Introduction INRODUCION O LOGIC 3 Formalisation in Propositional Logic Volker Halbach If I could choose between principle and logic, I d take principle every time. Maggie Smith as Violet Crawley in Downton
Logic, 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.
Applied Logic. Lecture 3 part 1 - Fuzzy logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 3 part 1 - Fuzzy logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018 1
The Samson-Mills-Quine theorem
The Samson-Mills-Quine theorem Intermediate Logic The dnf simplification procedure can greatly simplify the complexity of truth-functional formulas, but it does not always turn up a simplest possible Boolean
Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions
Note 01 Propositional Logic 1 / 10-1 Overview 1. Introduction to Propositional Logic 2. Operations on Propositions 3. Truth Tables 4. Translating Sentences into Logical Expressions 5. Preview: Propositional
6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes gives an important argument for government. Hobbes begins by claiming that without a common
An Introduction to SAT Solving
An Introduction to SAT Solving Applied Logic for Computer Science UWO December 3, 2017 Applied Logic for Computer Science An Introduction to SAT Solving UWO December 3, 2017 1 / 46 Plan 1 The Boolean satisfiability
8. Reductio ad absurdum
8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities
6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
1 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
PHIL12A 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
Choosing Logical Connectives
Choosing Logical Connectives 1. Too Few Connectives?: We have chosen to use only 5 logical connectives in our constructed language of logic, L1 (they are:,,,, and ). But, we might ask, are these enough?
Intermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
Propositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
Description Logics. Deduction in Propositional Logic. franconi. Enrico Franconi
(1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision
PROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
Propositional logic ( ): Review from Mat 1348
CSI 2101 / Winter 2008: Discrete Structures. Propositional logic ( 1.1-1.2): Review from Mat 1348 Dr. Nejib Zaguia - Winter 2008 1 Propositional logic: Review Mathematical Logic is a tool for working with
Propositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
Informatics 1 - Computation & Logic: Tutorial 3
Informatics 1 - Computation & Logic: Tutorial 3 Counting Week 5: 16-20 October 2016 Please attempt the entire worksheet in advance of the tutorial, and bring all work with you. Tutorials cannot function
A 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
DISCRETE STRUCTURES WEEK5 LECTURE1
DISCRETE STRUCTURES WEEK5 LECTURE1 Let s get started with... Logic! Spring 2010 CPCS 222 - Discrete Structures 2 Logic Crucial for mathematical reasoning Important for program design Used for designing
2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?
Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true