Introduction to Logic: Argumentation and Interpretation. Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D

Similar documents
Propositional Logic Not Enough

Introduction to Sets and Logic (MATH 1190)

Discrete Structures for Computer Science

Section 2.1: Introduction to the Logic of Quantified Statements

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Predicate Logic & Quantification

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

THE LOGIC OF COMPOUND STATEMENTS

HANDOUT AND SET THEORY. Ariyadi Wijaya

Mat 243 Exam 1 Review

Quantifiers. P. Danziger


1.1 Language and Logic

Chapter 1 Elementary Logic

Chapter 2: The Logic of Quantified Statements

Predicates, Quantifiers and Nested Quantifiers

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

Generalized Quantifiers Logical and Linguistic Aspects

! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers

Logic and Proofs. (A brief summary)

ICS141: Discrete Mathematics for Computer Science I

Announcements CompSci 102 Discrete Math for Computer Science

Predicate Calculus - Syntax

Lecture 4: Proposition, Connectives and Truth Tables

Logic (3A) Young W. Lim 11/2/13

THE LOGIC OF COMPOUND STATEMENTS

It rains now. (true) The followings are not propositions.

Logic (3A) Young W. Lim 10/31/13

Logic (3A) Young W. Lim 10/29/13

First Order Logic (1A) Young W. Lim 11/5/13

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

A Little Deductive Logic

Logic Overview, I. and T T T T F F F T F F F F

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )

Predicate Logic: Sematics Part 1

Section Summary. Predicates Variables Quantifiers. Negating Quantifiers. Translating English to Logic Logic Programming (optional)

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

A Little Deductive Logic

Section Summary. Section 1.5 9/9/2014

Predicate Logic 1. The Need for Predicate Logic. The Need for Predicate Logic. The Need for Predicate Logic. The Need for Predicate Logic

Introduction to Metalogic

SPEAKING MATHEMATICALLY. Prepared by Engr. John Paul Timola

Proposi'onal Logic Not Enough

COMP 2600: Formal Methods for Software Engineeing

First Order Logic (1A) Young W. Lim 11/18/13

THE LOGIC OF QUANTIFIED STATEMENTS

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES

Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic

Topic #3 Predicate Logic. Predicate Logic

Logic, Sets, and Proofs

Logic and Proofs. (A brief summary)

Logic Background (1A) Young W. Lim 12/14/15

First order Logic ( Predicate Logic) and Methods of Proof

Predicate Logic: Semantics

Automata Theory and Formal Grammars: Lecture 1

Introduction to first-order logic:

Recall that the expression x > 3 is not a proposition. Why?

Chapter 3. The Logic of Quantified Statements

CS560 Knowledge Discovery and Management. CS560 - Lecture 3 1

MATH 22 INFERENCE & QUANTIFICATION. Lecture F: 9/18/2003

MAI0203 Lecture 7: Inference and Predicate Calculus

Review: Potential stumbling blocks

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

STRATEGIES OF PROBLEM SOLVING

For all For every For each For any There exists at least one There exists There is Some

1.1 Language and Logic

LIN1032 Formal Foundations for Linguistics

Conjunction: 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.

Predicate Calculus lecture 1

Discrete Mathematics and Its Applications

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

III. Elementary Logic

Math 10850, fall 2017, University of Notre Dame

Introduction. Predicates and Quantifiers. Discrete Mathematics Andrei Bulatov

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.

THE LOGIC OF QUANTIFIED STATEMENTS

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Predicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson

Predicate Logic: Syntax

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Predicate Logic. Andreas Klappenecker

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

cis32-ai lecture # 18 mon-3-apr-2006

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

Predicate Logic: Introduction and Translations

INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4

Mathematical Reasoning (Part I) 1

PHIL12A Section answers, 28 Feb 2011

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Part Two: The Basic Components of the SOFL Specification Language

Predicate in English. Predicates and Quantifiers. Predicate in Logic. Propositional Functions: Prelude. Propositional Function

Transcription:

Introduction to Logic: Argumentation and Interpretation Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D. 30. 3. 2016

tests. Introduction to Logic: Argumentation and Interpretation Annotation The course offers an overview of topics in logic, communication, reasoning, interpretation and summary of their practical use in communication. It provides basic orientation in terminology of linguistic research and communication, persuasion and communication strategies, understanding the logic games, exercises and tasks, and offers the opportunity to learn the reasoning applied in various situations. The aim is that students not only get familiar with lectures, but also acquire the means of communication and argumentation through exercises and online

Topics 1. Brief history of Logic and its place in science 2. Analysis of complex propositions using truth tables 3. The subject-predicate logic Aristotelian square 4. Definitions and Terminology 5. Polysemy, synonymy, homonymy, antonymy 6. Analysis of faulty arguments 7. Interpretation rules and approaches 8. Analysis of concrete dialogue http://mediaanthropology.webnode.cz/kurzy/introduction-to-logic/

Predicate logic In propositional logic it does not depend on the internal structure of the stament (proposition), because propositional logic deals only with those structures (complex statements, arguments), whose truthfulness or accuracy depends only on how they are connected to each other. Only a small part of the judgments can be formalized and proved in the context of propositional logic. In predicate logic it depends on the internal structure of the verdict. If the correctness of the arguments depends on the internal structure of simple statements, the essential elements on which it depends, we call terms. Sources: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007. E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic Aristotelian syllogisms consist of two simple premises and a simple conclusion. Peter is a student. Every human is fallible. Students are wise. John is human. Peter is wise. John is fallible. If we mark these sentences as p, q, r, then the attempt to formalize within propositional logic is given by the following judgment: p, q / r, which corresponds to the formula: (p q) Þ r Sources: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007. E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic Aristotelian square This formalization, however, is apparently insufficient for the following reasons: The three statements are according to propositional logic elementary and independent of each other, but in fact they have internal components, they are structured, and between these components there is a connection. The term "man" is found in the statements p and q, the term "fallible" in the statements p and r, and the term "John" in the statements q and r. Sources: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007. E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic Aristotelian square The formula (p q) Þ r is not a tautology, the judgment, p, q / r is not valid, even if the judgment demonstrated by the example is valid. In predicate logic, which is a generalization of propositional logic, the judgment is formalized as x [p(x) Þ q(x)], p(j) = q(j) respectively by this formula: { x [p(x) Þ q(x)] p(j)} Þ q(j) Sources: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007. E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic x is an object (individual) variable from a particular subject area - the universe of the discourse J is individual constant of the subject area (in the example a concrete person Jan) p, q are certain properties of objects from the universe of the discourse (in the example there are interpreted as characteristics of thinking beings to be human" and to be fallible"), p (x), q (x), respectively p (J), q (J) denotes that x respectively J has the property of p, respectively of q, The formula for all the x [] indicates that for every individuals from the subject area it applies what is stated in brackets. Sources: E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic 1st order predicate logic formalizes judgments about the properties of objects and relationships between objects fixed by the subject area (universe). Predicate logics of the second and higher-order deal with the formalization of judgments, with properties of properties and with relations (and relations between properties and relations). 1st order predicate logic is a generalization of propositional logic, which can be considered a logic of the 0th order. Source: E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic There are two kinds of terms: General linguistic expressions that indicate a larger number of subjects, ie. a set of objects (man, city, number,...). Singular linguistic expressions that denote just one object (names such as Paul, Prague...). Singular Statements A simple singular statement is formed by the merger (connection) of a singular term with a general term with the connective = "is". Example: Paul is a human. (ie. Paul belongs to the group of people) Prague is a city. (ie. Prague belongs to the set of cities) Sources: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Singular simple statement is a simple method of prediction, whose purpose is to testify something (man, city,...) about something (Paul, Prague,...) (predicate, subject) On simple singular statements the rules of propositional logic can be applied, ie. we can combine them into complex propositions using logical connectives. A general term "human" can be associated (connected) with only one singular term (one variable): Peter is human. It is therefore a single predicate. Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic There are also general terms that relate to arranged couples. They do not express their properties, but their relationship ("greater than", "brother of",...) Peter is greater than Paul. (singular term) (genal term) (singular term) Ivan is the brother of Ondra. Such general terms are called relational terms. There exist also relational terms that express the relation between more than two subjects. To set up such a simple statement we need the appropriate number of singular terms. It is an n-digit predicate. To express the relationship that Prague lies between Melnik and Benesov we need a minimum of three singular terms Prague, Melnik, Benesov. Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Alphabet of predicate logic consists of the following groups of symbols: a) Logical symbols subject (individual) variables: x, y, z,... (resp. with index) symbols for connectives: Þ symbols for quantifiers: for all, exists event. binary predicate symbol = (predicate logic with equality) b) Special symbols (determine the specifics of the language) predicate symbols: p, q, r,... (resp. with index) functional symbols: f, g, h,... (resp. with index) Source: E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic For each functional and predicate symbol there is assigned a nonnegative number n (n 0), so called arita, giving us the number of individual variables that are arguments to the function or predicate. c) Auxiliary symbols /brackets/: (,) / eventually. [,],{,}/ Souce: E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic Grammar a) terms: each symbol of variable is a term where t1,..., tn (n 0) are terms and where f is n-ary function symbol, then the expression f (t1,..., tn) is a term; for n = 0 is a null function symbol or individual constant (marked a, b, c,...) b) an atomic formula: if p is n-ary predicate symbol and if t1,..., tn are terms, then the expression p (t1,..., tn) is an atomic formula where t1 and t2 are terms, then the expression (t1 = t2) is an atomic formula Source: E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic Grammar c) formula: each atomic formula is a formula: if the expression A is a formula, then A is a formula if the expressions A and B are formulas, then expressions (A disjunction B), (A Conjunction B), (A implication B), (A B) are formulas if x is a variable and A formula, then expressions for all xa and exists xa are formulas Source: E-vyuka pro logiku. [online] Online: http://snug.ic.cz/index.htm#

Predicate logic Grammar In predicate logic parts form the structure by predicate constant (F) and individual constant (a). Truthfulness depends here on whether we combine suitable predicate constant with suitable individual constant. What is the appropriate connection? The statement in the form F (a) is true if and only if there is a subject indicated by individual constant that is element of the set indicated by predicate constant. Statement "Zinc is a chemical element" is true if Zinc belongs to a set of chemical elements. Statement is false, if Zinc does not belong to a set of chemical elements. Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Grammar The truth value of the statement F (a) can be explained also by Frege's approach, through the predicate function. E.g. "It is a chemical element" we perceive as a function that when applied for Zinc, it is true (Zinc is a chemical element). If it is applied eg. for the water, it is false (water is a chemical element is a false statement). Approaches using a function that is assigning values truth, false using a set and properties belonging to it, not to belong to it upraveno podle: : NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic General statements In natural language we find statements of a general nature, for example: Everyone is mortal, some dogs are dachshunds, no man is an animal... Analysis of the statement Everyone is mortal. F... be mortal (predicate constant) Individual constant not obvious, it is only undefined term each How do we use this term? If we examine some set of individuals, eg. a set of people, the statement everyone is mortal is true if and only if every element of the setm is mortal. Sources: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007. https://en.wikipedia.org/wiki/dachshund

Predicate logic General statements Peter is mortal. Ivan is mortal. Jane is mortal. etc. for all such elements of the set of people, we decided to investigate. Verdict: For every x: x is mortal. F (x)... x is mortal For every x: F (x) symbol for the expression for each (universal quantifier) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic PARTIAL STATEMENTS Statements that begin eg. with the expression some. Some dogs are dachshunds. Two predicate constants G... dog, F... dachshund We are looking for individuals who have the property (characteristics) that simultaneously x is a dog and x is a dachshund. For the statement to be true, it is sufficient that there is at least one such individual who is both a dog and the dachshund. There is at least one x for which: x is a dog and x is a dachshund. There is at least one x, for which: G (x) F (x) symbol for the expression there is at least one (existential quantifier) x (G (x) F (x)) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic When using quantifiers we have to consider every individual of the field of our consideration (universe of discourse). Criteria of the field of consideration: 1. It must contain items that are marked by individual constants. 2. It must contain items that are marked by predicate constants. 3. The field of consideration must not be empty. Examples: Every man is mortal. (field of consideration: set of animals) Some dogs are dachshunds. (field of consideration: animals) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic By predicate logic we can express for example Aristotelian statements. We examine, for example, a set of animals (field of consideration): Each dog is a mammal. No dog is a mammal. Some dog are mammals. Some dog are not mammals. Two general terms F... dog G... mammal Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Natural language (1) Each dog is a mammal. (2) No dog is a mammal. (3) Some dog are mammals. (4) Some dog are not mammals. Aristotelia n F a G F e G F i G F o G Predicate logic x (F(x) Þ G(x)) x (F(x) Þ G(x)) x (F(x) G(x)) x (F(x) G(x)) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Field of consideration = a set of three elements (a,b,c) Individuals: a,b,c Property F (predicate constant) Statement x F(x) x F(x) (F(a) F(b) F(c)) universal quantifier expressed using conjunction Statement x F(x) x F(x) ( F(a) F(b) F(c) ) existential quantifier expressed using disjunction Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Rules The rule of general quantifier elimination: If we have a formula in the form: x F (x), we can move on to Formula F (a) (in the sense of truthfulness it indicates a particular object) If every human is an animal, then Peter is an animal. (Peter is from the set of humans.) The rule of introduction of existential quantifier: If we have a formula in the form F (a), we can move on to the formula x F (x) (Applies only when it denotes a particular object.) If Peter is an animal, then a human is an animal. (Peter is human.) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Rules The rule of the relationship between the general and existential quantifier: If we have a formula in the form: x F (x), we can move on to the formula x F (x) (Applies when the field of consideration is not empty) If every human is an animal, then some human are animals. Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Rules The relation between conjunction and disjunction (de Morgan's Law) (F(a) F(b) F(c)) ( F(a) F(b) F(c)) x F(x) ( x F(x)) x F(x) x F(x) x F(x) ( x F(x)) ( x F(x) ) x F(x) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Rules Formula with existential quantifier is associated with the disjunction Formula with a general quantifier is associated with conjunctions the relation between implication and conjunction: (p q) (p q) (p q) (p q) Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Predicate logic Aristotelian statements in predicate logic Each dog is a mammal. x (F(x) G(x)) x (F(x) G(x)) Some dog is a mammal. x (F(x) G(x)) x (F(x) G(x)) affirmo (claim, lat.) neggo (deny, lat.), subject (S) a predicate (P) Each (+) contrary None (-) S a P S e P subalternate contradictory subalternate Some (+) subcontrary Some (-) S i P No dog is a mammal. x (F(x) G(x)) x (F(x) G(x)) Some dog is not a mammal. x (F(x) G(x)) x (F(x) G(x)) S o P Source: NYTROVÁ, Olga - PIKÁLKOVÁ, Marcela. Etika a logika v komunikaci. Praha: UJAK, 2007.

Tasks Which terms can be described as singular? a) Vltava, river, Barikádníků Bridge, Charles University b) love, happiness, freedom, peace, God c) Bratří Synků Square, Vltava, Jan Amos Comenius d) Charles University, J. A. Comenius Square, teacher of nations e) neither of these

Tasks Draw the statement into the sets and decide which statement results from the premises Charles does not like any romantic movies. and Charles does not like the film Braveheart. a) Charles likes some romantic movies. b) Charles does not watch any movies. c) Charles likes some movies. d) Romantic movies are boring. e) None of the options.

Tasks Charles does not like any romantic movies Charles does not like the film Braveheart. Number of sets = number of given properties (to be) Thing Charles likes (to be) Romantic film folder1 folder2 folder3 Braveheart X X if there is a general and partial statement, we must begin with the general (folder2 is empty)

Tasks Draw the statement into the sets and decide which statement results from the premises Charles does not like some romantic movies. and Charles does not like horror movies. a) Charles likes some romantic movies. b) Charles does not like the movie Twilight. c) Peter also does not like romantic movies. d) Romantic movies are boring. e) None of the options.

Thank you for your attention! PhDr. Peter Jan Kosmály, PhD. In case of a need, don t hesitate to contact me: kosmaly@vsmvv.cz