The Art About Statements Chapter 8 “Say what you mean and mean what you say” By Alexandra Swindell Class Four Philosophical Questions.

Slides:



Advertisements
Similar presentations
Reason and Argument Chapter 7 (1/2).
Advertisements

Basic Terms in Logic Michael Jhon M. Tamayao.
Computing Truth Value.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
With examples from Number Theory
Logic & Critical Reasoning Translation into Propositional Logic.
Introduction to Proofs
PROOF BY CONTRADICTION
Logic & Critical Reasoning
Deductive Arguments: Categorical Logic
Descartes’ rationalism
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Conditional Propositions and Logical Equivalence.
Copyright © Cengage Learning. All rights reserved.
Modality Possible Worlds. Possibility and Necessity Triangles have three sides. The Wassermans have two kids.
Logic. To Think Clearly Use reason, instead of relying on instinct alone What is Logic? – “the art of reasoning” – The study of truth – The ethics of.
Categories and On Interpretation Philosophy 21 Fall, 2004 G. J. Mattey.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Topics and Posterior Analytics Philosophy 21 Fall, 2004 G. J. Mattey.
From Chapter 4 Formal Specification using Z David Lightfoot
PHIL 120: Jan 8 Basic notions of logic
Adapted from Discrete Math
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Discrete Mathematics and Its Applications
Categorical Propositions All S is P No S is P Some S is P Some S is not P.
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Logical Arguments. Strength 1.A useless argument is one in which the truth of the premisses has no effect at all on the truth of the conclusion. 2.A weak.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Review I Rosen , 3.1 Know your definitions!
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Chapter 3: Knowledge Kant’s Revolution Introducing Philosophy, 10th edition Robert C. Solomon, Kathleen Higgins, and Clancy Martin.
Slides for CISC 2315: Discrete Structures Chapters CISC 2315 Discrete Structures Professor William G. Tanner, Jr. SPRING 2010 Slides created by James.
The Science of Good Reasons
Philosophy 148 Chapter 7. AffirmativeNegative UniversalA: All S are PE: No S is P ParticularI: Some S is PO: Some S is not P.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
Unit 1D Analyzing Arguments. TWO TYPES OF ARGUMENTS Inductive Deductive Arguments come in two basic types:
Logic A: Capital punishment is immoral. B: No it isn’t! A: Yes it is! B: Well, what do you know about it? A: I know more about it then you do! B: Oh yeah?
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
LECTURE 19 THE COSMOLOGICAL ARGUMENT CONTINUED. THE QUANTUM MECHANICAL OBJECTION DEPENDS UPON A PARTICULAR INTERPRETATION WE MIGHT REASONABLY SUSPEND.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 1: The Foundations: Logic and Proofs
Thinking Mathematically Statements, Negations, and Quantified Statements.
Anselm’s “1st” ontological argument Something than which nothing greater can be thought of cannot exist only as an idea in the mind because, in addition.
The Ontological Argument for the Existence of God August 15, 2015 George Cronk, J.D., Ph.D. Professor of Philosophy & Religion Bergen Community College.
Giving good reasons. When listening to others, we cannot concentrate only on our own feelings and reactions We must listen to what they are saying.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
Notions & Notations - 1ICOM 4075 (Fall 2010) UPRM Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Fall 2010 ICOM.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Chapter 1 Logic and Proof.
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
The ontological argument
CSNB 143 Discrete Mathematical Structures
CISC 2315 Discrete Structures
O.A. so far.. Anselm – from faith, the fool, 2 part argument
Theme № 14. Conclusion The plan: 1. Essence of conclusion.
Chapter 8 Logic Topics
Truth Tables Hurley
Copyright © Cengage Learning. All rights reserved.
Concise Guide to Critical Thinking
Foundations of Discrete Mathematics
Chapter 5 Parallel Lines and Related Figures
Evaluating Deductive Arguments
Presentation transcript:

The Art About Statements Chapter 8 “Say what you mean and mean what you say” By Alexandra Swindell Class Four Philosophical Questions

What is a statement? A speech which signifies something true or false. It signifies that something is or is not so. Statement: I went to the store. Not a Statement: Go to the Store.

True or False? This depends on whether or not a statement signifies something that agrees with reality. Statements about future events are neither true or false. “Truth is the conformance of the mind with reality.”

Kinds of Statements Simple: one thing is affirmed or denied of another. Compound: composed of simple statements 3 Types – And: “I ran to the store and bought ice cream.” – If then {Hypothetical}: “(If a man is a saint) antecedent, (then he will go to Heaven) consequent. – Either-Or: “A number is either odd or even.”

Dividing Simple Statements Separate the noun and verb (they are both kinds of words or names.) A noun is a word which signifies without time. A verb is a word which signifies with time, and which is a sign of something said of a subject.

Kinds of Simple Statements Affirmative: Trees are plants Negative: Trees are not plants. Universal: All trees are plants. Particular: Some trees are plants.

Contradictions “ A statements is contradictory to another statement with the same subject and predicate when both statements cannot be true or false at the same time.” A statement can also be contrary to another statement with the same subject and predicate when both statements cannot be true at the same time, but can be false at the same time.

True and False in Compound Statements When we are stating whether it is true or false we must look at the entire statements and follow the rules of contradiction.

Modal Statement Indicating explicitly in the statement itself, the manner, or mode, of connection which the subject has with the predicate is a modal statement. “ It is necessary that the sun will rise tomorrow.” When comparing the kinds of oppositions which may exist between modal statements, a modal statement which expresses necessity is equivalent to a universal affirmative statement since something which is necessarily connected is connected in every case.

Per Se Statements Sometimes a statement can only be known to be true with certitude when it is the conclusion of some argument, that is prove the statement is true. There must be some statements which can be known to be true through themselves, without a proof. These are called self evident statements…

Continued Per se “ through itself” is when the subject itself is the cause of the predicate belonging to the subject. 1.When the predicate is in the definition of the subject. 2.When the subject is the definition of the predicate. 3.When the predicate belongs to the subject as to its cause.

EL Fin Per se statements are the anchors which guarantee certitude to all other statements which are concluded from them by way of an argument, so they are the most certain and fundamental truths which we can know.