Diodorus s Master Argument Nino B. Cocchiarella For Classes IC and IIC Students of Professor Giuseppe Addona
|
|
- Caitlin Watts
- 5 years ago
- Views:
Transcription
1 Diodorus s Master Argument Nino B. Cocchiarella For Classes IC and IIC Students of Professor Giuseppe Addona In my Remarks on Stoic Logic that I wrote for you last year, I mentioned Diodorus Cronus s trilemma, or master argument. This is the argument that Diodorus gave in defence of his threefold claim: 1. what is possible is what is or will be the case, 2. what is necessary is what is and always will be the case, and 3. what is impossible is what neither is nor ever will be the case. Unfortunately, like so much of what was written in ancient times, we do not know the details of Diodorus s argument. We do know, as I mentioned in my Remarks, that both Chrysippus, who rst developed stoic logic, and Diodorus s pupil, Philo, disagreed with Diodorus about the meaning of possibility and necessity. But even though they disagreed with Diodorus s conclusion, they did think that his argument for that conclusion was valid. A valid argument is not the same as a sound argument, however. An argument is valid if it is impossible to have the premises true and the conclusion false. A sound argument is both valid and has true premises, which means that the conclusion of a sound argument must also be true. Chrysippus and Philo said that the conclusion of Diodorus s argument was not true even though they thought that the argument was valid. That means that they had to reject one or more of his premises, or assumptions. In this note I would like to discuss these premises and a possible reconstruction of Diodorus s argument. 1 Tensed Propositions Many philosophers think that propositions are either eternally true or eternally false. This may be because they think that propositions are abstract entities like numbers and do not exist in time. Of course a statement such as = 5 is not just sometimes true but always true. The stoics did not believe in abstract entities, but they were unsure about the nature of propositions (lekta). Nevertheless, whether propositions are abstract entities or not, for Diodorus propositions are tensed so that a proposition, such as is expressed by the sentence The pope is Italian, might be true in the past but not true now in the present, and that a proposition such as George W. Bush is president is of the USA is true now but will be false in the future. As noted in my Remarks we can represent the tensed aspect of a proposition by means of tense operators, such as P and F, which we can read as: P : It was the case that... and F : It will be the case that.... 1
2 We assume that the present tense is represented by the present tense of the verb or predicate of a sentence. Then, just as we have the following reading: :F p : It will never be the case the case that p so too we have the following: :F :p : It will always be the case that p and :P :p : It was always be the case that p. Diodorus s claim that a proposition p is possible if, and only if, it is either true or will be true can then be represented as: p $ p _ F p; where p is read as It is is possible that p. Similarly, Diodorus s claims that a proposition p is necessary if, and only if, p is true and always will be true hereafter can be represented by: p $ p ^ :F :p; where p is read as it is necessary that p. His claim that p is impossible if, and only if, p is false and never will be true hereafter can be represented by: :p $ :p ^ :F p. These three claims are really equivalent to one another. The two about possibility and impossibility are clearly equivalent given that the negation of a disjunction is equivalent to a conjunction of negations. The claim about necessity follows from the duality of necessity and possibility, i.e., that p $ ::p. I will hereafter not distinguish between the three claims but just discuss Diodorus s claim for possibility, i.e., his claim that what is possible is what is or will be the case: p $ p _ F p: This is the claim for which Diodorus is most remembered. It is an important claim because it purports to tell us how the concept of possibility (and necessity) is to be understood in terms of time, i.e., in terms of our talk about the past, the present and future. We should also keep in mind here that in addition to a discussion of possibility and necessity, the Stoics were the rst to develop classical truth-functional propositional logic, which we will assume hereafter. 2
3 2 The Unalterability of the Past In the few commentaries on Diodorus Cronus s trilemma, there are two main premises. These are: (1) An impossible proposition never follows from a possible one. (2) Every true proposition about the past is necessary. The denial of Diodorus s claim about possibility is the third part of Diodorus s trilemma. This denial is: (3) There is a proposition that is possible, but which is not true now nor ever will be true (in the future). A trilemma is a collection of three propositions that are said to be in con ict and cannot all be taken as true. (A dilemma consists of two propositions that are said to be in con ict and cannot both be accepted as true.) Diodorus said that the premises (1) and (2) must be taken as true and therefore that (3) must be false, which is Diodorus s thesis about possibility, namely: A proposition is possible if, and only if, it is either true (now) or will be true. The question is: are (1) and (2) true? And does (1) and (2) really imply that (3) is false, and hence that possibility means what Diodorus said it means? What was Diodorus s argument for why (1) and (2) imply (3)? Let us consider premise (1) rst. This is the statement that an impossible proposition cannot follow from a possible proposition. It certainly seems to be true and unproblematic. An equivalent way of stating this is that if p follows from q, i.e., if q implies p, then q is possible only if p is possible. In modal terms we can represent the statement that q implies p as the necessity of the conditional (q! p), i.e., as (q! p). Then premise (1) is equivalent to the following modal thesis: (q! p)! (q! p); (A) This thesis, (A), is equivalent to the modal law of the distribution of over!, i.e., (q! p)! (q! p); and this law is a basic law of every modal logic. It is, in other words the most minimal statement you can make about necessity and possibility. (Can you see why these last two formulas are equivalent? Note that we can substitute complex sentences for p and q, e.g.,substitution of :p for p and :q for q will show you why the two formulas are equivalent theses.) What the sentence (A) says is that if q implies p, then q is possible only if p is possible. Can you see why this is a modal way of representing premise (1)? Stated in this way we can clearly accept premise (1). What about premise (2)? Do you think it is true? Doesn t it say that we cannot change the past, and therefore a true proposition about the past 3
4 is necessary. What about time travel? Can we someday travel in time and change the past? Can God change the past? Aristotle did not think so. In his Nichmachean Ethics, Aristotle says that what is done cannot be undone and that Agathon is right when he says even God is deprived the power of making what has been done not to have happened (Book 6, chapter 2). God could have made another world in which the past was di erent, but could God change the past of our world and it still be our world? Note that if a proposition p was true, i.e., if it was the case that p, then P p is now true and will henceforth always be true, i.e., :F :P p, and hence, by Diodorus s notion of necessity, P p is necessary, i.e., P p is true. Premise (2) is true, in other words, if Diodorus is correct about the meaning of necessity. But that begs the question. We cannot prove that Diodorus s claim about possibility is correct by assuming his claim as a way to justify one of the premises of his argument. So how otherwise can we justify premise (2)? Well, we will not try to justify premise (2) here, but for the purpose of discussion just allow that it is a necessary truth. That is, we will take the thesis that if a proposition was the case, then it is necessary that it was the case as a valid thesis: P p! P p: (B) Note that in assuming that (B) is a valid thesis we are allowing that it is therefore necessary, i.e., that (P p! P p) is also a valid thesis by the modal logic rule of necessitation. This the rule that if a statement is valid, then it is necessary. The two premises, or assumptions, of Diodorus s argument are accordingly (A) for premise (1) and (B) for premise (2). 3 Reconstructing Diodorus s Argument The philosopher and historian Edward Zeller thought that Diodorus s argument was a reductio ad absurdum and that it went something like this. Suppose there is a proposition p that is possible but not now true nor will it ever be true in the future, i.e., suppose p ^ :p ^ :F p. Then in the future, when the present becomes the past, :p will become necessary by premise (2). But if :p becomes necessary, then p becomes impossible, which means, contrary to premise (1) that an impossible proposition follows from a possible proposition. Zeller s argument does not work, however. Apparently, Zeller has :p in mind when :p becomes necessary, and hence p impossible, i.e., :p, which is the negation of the assumption p; and of course :p does not follow from p. But the proper representation of the claim that the negative proposition :p, 4
5 which true now, will (in the future) become necessary (because then it will be about the past) is F P :p, i.e., that what is necessary is that it will be that it was the case that :p, and from this we do not have :p. There is another reconstruction of Diodorus s argument that my old friend Arthur Prior (now deceased) once gave. It too doesn t work, as Prior came to realize. But the reconstruction and the reason it doesn t work is interesting. What Prior noted was that if :p ^ :F p! :p is provable, then (by contraposition and truth-functional logic) so is p! p _ F p: This is all we need because the converse claim that if p is or will be true, then p is possible, i.e., p _ F p! p is certainly a valid thesis. In fact, the statement that if p is true then it it possible, i.e., (p! p), is a basic modal law. It is clear that the statement that if p will be true, then it must be possible is certainly acceptable as well. So we need consider and try to prove only the one direction, namely p! p _ F p: In addition to the theses (A) and (B), Prior added two other theses that he took as valid for tense logic. The rst is p! :P :F p; which says that if p is now true, then it always was the case (in the past) that it was going to be true (in the then future). This is certainly a valid thesis of tense logic, and therefore it too can be taken as necessary, i.e., by the modal logic rule of necessitation that a valid thesis is necessary, (p! :P :F p) (C) is a valid thesis as well. Now note that (p! :P :F p)! (p! :P :F p) is an instance of thesis (A), from which, by (C) and the rule of modus ponens, we therefore have p! :P :F p: Accordingly, by contraposition (truth-functional logic), ::P :F p! :p 5
6 is also valid. But this formula, by the duality of necessity and possibility, is equivalent to P :F p! :p: Finally, to complete the proof, there was one last assumption that Prior made about tense logic. This was the thesis that if a proposition p is now false and will henceforth always be false, then it was the case that p will not be true thereafter, in symbols: :p ^ :F p! P :F p: (D) But by thesis (B) that the past is unalterable, the formula P :F p! P :F p then follows, and from this formula and (D) we have :p ^ :F p! :p; which, by contraposition and truth-functional logic, is equivalent to p! p _ F p; which, as we said, is all that we needed to complete Diodorus s argument about possibility.(qed) 4 Is Time Discrete or Continuous The above reconstruction of Diodorus s master argument is awed in only way, namely thesis (D). What s wrong with (D)? Well, nothing if time is discrete, i.e., if after each moment there is a next moment with no moments in between. The integers are discrete: each integer is followed (and preceded) by just one integer with no other integer between them. The rational numbers are not discrete but dense, on the other hand, because between any two rational numbers x and y there is another rational number, namely x=y. The rational numbers are not continuous, however. One of Pythagorus s students was said to have shown this when he proved that the square root of two, p 2, is not a rational number. Can you see why this is so? (It was rumored that this result so upset the Pythagoreans that they murdered the student and tried to keep the result a secret. But you don t need to worry about that in Professor Addona s class.) Can you see why (D), taken as a valid thesis for all propositions p, assumes that time is discrete? Suppose, e.g., that p is false at a moment t and false thereafter, i.e., at t, the conjunction :p ^ :F p is true. If time is discrete (and t is not the rst moment of time), then there is a moment t 0 that immediately precedes t, and therefore at t 0 it is true that p will never be true thereafter, i.e., :F p is true at t 0. This shows us why (D), the conditional :p ^ :F p! P :F p; 6
7 is valid if time is discrete. If time is not discrete, however, but continuous, then between t and any moment preceding it there are in nitely many other moments at any one of which p might true, in which case even though the conjunction p ^ :F p is true at t, the consequent of (D), namely, P :F p need not also be true at t, in which case the conditional will be false at t. This shows us that (D) is not a valid thesis if time is not discrete but continuous. In that case the above reconstruction of Diodorus s master argument is valid but not sound because one of it assumptions is not a valid thesis unless time is discrete. So the question now is: is time discrete? Indeed, can time be discrete? Doesn t Zeno s Stadium argument show that time cannot be discrete if motion is possible, which Parmenides, Zeno s teacher said was impossible. How is motion possible? Does it require that space and time be continuous? That is what many philosophers say. But because space and time are quantized in quantum physics, there is a smallest physically possible length namely, the Planck length of cm. and a smallest physically possible time, namely, the time it takes for light to cross the Planck length, which is seconds. Doesn t this means that space and time are not in nitely divisible and hence not continuous? Finally, is there any other way to reconstruct Diodorus s master argument? I do not know, but it is something to think about. 7
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
More information8. 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
More informationThe paradox of knowability, the knower, and the believer
The paradox of knowability, the knower, and the believer Last time, when discussing the surprise exam paradox, we discussed the possibility that some claims could be true, but not knowable by certain individuals
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationManual 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
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationProof strategies, or, a manual of logical style
Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting
More informationMcTaggart s Argument for the Unreality of Time:
McTaggart s Argument for the Unreality of Time: A Temporal Logical Analysis Hunan Rostomyan In this paper I want to examine McTaggart s [1908] argument for the unreality of time. McTaggart starts with
More informationCHAPTER 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
More information4 Derivations in the Propositional Calculus
4 Derivations in the Propositional Calculus 1. Arguments Expressed in the Propositional Calculus We have seen that we can symbolize a wide variety of statement forms using formulas of the propositional
More informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More information1.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
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationChapter 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
More informationConjunction: 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.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationSection 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,
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationPropositional 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
More informationLogic, 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.
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More information1 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
More informationIntroduction to Basic Proof Techniques Mathew A. Johnson
Introduction to Basic Proof Techniques Mathew A. Johnson Throughout this class, you will be asked to rigorously prove various mathematical statements. Since there is no prerequisite of a formal proof class,
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationa. ~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.
More informationTruth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.
Outline 1 2 3 4 5 1 / 41 2 / 41 The Liar Sentence Let L be the sentence: This sentence is false This sentence causes trouble If it is true, then it is false So it can t be true Thus, it is false If it
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationIntroducing 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
More informationcis32-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
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationNotes on Inference and Deduction
Notes on Inference and Deduction Consider the following argument 1 Assumptions: If the races are fixed or the gambling houses are crooked, then the tourist trade will decline. If the tourist trade declines
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationChapter 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
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationLOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.
LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,
More informationSupplementary 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
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
More information1. Propositions: Contrapositives and Converses
Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement
More informationPropositional 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
More informationPROPOSITIONAL 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
More informationValid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning
Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February, 2018 Alice E. Fischer Reasoning... 1/23 1 Truth is not the same as Validity 2 Alice E. Fischer Reasoning... 2/23 Truth is not the
More informationMA103 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
More informationReview The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014
Logic 5: Material Implication and Argument Forms Jan. 28, 2014 Overview I Review The Conditional Conditional statements Material implication Logical symbols Argument forms Disjunctive syllogism Disjunctive
More informationSection 1.3: Valid and Invalid Arguments
Section 1.3: Valid and Invalid Arguments Now we have developed the basic language of logic, we shall start to consider how logic can be used to determine whether or not a given argument is valid. In order
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationAI 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
More informationPSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
More informationMath 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes
Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes Written by Santiago Cañez These are notes which provide a basic summary of each lecture for Math 300, Foundations of Higher
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More information6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that
More informationTopic 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
More informationA 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
More informationIntroduction: What Is Modal Logic?
Introduction: What Is Modal Logic? Strictly speaking, modal logic studies reasoning that involves the use of the expressions necessarily and possibly. The main idea is to introduce the symbols (necessarily)
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More information1 Propositional Logic
1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationThe 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
More information02 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
More informationCS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics
CS206 Lecture 21 Modal Logic G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 17 Thu, Mar 13, 2003 Plan for Lecture 21 Modal Logic Possible
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationCambridge University Press How to Prove it: A Structured Approach: Second edition Daniel J. Velleman Excerpt More information
Introduction What is mathematics? High school mathematics is concerned mostly with solving equations and computing answers to numerical questions. College mathematics deals with a wider variety of questions,
More informationWarm-Up Problem. Write a Resolution Proof for. Res 1/32
Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you
More informationArguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)
Arguments and Proofs For the next section of this course, we will study PROOFS. A proof can be thought of as the formal representation of a process of reasoning. Proofs are comparable to arguments, since
More informationChapter 3. The Logic of Quantified Statements
Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:
More informationCHAPTER 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
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationIntermediate 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
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
More informationPropositional Logic Arguments (5A) Young W. Lim 11/29/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationMath 016 Lessons Wimayra LUY
Math 016 Lessons Wimayra LUY wluy@ccp.edu MATH 016 Lessons LESSON 1 Natural Numbers The set of natural numbers is given by N = {0, 1, 2, 3, 4...}. Natural numbers are used for two main reasons: 1. counting,
More informationLogic. 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.
More informationMathematical Reasoning. The Foundation of Algorithmics
Mathematical Reasoning The Foundation of Algorithmics The Nature of Truth In mathematics, we deal with statements that are True or False This is known as The Law of the Excluded Middle Despite the fact
More information6. 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
More information1 The Well Ordering Principle, Induction, and Equivalence Relations
1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
More informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More information