Atomism, Causalism, and the Existence of a First Cause (source: paper with the same title that I submitted to a journal) Emanuel Rutten 31 October 2011.

Slides:



Advertisements
Similar presentations
Philosophical Reasoning Introduction to Elementary Logic I. Deduction / Induction Distinction Murali Ramachandran University of Sussex.
Advertisements

Logic & Critical Reasoning Diagramming Arguments.
With examples from Number Theory
Introduction to Proofs
Four Rules of Aristotelian Logic 1. Rule of Identity: A is A 2. Rule of Non-Contradiction: A is not (-A) 3. Rule of Excluded Middle: Either A or (-A)
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
An overview Lecture prepared for MODULE-13 (Western Logic) BY- MINAKSHI PRAMANICK Guest Lecturer, Dept. Of Philosophy.
Chapter 3 Elementary Number Theory and Methods of Proof.
A semantic argument against the existence of universally held real properties Emanuel Rutten Faculty of Philosophy VU University.
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
(CSC 102) Discrete Structures Lecture 14.
Whiteboardmaths.com © 2004 All rights reserved
Elementary Number Theory and Methods of Proof
Kalām Cosmological Argument Victorian Atheist Society East Melbourne April 9, 2013 Victorian Atheist Society East Melbourne April 9, 2013.
Truth Trees Intermediate Logic.
Copyright © Cengage Learning. All rights reserved.
 The cosmological argument is, as it’s name sugessts (from the greek cosmos, meaning ‘universe’ or ‘world’). An a posteriori argument for the existence.
Logic 3 Tautological Implications and Tautological Equivalences
Logic. what is an argument? People argue all the time ― that is, they have arguments.  It is not often, however, that in the course of having an argument.
March 10: Quantificational Notions Interpretations: Every interpretation interprets every individual constant, predicate, and sentence letter of PL. Our.
Copyright © Zeph Grunschlag,
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Introduction to Philosophy Lecture 7 The argument from evil By David Kelsey.
The Ontological Proof (II) We have seen that, if someone wishes to challenge the soundness of the Modal Ontological, he denies the truth of the second.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Can Big Questions Be Begged?. Fallacies are mistakes in inference, BUT Begging the question is not a mistake in inference. Is it a fallacy at all? Robinson.
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.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
BIRKDALE HIGH SCHOOL MATHEMATICS DEPARTMENT
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Why Does Anything at all Exist? Why is there something rather than nothing? Leibniz - the principle of sufficient reason.
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Introduction to Philosophy Lecture 5 The Ontological Argument By David Kelsey.
Theorems and conjectures
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.
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
Copyright © Cengage Learning. All rights reserved.
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
LECTURE 19 THE COSMOLOGICAL ARGUMENT CONTINUED. THE QUANTUM MECHANICAL OBJECTION DEPENDS UPON A PARTICULAR INTERPRETATION WE MIGHT REASONABLY SUSPEND.
PHILOSOPHY OF RELIGION  Preliminary Issues:  Agreement vs. Tolerance  Different Religions ARE Incompatible  Religious Claims Aren’t True FOR Individuals.
HUME ON THE COSMOLOGICAL ARGUMENT Text source: Dialogues Concerning Natural Religion, part 9.
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
Introduction to Philosophy Lecture 5 The Ontological Argument By David Kelsey.
LECTURE 17 THE MODAL ONTOLOGICAL ARGUMENT (A VARIANT OF HARTSHORNE’S VERSION)
Of 38 lecture 13: propositional logic – part II. of 38 propositional logic Gentzen system PROP_G design to be simple syntax and vocabulary the same as.
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.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
Copyright © Cengage Learning. All rights reserved. Line and Angle Relationships 1 1 Chapter.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
CS104:Discrete Structures Chapter 2: Proof Techniques.
What is an argument? An argument is, to quote the Monty Python sketch, "a connected series of statements to establish a definite proposition." Huh? Three.
Free Will and Determinism Chapter Three Think pp
Binary Addition and Subtraction. Arithmetic Operations Arithmetic operations in a computer are done using binary numbers and not decimal numbers and these.
Categorical Propositions Chapter 5. Deductive Argument A deductive argument is one whose premises are claimed to provide conclusive grounds for the truth.
The Cosmological Argument for God’s Existence
a valid argument with true premises.
Anselm & Aquinas December 23, 2005.
Computer Security: Art and Science, 2nd Edition
II. Analyzing Arguments
5.6 Inequalities in Two Triangles and Indirect Proof
Evaluating Deductive Arguments
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Introducing Natural Deduction
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Subderivations.
Presentation transcript:

Atomism, Causalism, and the Existence of a First Cause (source: paper with the same title that I submitted to a journal) Emanuel Rutten 31 October 2011 ‘Filosofiedag 2011’ at Delft University of Technology

A new first cause argument Under some very generic conditions, the thesis of atomism ('every composite object is composed of simple objects') and the thesis of causalism ('every object is a cause or has a cause') together imply the existence of a first cause Thus, one cannot reasonably be both an atomist and a causalist, while at the same time deny that there is a first cause

Background framework The world is a collection of objects. So, everything that exists is an object, and an object is something that exists Some objects are the cause of another object. So, causation is a relation between two objects: the cause and the effect Some objects are a part of another object. So, parthood is a relation between two objects: the part and the whole An object is a proper part of another object in case the former is a part of the latter, but the latter is not a part of the former

Background framework (cont.) A simple or atom is an object that does not have proper parts A composite is an object that contains at least one proper part The sum of two or more objects is those objects taken together If the sum of some objects is an object, then the members of the sum are called a composition of that object. In that case we say that these members compose the object

Definition of first cause A first cause is defined as an uncaused cause whose effect is ontologically prior to every other caused object From this definition it follows immediately that there can be at most one first cause. So, if there is a first cause, it is properly described as the ultimate origin of all other objects

The argument 1.There are objects 2.Every composite is composed of simple objects (atomism) 3.Every object is caused or is the cause of one or more other objects (causalism) 4.The sum of all caused simple objects, if not empty, is an object 5.The cause of an object is disjoint with that object 6.Every caused composite contains a caused proper part There is a first cause (conclusion)

Logical derivation of the conclusion A five step logical derivation of the conclusion i.Every caused composite contains a caused simple ii.The sum of all caused simples (say M) is an object iii.M is not a cause iv.The cause of M (say A) is uncaused v.A is a first cause The argument is deductively valid. The conclusion follows logically from the premises. So, if the premises are true, then the conclusion is true as well

(i) Every caused composite contains a caused simple Let C be a caused composite, and take the following procedure: a) Let i := 0 and C(0) := C, b) According to the sixth premise C(i) contains a caused proper part C(i+1), c) If C(i+1) is a simple object, then STOP the procedure, d) Let i := i+1 and proceed with the second step. Due to the second premise of the argument, that is, the premise of atomism, the procedure results in a caused simple part of C

Let M be the sum of all caused simples. According to premise (1) there is an object. Premise (3) implies that this object is caused or a cause. So, in any case, there is a caused object, say N. Object N is simple or composite. – If N is simple, then N is a caused simple, and thus M is not empty. – If N is composite, then, according to (i), N contains a caused simple object, and thus M is not empty either. It follows that in both cases M is not empty. So, M is not empty. But then premise (4) implies that M is an object. (ii) The sum of all caused simples (say M) is an object

Suppose, for reductio, that M is the cause of an object, say K According to premise (5) object M is disjoint with object K. Thus, K is not a caused simple. Object K is a caused composite. From (i) it follows that K contains a caused simple, say K*. K* is a part of M. From this it follows immediately that M and K share K* as a part. But this is contradictory since M and K are disjoint. So, the assumption that M is the cause of another objects needs to be rejected. And therefore, indeed, object M is not a cause. (iii) M is not a cause

According to premise (3) M is caused. Let A be the cause of M. Suppose, again for reductio, that A is caused. From premise (5) it follows that A and M are disjoint. So, A is not a caused simple. A is a caused composite. But then (i) implies that A has a caused simple A* as one of its parts. Thus, A and M share A* as part, which conflicts with A and M being disjoint So, the assumption that A is caused is incorrect: A is uncaused. (iv) The cause of M (say A) is uncaused

To show that A is a first cause it also must be shown that the effect of A (M) is ontologically prior to each other caused object Thus, let B be a caused object. In that case B is a caused simple or a caused composite. Now, (i) implies that in either case B has a caused simple as part, which is ontologically prior to B So, since M exists if and only if the caused simples exist, M is indeed ontologically prior to B, and hence A is a first cause (v) A is a first cause