# Hypothetical Syllogisms 1

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Phil 2302 Intro to Logic Dr. Naugle Hypothetical Syllogisms 1 Compound syllogisms are composed of different kinds of sentences in their premises and conclusions (not just categorical propositions, statements or sentences). Compound syllogisms are more familiar and are more often used than categorical syllogisms, and the rules of their uses are much easier to grasp. There are several kinds of compound syllogisms including hypothetical, disjunctive, conjunctive, dilemmas, and sorites. Today, hypothetical syllogisms (and a little symbolic logic as well). I. Hypothetical Syllogisms A. Definition A hypothetical syllogism is built around a hypothetical statement which takes the form: "IF... THEN." Hypothetical syllogisms are not entirely hypothetical, but one of its premises is. Three hypothetical statements would not lead to any conclusion! "IF... THEN." "IF... THEN." Therefore, "IF... THEN." Rather, this kind of syllogism must be constructed of a conditional major premise, and an unconditional minor premise leading to an unconditional conclusion. 1. A conditional major premise. 2. An unconditional minor premise. 3. An unconditional conclusion. Rather than having three terms as categorical syllogisms do, a hypothetical syllogism has only two terms. Instead of talking about subjects and predicates, here we will be talking about antecedents and consequents. * The antecedent is the "IF" part of the statement. It states the condition under which the "THEN" part is true. 1 NB: This material is taken from several logic texts authored by N. Geisler, H. Kahane, and others. I make no claim to originality in this material.

2 * The consequent is the "THEN" part, the consequence of or what follows from the antecedent if the "IF" part is true. All the minor premise has to do is say that the "IF" part "is" (modus ponens) or the "THEN" part "is not" (modus tollens). Either way, the conclusion is valid. IF (antecedent; first term)... then (consequent; second term). B. MODUS PONENS: Affirming the Antecedent 1. Definition The first way to get a valid conclusion from a hypothetical or conditional premise is to affirm the antecedent, which in Latin is called modus ponens (lit. way of affirmation). That is, the minor or second premise will assert that the antecedent or "if" is not just a speculation, but a reality. And if the "if" is true, then the "then" has to follow, and that becomes the conclusion. In symbolic logic (which simply uses symbols instead of words to indicate relations), the sideways horseshoe indicates and "if,... then" relation. If P, then Q P Therefore, Q P... Q P Q 2. Examples of valid modus ponens syllogisms (see fallacies below): 1. If you can put an argument into symbolic logic that looks like this (P), then you have a modus ponens argument (Q). 2. You can put an argument into symbolic logic that looks like this (P). 3. Therefore, you have a modus ponens argument (Q)! 1. If Jesus Christ arose from the dead (P), then he is the Son of God (Q). 2. Jesus Christ arose from the dead (P). 3. Therefore He is the Son of God (Q). 1. If a contingent being exists (P), then a necessary being must exist as its cause (Q). 2. A contingent being exists (P). 3. Therefore, a necessary being must exist as its cause (Q).

3 1. If there is design in the universe (d), then there must have been a Designer (D) 2. There is design in the universe (d). 3. Therefore, there must have been a designer (D). 2. I am Chinese. 3. Therefore, I am human. C. MODUS TOLLENS: Denying the Consequent 1. Definition: The other valid form of the hypothetical syllogism is to deny that the consequent is true. Modus ponens in Latin means "the way of affirmation," and, correspondingly, modus tollens in Latin means to "the way of negation" Hence, the hypothetical modus tollens syllogistic arguments are those which deny the consequent of a hypothetical statement, thereby negating the antecedent as well. If there is a real connection between the antecedent and the consequent (the "if" and the "then,"), and the consequent is false, then the antecedent must be false also. Denying the consequent also involves the denial of the antecedent as well. So modus tollens is the reverse of modus ponens. If the antecedent were true, then so would the consequent (that's what modus ponens said!). If P, then Q Not Q Therefore, not P. P... Q ~ Q ~ P 1. If anyone is born of God, then he loves his brothers. 2. Adolph does not love his brothers. 3. Therefore, Adolph is not born of God. 1. If the president acts forcefully, he will gain in the polls. 2. He is not gaining in the polls. 3. Therefore, the president is not acting forcefully. 1. If the national debt is paid off with inflated money, then borrowers will benefit and lenders will be harmed. 2. Borrowers are not benefited, and lenders are not harmed. 3. Therefore, the national debt is not being paid off with inflated money.

4 1. If a world government is established, wars will cease. 2. Wars are not ceasing. 3. Therefore, a world government is not being established. 1. If I have cash, I will loan you money. 2. I am not loaning you money. 3. Therefore, I do not have cash. 2. I am not human. 3. Therefore, I am not Chinese. II. Fallacies of the Hypothetical Syllogism A valid hypothetical syllogism either denies the consequent (modus tollensm.t.d.c.) or affirms the antecedent (modus ponens-m.p.a.a.) of the major premise; it does not deny the antecedent or affirm the consequent. A. Denying the Antecedent: That a particular condition is not fulfilled is not any proof that the consequent has not occurred since some other condition with which the consequent may be connected may be the cause of its fulfillment. 1. If abortion is murder, then it is wrong. 2. But abortion isn't murder. 3. Therefore, it is not wrong. 1. If Tom is late for work, then he will not attend the meeting. 2. Tom is not late for work. 3. Therefore, Tom will attend the meeting. 2. I am not Chinese. 3. Therefore, I am not human. 1. If my name is Archibald, I am male. 2. My name is not Archibald. 3. Therefore, I am not male. 1. If Hawaii is ready for statehood, then Alaska is ready for statehood. 2. Hawaii is not ready for statehood. 3. Therefore, Alaska is not ready for statehood.

5 B. Affirming the Consequent: The connection of a consequent with a condition (or antecedent) does not preclude the possibility that there are other conditions upon which the same consequent may follow. To affirm the consequent is no guarantee that the specified condition produced it. The fact that the consequent may have occurred is no proof or guarantee of that particular condition or antecedent. 1. If a member of the House of Commons is declared bankrupt, he loses his seat. 2. He has lost his seat. 3. Therefore, he is declared bankrupt. 1. If reincarnation is true, then past life regression therapy will work. 2. Past life regression therapy works. 3. Therefore, reincarnation is true. 1. If Reagan is still president, then a liar is in the White House. 2. A liar is in the White House. 3. Therefore, Reagan is president. 2. I am human 3. Therefore, I am Chinese 1. If my name is Archibald, I am male. 2. I am male 3. Therefore, my name is Archibald. 1. If Hawaii is ready for statehood, then Alaska is ready for statehood. 2. Alaska is ready for statehood. 3. Therefore, Hawaii is ready for statehood. Conclusion: When you spot a conditional argument, you can test its validity very easily. First, make sure you know what the conditional or major premise is. Second, see whether the minor premise affirms or denies the antecedent or consequent in the major premise. If it affirms the antecedent or denies the consequent, a conclusion can be drawn and it is valid. Otherwise not.

### def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

### Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula

### 1.2 Forms and Validity

1.2 Forms and Validity Deductive Logic is the study of methods for determining whether or not an argument is valid. In this section we identify some famous valid argument forms. Argument Forms Consider

### WHAT IS PHILOSOPHY? ARGUMENTATIO N. Intro to Philosophy, Summer 2011 Benjamin Visscher Hole IV

WHAT IS PHILOSOPHY? ARGUMENTATIO N Intro to Philosophy, Summer 2011 Benjamin Visscher Hole IV PHILOSOPHY CONSISTS IN CRITICAL ENGAGEMENT The philosophers we re reading have developed arguments to try to

### n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

### Definition 10. A proposition is a statement either true or false, but not both.

Chapter 2 Propositional Logic 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, Alice s Adventures

### Inference Rules and Proof Methods

Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument

### Discrete Mathematics Lecture 1 Logic of Compound Statements. Harper Langston New York University

Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University Administration Class Web Site http://cs.nyu.edu/courses/summer05/g22.2340-001/ Mailing List Subscribe at

### DISCRETE MATH: LECTURE 3

DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false

### CHAPTER 1. Logic, Proofs Propositions

CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: Paris is in France (true), London

### Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

### LOGICAL INFERENCE & PROOFs. Debdeep Mukhopadhyay Dept of CSE, IIT Madras

LOGICAL INFERENCE & PROOFs Debdeep Mukhopadhyay Dept of CSE, IIT Madras Defn A theorem is a mathematical assertion which can be shown to be true. A proof is an argument which establishes the truth of a

### What is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:

Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language

### Computing Science 272 Solutions to Midterm Examination I Tuesday February 8, 2005

Computing Science 272 Solutions to Midterm Examination I Tuesday February 8, 2005 Department of Computing Science University of Alberta Question 1. 8 = 2+2+2+2 pts (a) How many 16-bit strings contain exactly

### Rules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05

Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings

### Beyond Propositional Logic Lukasiewicz s System

Beyond Propositional Logic Lukasiewicz s System Consider the following set of truth tables: 1 0 0 1 # # 1 0 # 1 1 0 # 0 0 0 0 # # 0 # 1 0 # 1 1 1 1 0 1 0 # # 1 # # 1 0 # 1 1 0 # 0 1 1 1 # 1 # 1 Brandon

### CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### Logic and Proofs. Chapter 1

Section 1.0 1.0.1 Chapter 1 Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers 1.5 Rules of Inference 1.6 Introduction to Proofs

### 1 Proposition, Logical connectives and compound statements

Discrete Mathematics: Lecture 4 Introduction to Logic Instructor: Arijit Bishnu Date: July 27, 2009 1 Proposition, Logical connectives and compound statements Logic is the discipline that deals with the

### Paraphrasing Arguments

1 Paraphrasing Arguments Department of Philosophy Middlebury College Written August, 2012 Table of Contents Introduction... 1 1. Common argument patterns... 2 1.1. Modus ponens... 3 1.2. Modus tollens...

### Lecture 2: Moral Reasoning & Evaluating Ethical Theories

Lecture 2: Moral Reasoning & Evaluating Ethical Theories I. Introduction In this ethics course, we are going to avoid divine command theory and various appeals to authority and put our trust in critical

### Discrete Mathematics, Chapter : Propositional Logic

Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.1-1.3 1 / 21 Outline 1 Propositions

### DEDUCTIVE & INDUCTIVE REASONING

DEDUCTIVE & INDUCTIVE REASONING Expectations 1. Take notes on inductive and deductive reasoning. 2. This is an information based presentation -- I simply want you to be able to apply this information to

### INTRODUCTION TO LOGIC

INTRODUCTION TO LOGIC A. Basic Concepts 1. Logic is the science of the correctness or incorrectness of reasoning, or the study of the evaluation of arguments. 2. A statement is a declarative sentence,

### WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

### DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

### Propositional Logic. Definition: A proposition or statement is a sentence which is either true or false.

Propositional Logic Definition: A proposition or statement is a sentence which is either true or false. Definition:If a proposition is true, then we say its truth value is true, and if a proposition is

### Phil 2302 Intro to Logic. Introduction to Induction i

Phil 2302 Intro to Logic Introduction to Induction i "The object of reasoning is to find out, from the consideration of what we already know, something else which we do not know. Consequently, reasoning

### Lecture Notes William L. Rowe, The Problem of Evil and Some Varieties of Atheism (1979) Keith Burgess-Jackson 22 November 2015

Lecture Notes William L. Rowe, The Problem of Evil and Some Varieties of Atheism (1979) Keith Burgess-Jackson 22 November 2015 Introduction. Rowe (1931-2015) asks and answers three interrelated questions

### Review Name Rule of Inference

CS311H: Discrete Mathematics Review Name Rule of Inference Modus ponens φ 2 φ 2 Modus tollens φ 2 φ 2 Inference Rules for Quantifiers Işıl Dillig Hypothetical syllogism Or introduction Or elimination And

### 1.5 Methods of Proof INTRODUCTION

1.5 Methods of Proof INTRODUCTION Icon 0049 Two important questions that arise in the study of mathematics are: (1) When is a mathematical argument correct? (2) What methods can be used to construct mathematical

### 2. Propositional Equivalences

2. PROPOSITIONAL EQUIVALENCES 33 2. Propositional Equivalences 2.1. Tautology/Contradiction/Contingency. Definition 2.1.1. A tautology is a proposition that is always true. Example 2.1.1. p p Definition

### CSI 2101 Discrete Structures Winter 2012

CSI 2101 Discrete Structures Winter 2012 Prof. Lucia Moura University of Ottawa Homework Assignment #1 (100 points, weight 5%) Due: Thursday Feb 9, at 1:00 p.m. (in lecture); assignments with lateness

### The Predicate Calculus in AI

Last time, we: The Predicate Calculus in AI Motivated the use of Logic as a representational language for AI (Can derive new facts syntactically - simply by pushing symbols around) Described propositional

### Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24

### Fundamentals of Mathematics Lecture 6: Propositional Logic

Fundamentals of Mathematics Lecture 6: Propositional Logic Guan-Shieng Huang National Chi Nan University, Taiwan Spring, 2008 1 / 39 Connectives Propositional Connectives I 1 Negation: (not A) A A T F

### 1. Use the following truth table to answer the questions.

Topic 3: Logic 3.3 Introduction to Symbolic Logic Negation and Conjunction Disjunction and Exclusive Disjunction 3.4 Implication and Equivalence Disjunction and Exclusive Disjunction Truth Tables 3.5 Inverse,

### Midterm Examination 1 with Solutions - Math 574, Frank Thorne Thursday, February 9, 2012

Midterm Examination 1 with Solutions - Math 574, Frank Thorne (thorne@math.sc.edu) Thursday, February 9, 2012 1. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### Deductive versus Inductive Reasoning

Deductive Arguments 1 Deductive versus Inductive Reasoning Govier has pointed out that there are four basic types of argument: deductive, inductive generalization, analogical, and conductive. For our purposes,

### SAMPLE ASSESSMENT TASKS PHILOSOPHY AND ETHICS ATAR YEAR 11

SAMPLE ASSESSMENT TASKS PHILOSOPHY AND ETHICS ATAR YEAR 11 Copyright School Curriculum and Standards Authority, 2014 This document apart from any third party copyright material contained in it may be freely

### BASIC COMPOSITION.COM USING LOGIC

BASIC COMPOSITION.COM USING LOGIC As we have noted, Aristotle advocated that persuasion comes from the use of different kinds of support, including natural and artificial forms of support. We have discussed

### Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is

### Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

### LOGIC AND SETS CLAST MATHEMATICS COMPETENCIES

5 LOGIC AND SETS CLAST MATHEMATICS COMPETENCIES IE1: IIE1: IIE2: IIE3: IIE4: IIIE1: IIIE2: IVE1: Deduce facts of set inclusion or set non-inclusion from a diagram Identify statements equivalent to the

### CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo

Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete

### Generalized Modus Ponens

Generalized Modus Ponens This rule allows us to derive an implication... True p 1 and... p i and... p n p 1... p i-1 and p i+1... p n implies p i implies q implies q allows: a 1 and... a i and... a n implies

### Introduction. I. Proof of the Minor Premise ( All reality is completely intelligible )

Philosophical Proof of God: Derived from Principles in Bernard Lonergan s Insight May 2014 Robert J. Spitzer, S.J., Ph.D. Magis Center of Reason and Faith Lonergan s proof may be stated as follows: Introduction

### Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists.

11 Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists. The phrases, for all x in R if x is an arbitrary

### Mathematical Induction. Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition)

Mathematical Induction Rosen Chapter 4.1 (6 th edition) Rosen Ch. 5.1 (7 th edition) Mathmatical Induction Mathmatical induction can be used to prove statements that assert that P(n) is true for all positive

### Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

### Logic in general. Inference rules and theorem proving

Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent

### Development of a computer system to support knowledge acquisition of basic logical forms using fairy tale "Alice in Wonderland"

Development of a computer system to support knowledge acquisition of basic logical forms using fairy tale "Alice in Wonderland" Antonija Mihaljević Španjić *, Alen Jakupović *, Matea Tomić * * Polytechnic

### DEDUCTIVE REASONING 1

DEDUCTIVE REASONING 1 Deductive Reasoning Reaching a conclusion from some given premises. All pop-stars p are stupid Merve is a popstar Therefore, Merve is stupid 2 Conditional Reasoning Deductive validity

### CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:

### Slippery Slopes and Vagueness

Slippery Slopes and Vagueness Slippery slope reasoning, typically taken as a fallacy. But what goes wrong? Is it always bad reasoning? How should we respond to a slippery slope argument and/or guard against

### Deduction by Daniel Bonevac. Chapter 5 Quantifiers

Deduction by Daniel Bonevac Chapter 5 Quantifiers Limitations of sentential logic Sentential logic is useful, but there are many logical relationships that it simply can not represent. For example, sentential

### Examination paper for MA0301 Elementær diskret matematikk

Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750

### If God, Why Evil? Copyright 2010 by R Douglas Geivett

If God, Why Evil? Copyright 2010 by R Douglas Geivett 1 Alfred Lord Tennyson Robert Burns 2 3 4 Outline of Our Topic What is the Problem of Evil? Two Forms of the Argument from Evil against Theism An Argument

### Contradictions in Scripture: The Denials of Peter

That I may know Him and the power of His resurrection, and the fellowship of His sufferings, being conformed to His death. Philippians 3:10. Contradictions in Scripture: The Denials of Peter It has long

### Philosophy 120: Introductory Logic Summer 2007

Class: Date: Philosophy 120: Introductory Logic Summer 2007 Multiple Choice Identify the letter of the choice that best completes the statement or answers the question. INSTRUCTIONS: The following selections

### Kant s deontological ethics

Michael Lacewing Kant s deontological ethics DEONTOLOGY Deontologists believe that morality is a matter of duty. We have moral duties to do things which it is right to do and moral duties not to do things

### HUMN-218 COURSE SYLLABUS FOR LOGIC AND CRITICAL THINKING. Jill R. Wood Instructor

Coffeyville Community College HUMN-218 COURSE SYLLABUS FOR LOGIC AND CRITICAL THINKING Jill R. Wood Instructor COURSE NUMBER: HUMN-218 COURSE TITLE: Logic and Critical Thinking CREDIT HOURS: 3 INSTRUCTOR:

### I WISH A VALID ONTOLOGICAL ARGUMENT?

A VALID ONTOLOGICAL ARGUMENT? I WISH to discuss Professor Malcolm's absorbingly powerful defense of a version of Anselm's ontological proof for the existence of God.' Professor Malcolm believes "that in

### WELCOME TO GOD S FAMILY

WELCOME TO GOD S FAMILY To all who received him, to those who believed in his name, he gave the right to become children of God children born not of natural descent, nor of human decision or a husband

### Subjects, Predicates and The Universal Quantifier

Introduction to Logic Week Sixteen: 14 Jan., 2008 Subjects, Predicates and The Universal Quantifier 000. Office Hours this term: Tuesdays and Wednesdays 1-2, or by appointment; 5B-120. 00. Results from

### Syllogisms and Fallacies 101

1 Syllogisms and Fallacies 101 This isn t a course in logic, but all educated people should know the basic vocabulary and the basic underlying logic of the syllogism. Major premise: No reptiles have fur.

### CSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi

Propositional Logic: logical operators Negation ( ) Conjunction ( ) Disjunction ( ). Exclusive or ( ) Conditional statement ( ) Bi-conditional statement ( ): Let p and q be propositions. The biconditional

### Statements, negations, connectives, truth tables, equivalent statements, De Morgan s Laws, arguments, Euler diagrams

Logic Statements, negations, connectives, truth tables, equivalent statements, De Morgan s Laws, arguments, Euler diagrams Part 1: Statements, Negations, and Quantified Statements A statement is a sentence

### ARE CONDITIONAL AND DISJUNCTION REALLY COMPARABLE? 1

UNIVERSUM Vol. 28 Nº 2 2013 Universidad de Talca Are conditional and disjunction really comparable? Miguel López Astorga Pp. 229 a 242 ARE CONDITIONAL AND DISJUNCTION REALLY COMPARABLE? 1 Son el condicional

### How s Your Love Life? (A Superlative Witness You Belong to Jesus) 1 John 3:11-18

1 How s Your Love Life? (A Superlative Witness You Belong to Jesus) 1 John 3:11-18 Introduction: 1) One of the most effective ways of teaching is using contrast and comparisons. For example if I say male

### Exam 2 Review Problems

MATH 1630 Exam 2 Review Problems Name Decide whether or not the following is a statement. 1) 8 + 5 = 14 A) Statement B) Not a statement 1) 2) My favorite baseball team will win the pennant. A) Statement

### Introduction to Predicate Calculus

Introduction to Predicate Calculus 1 Motivation Last time, we discuss the need for a representation language that was declarative, expressively adequate, unambiguous, context-independent, and compositional.

### PHILOSOPHY 101: CRITICAL THINKING

PHILOSOPHY 101: CRITICAL THINKING [days and times] [classroom] [semester] 20YY, [campus] [instructor s name] [office hours: days and times] [instructor s e-mail] COURSE OBJECTIVES AND OUTCOMES 1. Identify

### Invalidity in Predicate Logic

Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional

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

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

### Resolution in Propositional and First-Order Logic

Resolution in Propositional and First-Order Logic Inference rules Logical inference creates new sentences that logically follow from a set of sentences (KB) An inference rule is sound if every sentence

### Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto

### FOUR STEWARDSHIP SUNDAY SCHOOL LESSONS FOR ADULTS

FOUR STEWARDSHIP SUNDAY SCHOOL LESSONS FOR ADULTS Writer: Rick Ellison State Missionary Alabama Baptist Convention State Board of Missions Copyright 2007, Office of Sunday School, Alabama Baptist Convention,

### First Order Predicate Logic. Lecture 4

First Order Predicate Logic Lecture 4 First Order Predicate Logic Limitation of Propositional Logic The facts: peter is a man, paul is a man, john is a man can be symbolized by P, Q and R respectively

### Consistency, completeness of undecidable preposition of Principia Mathematica. Tanmay Jaipurkar

Consistency, completeness of undecidable preposition of Principia Mathematica Tanmay Jaipurkar October 21, 2013 Abstract The fallowing paper discusses the inconsistency and undecidable preposition of Principia

### Reflection Questions

Reflection Questions This section of the book features questions for reflection related to each chapter. The suggested uses are the following: 1) For an individual study, the reader can use these questions

### Logical Argument. Statements are either true or false. Nonstatements are neither true nor false. Non statements are never premises or conclusions.

Logical Argument Logic is the study of arguments. It is used to analyze an argument or a piece of reasoning, and work out whether it is correct (valid) or not (invalid). An argument is a conclusion with

### (Refer Slide Time: 05:02)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 1 Propositional Logic This course is about discrete

### Section 1.3: Predicate Logic

1 Section 1.3: Purpose of Section: To introduce predicate logic (or first-order logic) which the language of mathematics. We see how predicate logic extends the language of sentential calculus studied

### Weekly Meal Prayers. A family faith formation opportunity as you prepare for First Holy Communion

Weekly Meal Prayers A family faith formation opportunity as you prepare for First Holy Communion Plan a weekly meal with prayer for six Sundays before First Holy Communion. If Sundays do not work for your

### Discrete Math I Practice Problems for Exam I

Discrete Math I Practice Problems for Exam I The ucoming exam on Thursday, January 12 will cover the material in Sections 1 through 6 of Chater 1. There may also be one question from Section 7. If there

### Introduction. 1. The real distinction between existence and essence. 2. The requirement that existences precede essence.

A Contemporary Thomistic Metaphysical Proof of God (with a response to Richard Dawkins The God Delusion) Robert J. Spitzer, S.J., Ph.D., (Magis Institute) November 2015 Introduction Though there are many

### Heuristic Strategies and Deductive Reasoning in Problem Solving

Heuristic Strategies and Deductive Reasoning in Problem Solving Seminar Report Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy by Prajish Prasad Roll No : 154380001

### Office Hours: T Th 2:15 3:30pm. Fine Arts 102

Philosophy 6 (0449): T Th 11:10 12:35pm. NEA 101 Office Hours: T Th 2:15 3:30pm. Fine Arts 102 klyngj@lahc.edu Instructor: Jonathon Klyng Email: Textbook/Readings: 1. (Required)Patrick J Hurley. A Concise

### UCLA Anderson School of Management Daniel Andrei, Option Markets 232D, Fall MBA Final Exam. December 2012

UCLA Anderson School of Management Daniel Andrei, Option Markets 232D, Fall 2012 MBA Final Exam December 2012 Your Name: Your Equiz.me email address: Your Signature: 1 This exam is open book, open notes.

### Phil 1010, Practice Final Exam George Rainbolt s Section, Fall 2008

Phil 1010, Practice Final Exam George Rainbolt s Section, Fall 2008 I. Statement Types: for each of the following statements, identify its type. If a statement contains two or more types, choose the type

### Truth Conditional Meaning of Sentences. Ling324 Reading: Meaning and Grammar, pg

Truth Conditional Meaning of Sentences Ling324 Reading: Meaning and Grammar, pg. 69-87 Meaning of Sentences A sentence can be true or false in a given situation or circumstance. (1) The pope talked to

Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior

### Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 L A TEX at July 18, 2007 1 No part of this book can be reproduced without permission from the authors 2 Illinois State University, Normal,