INTRODUCTION & PROPOSITIONAL LOGIC. Dougherty, POLS 8000

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

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

We last time we began introducing equivalency laws.

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

Compound Propositions

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Propositional Equivalence

Logic and Truth Tables

Chapter 1: The Logic of Compound Statements. January 7, 2008

CS Module 1. Ben Harsha Apr 12, 2017

CSC Discrete Math I, Spring Propositional Logic

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Section 1.1: Logical Form and Logical Equivalence

EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

PL: Truth Trees. Handout Truth Trees: The Setup

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

EECS 1028 M: Discrete Mathematics for Engineers

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

Logic and Truth Tables

8.8 Statement Forms and Material Equivalence

Math.3336: Discrete Mathematics. Propositional Equivalences

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

1.1 Language and Logic

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Boolean Logic. CS 231 Dianna Xu

MAT2345 Discrete Math

Introduction Propositional Logic

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

THE LOGIC OF COMPOUND STATEMENTS

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Section 3.1 Statements, Negations, and Quantified Statements

Mat 243 Exam 1 Review

DISCRETE STRUCTURES WEEK5 LECTURE1

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.

CSE507. Course Introduction. Computer-Aided Reasoning for Software. Emina Torlak

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

The statement calculus and logic

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

THE LOGIC OF COMPOUND STATEMENTS

FOUNDATION OF COMPUTER SCIENCE ETCS-203

Intermediate Logic. Natural Deduction for TFL

PROPOSITIONAL CALCULUS

CSE 240 Logic and Discrete Mathematics

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Discrete Mathematics and Its Applications

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

PS10.3 Logical implications

Curriculum Map for Mathematics SL (DP1)

CSE 20 DISCRETE MATH. Fall

Inf2D 06: Logical Agents: Knowledge Bases and the Wumpus World

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

PHI Propositional Logic Lecture 2. Truth Tables

ECOM Discrete Mathematics

Topic 1: Propositional logic

Two hours. Note that the last two pages contain inference rules for natural deduction UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

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

4 Derivations in the Propositional Calculus

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

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Natural deduction for truth-functional logic

ICS141: Discrete Mathematics for Computer Science I

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Overview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading

Logic and Propositional Calculus

a. ~p : if p is T, then ~p is F, and vice versa

1.1 Language and Logic

Solutions to Homework I (1.1)

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

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

CSE 311: Foundations of Computing I. Lecture 1: Propositional Logic

Logical Agents. Chapter 7

Logic and Propositional Calculus

The Logic of Compound Statements cont.

Manual of Logical Style (fresh version 2018)

Discrete Structures of Computer Science Propositional Logic I

Advanced Topics in LP and FP

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

ANALYSIS EXERCISE 1 SOLUTIONS

Intelligent Agents. Pınar Yolum Utrecht University

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14

Propositional Logic. Fall () Propositional Logic Fall / 30

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

CS70: Discrete Math and Probability. Slides adopted from Satish Rao, CS70 Spring 2016 June 20, 2016

FORMAL PROOFS DONU ARAPURA

Math.3336: Discrete Mathematics. Applications of Propositional Logic

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

1 Propositional Logic

Definition 2. Conjunction of p and q

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Chapter 5: Section 5-1 Mathematical Logic

Propositional Logic: Logical Agents (Part I)

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Proofs. Joe Patten August 10, 2018

Transcription:

INTRODUCTION & PROPOSITIONAL LOGIC Dougherty, POLS 8000

Strategy in Politics Professor: Keith Dougherty Home Page: spia.uga.edu/faculty_pages/dougherk/ Office: Baldwin 408, (706)542-2989 e-mail: dougherk@uga.edu Office Hours: T&Th, 11:00am-12:00 p.m. and by appointment Political Science 1. Is political science an oxymoron? 2. Perhaps science is a method, not a subject. alchemy chemistry astrology astronomy social studies political science 3. Science requires at least two elements: a. internally consistent theories b. tests of those theories 4. Internally consistent theories: a. avoid contradictions like p and not p. b. make assumptions explicit, so they are not changed midstream. c. help assure that the conclusion follows from the premises (logically valid). d. allow researchers to handle complicated issues like strategic behavior. e. provide an explanation. 2

Strategy in Politics Professor: Home Page: Keith Dougherty http://spia.uga.edu/faculty_pages/dougherk/ Course Outline I. Introduction to Logic II. Social Choice Theory III. Game Theory A. Sequential Games. 1. Application: Marbury v Madison B. Simultaneous Games. 1. Application: ratification of the Constitution. C. Incomplete Information. 1. Application: the Cuban Missile Crisis D. Collective action theory and N-player games. 1. Application: international alliances. 2. Application: voter turnout and the political machines. 3

Strategy in Politics Professor: Home Page: Keith Dougherty http://spia.uga.edu/faculty_pages/dougherk/ Course Outline IV. Single Dimensional Spatial Voting. A. Median Voter Theorem. 1. Application: pivotal politics. 2. Application: Downs theory of mass elections. V. Multidimensional Spatial Voting. A. McKelvey s Chaos Theorem 1. Application: Government Formation in Parliaments. 2. Application: pivotal voting at the Constitutional Convention. 3. Application: the election of 1824. 4

Strategy in Politics Professor: Home Page: Keith Dougherty http://spia.uga.edu/faculty_pages/dougherk/ Grading Due Date Percent of Grade HOMEWORK 1 (social choice) Jan 20 20% HOMEWORK 2 (game theory) Feb 3 20% HOMEWORK 3 (n-player games) Mar 3 20% HOMEWORK 4 (spatial voting) Mar 31 20% RESEARCH PAPER Apr 21 20% Make-ups 1. Assignments will be lowered one letter grade for every working day they are late. Put late assignments under my office door (Baldwin 408). 5

Strategy in Politics Professor: Home Page: Keith Dougherty http://spia.uga.edu/faculty_pages/dougherk/ Other Business 1. All assignments are posted on my web page above (not e-commons). 2. Lectures will be updated by 11 pm Monday night -- at the latest. 3. Problem Solving a. The only way to learn math (and game theory) is through practice. b. I strongly recommend that you partner with at least one other student and pick one or two problems each week that you will solve. You can then compare answers to see if you are right. 4. Homeworks a. You must attempt to work through as much of the homeworks as possible on your own, and then work with other students only when you are stuck or want to check your answers. b. You need to write up your own answers, using your own words and explanations. If you turn in the exact same answer as another student, I will consider it academic dishonesty. Penalties apply. c. Every answer needs an explanation which includes how you derived the solution. d. Your answers should be neat. Hence, they will probably have to be re-written before they are turned in. 6

Strategy in Politics Professor: Home Page: Keith Dougherty http://spia.uga.edu/faculty_pages/dougherk/ Required Text 1. Dixit, Avinash, David H. Reiley, and Susan Skeath (1991) Games of Strategy, 3 nd ed. New York: W.W. Norton. 2. Olson, Mancur (1971) The Logic of Collective Action. New York: Harvard University Press. 3. Hinich, Melvin and Michael Munger (1997) Analytical Politics. New York: Cambridge University Press. 4. Articles in the dropbox, anything marked with an DP. Password: dougherty 7

Preliminaries A. What is formal theory? 1. Construction and analysis of mathematical models. 2. Includes decision theory, social choice, game theory, spatial voting theory, behavioral game theory, and agent based modeling (among others). 3. Rational choice theory is a particular type of formal theory. a. An actor is rational if he/she takes those actions that give him/her more preferred outcomes. b. Rational choice theory is a series of theories based on this premise. 4. Goal of formal theory: to explicitly deduce behavior that follows from a model s assumptions. 8

Preliminaries B. Why learn formal theory? 1. To understand cutting edge research in your field. 2. To make sure your conclusions follow from your premises (i.e. to develop internally consistent theories of politics). 3. To derive empirical implications of formal models developed by others. 9

Introduction to Logic A deductive argument is valid if the premises are related to the conclusion in such a way that the conclusion must be true if the premises are true. Premises are the statements upon which an argument is based. 10

Valid Arguments Example 1 It will either rain or snow tomorrow. It s too warm for snow. Therefore, it will rain tomorrow. Example 2 If today is Monday, then I have to teach today. Today is Monday. Therefore, I have to teach today. 11

Valid Arguments Valid Argument It will either rain or snow tomorrow. It s too warm for snow. Therefore, it will rain tomorrow. Valid, Formal Argument Let R = it will rain tomorrow. S = it will snow tomorrow. [(R v S) & ~S] R 12

Invalid Arguments Invalid Argument Bob is either liberal or conservative. All liberals support Obama. Bob supports Obama. Therefore, Bob is a liberal. 13

Logical Operators Operator Symbol Ordinary Language Negation ~ not Conjunction & and Disjunction V or (either or both) Conditional if, then Biconditional if and only if 14

Truth Table P Q ~P P & Q P V Q P Q P Q T T F F T F T F Statements: P, Q. Ex: P circuses are wonderful. Ex: Q joe likes circuses. 15

Truth Table P Q ~P P & Q P V Q P Q P Q T T F T F F F T T F F T 16

Truth Table P Q ~P P & Q P V Q P Q P Q T T F T T F F F F T T F F F T F 17

Truth Table P Q ~P P & Q P V Q P Q P Q T T F T T T F F F T F T T F T F F T F F 18

Truth Table P Q ~P P & Q P V Q P Q P Q T T F T T T T F F F T F F T T F T T F F T F F T Note: if P is not true, then P is not related to Q and anything goes. 19

Truth Table P Q ~P P & Q P V Q P Q P Q T T F T T T T T F F F T F F F T T F T T F F F T F F T T 20

Simple Proofs Using the Truth Table Show ~ (A & B) ~A v ~B A B ~A A & B ~B ~(A&B) ~A v ~B ~(A&B) ~A v ~B T T F T F F F T T F F F T T T T F T T F F T T T F F T F T T T T Tautology: a statement that is always true regardless of the truth value of its premises. Ex: regardless of whether P or Q are true, it is always the case that ~ (A & B) ~A v ~B. Theorems are conclusions that are deducible from premises. 21

Simple Proofs Using the Truth Table Contradiction: a statement that is always false regardless of the truth value of its premises. Ex: (A & ~A) A B ~A A & ~A T T F F T F F F F T T F F F T F 22

Valid Arguments Using the Truth Table [(p q) & (~q r) & ~r] ~p p q r p q ~q r ~r ~p [(p q)&(~q r)&~r [(p q)&(~q r)&~r] ~p T T T T T F F F T T T F T T T F T F 23

Valid Arguments Using the Truth Table [(p q) & (~q r) & ~r] ~p p q r p q ~q r ~r ~p [(p q)&(~q r)&~r [(p q)&(~q r)&~r] ~p T T T T T F F F T T T F T T T F T F Note: this statement is true if all of its premises are true, i.e. p, q, and r are true. Hence, it is valid. 24

Valid Arguments Using the Truth Table [(p q) & (~q r) & ~r] ~p p q r p q ~q r ~r ~p [(p q)&(~q r)&~r [(p q)&(~q r)&~r] ~p T T T T T F F F T T T F T T T F T F However, the statement is not a tautology because it is false for at least one set of truth values the green case above. 25

Conclusion 1. In general, formal theorists want to use valid arguments and tautologies to derive conclusions. 2. Formal theorists want to avoid contradictions. 3. They formalize political processes (i.e. put statements in mathematical form) because math and logic helps them assure that the conclusion follows from the premises. 4. Almost all theories are conditional: A B. a. What if the premises are false (i.e. ~ A)? b. Should we test formal theories? c. We cannot test whether a deduction follows using data. But we can test whether the assumptions are true or whether the theory as a whole applies to a topic of interest. d. Clarke, Kevin. A., & Primo, David M. (2012). A model discipline: Political science and the logic of representations. Oxford University Press. 26