Zermelo-Fraenkel Axioms Ernst Zermelo (1871-1953) gave axioms of set theory, which were improved by Adolf Fraenkel (1891-1965). This system of axioms called.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Mathematical Induction
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
Lecture XXIII.  In general there are two kinds of hypotheses: one concerns the form of the probability distribution (i.e. is the random variable normally.
Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.
Axiomatic systems and Incidence Geometry
Gödel’s Incompletness Theorem By Njegos Nincic. Overview  Set theory: Background, History Naïve Set Theory  Axiomatic Set Theory  Icompleteness Theorem.
Models, Numbers, and Measure Theory: The Independence of The Continuum Hypothesis by Martin Flashman Department of Mathematics Humboldt State University.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Induction and recursion
Ramsey Theory on the Integers and Reals
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Set Theory.
Induction Sections 41. and 4.2 of Rosen Fall 2008 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions:
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Discrete Mathematics Lecture 4 Harper Langston New York University.
So far we have learned about:
CSE115/ENGR160 Discrete Mathematics 03/22/12 Ming-Hsuan Yang UC Merced 1.
Cardinals Georg Cantor ( ) thought of a cardinal as a special represenative. Bertrand Russell ( ) and Gottlob Frege ( ) used the.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Lecture 24: Gödel’s Proof CS150: Computer Science
CSE115/ENGR160 Discrete Mathematics 03/29/11 Ming-Hsuan Yang UC Merced 1.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
ORDINAL NUMBERS VINAY SINGH MARCH 20, 2012 MAT 7670.
Mathematics and the Theory of Knowledge
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
What it is? Why is it a legitimate proof method? How to use it?
Methods of Proof & Proof Strategies
In mathematics, a rational number is any number that can be expressed as the quotient or fraction p/q of two integers, with the denominator q not equal.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
Paradoxes of the Infinite Kline XXV Pre-May Seminar March 14, 2011.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
1.1 Introduction to Inductive and Deductive Reasoning
Mathematical Induction
Tommy King October 14, 2014 Kurt GodeL.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Defining Liveness by Bowen Alpern and Fred B. Schneider Presented by Joe Melnyk.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Friday 8 Sept 2006Math 3621 Axiomatic Systems Also called Axiom Systems.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
1 INFO 2950 Prof. Carla Gomes Module Induction Rosen, Chapter 4.
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
Making Mountains Out of Molehills The Banach-Tarski Paradox By Bob Kronberger Jay Laporte Paul Miller Brian Sikora Aaron Sinz.
CS 285- Discrete Mathematics
CS104:Discrete Structures Chapter 2: Proof Techniques.
CompSci 102 Discrete Math for Computer Science March 13, 2012 Prof. Rodger Slides modified from Rosen.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Sets and Size Basic Question: Compare the “size” of sets. First distinction finite or infinite. –What is a finite set? –How can one compare finite sets?
The Church-Turing Thesis Chapter Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve:
Chapter 1 Logic and proofs
3.3 Mathematical Induction 1 Follow me for a walk through...
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Richard Dedekind ( ) The grandfather of mathematical structuralism
Chapter 3 The Real Numbers.
The Concept of Infinity
Lecture 2 Propositional Logic
Study guide What was Bolzano’s contribution to set theory and when did he make it. What is the cardinal of N,Q,Z? Prove your statement. Give two formulations.
Module #4.5, Topic #∞: Cardinality & Infinite Sets
First Order Logic Rosen Lecture 3: Sept 11, 12.
Module #4.5, Topic #∞: Cardinality & Infinite Sets
1.1 Introduction to Inductive and Deductive Reasoning
Philosophy of Mathematics: a sneak peek
Properties of Relational Logic
Properties of Relational Logic
Presentation transcript:

Zermelo-Fraenkel Axioms Ernst Zermelo ( ) gave axioms of set theory, which were improved by Adolf Fraenkel ( ). This system of axioms called ZF or ZFC (if the axiom of choice is included) is the most widely used definition of sets.

The Axiom of choice Equivalent formulations of the Axiom of choice: –Given any set of mutually exclusive non-empty sets, there exists at least one set that contains exactly one element in common with each of the non-empty sets. –Any product of nonempty sets is nonempty –Let X be a collection of non-empty sets. Then we can choose a member from each set in that collection There are other axioms which equivalent to the axiom of choice: –Well-ordering principle: Every set can be well- ordered –Zorn's lemma: Every partially ordered set in which every chain (i.e. totally ordered subset) has an upper bound contains at least one maximal element Zorn’s lemma is e.g. used to show that every vector space has a basis. If one accepts the axiom of choice then the Banach-Tarski “paradox” holds

Consistency and completeness A system of axioms is called complete, if all the true statements can be proven from the axiom. A system of axioms is called consistent if it is not possible to derive a contradiction from them. A set of axioms is relatively consistent with respect to a second set of axioms, if the first set is consistent if the second one is. A statement is called independent of a system of axioms, if it cannot be proved or disproved using the axioms. K. Gödel showed that –In any consistent axiomatic system (formal system of mathematics) sufficiently strong to allow one to do basic arithmetic, one can construct a statement about natural numbers that can be neither proved nor disproved within that system. Rephrased: a sufficiantly strong system is not complete. –Any sufficiently strong consistent system cannot prove its own consistency. –Therefore set theory is neither complete, nor can it be proven to be consistent within the realm of set theory. –(1935) ZFC is relatively consistent with ZF F. Cohen (1963) showed the axiom of choice is independent of ZF.

The Continuum hypothesis Cantor expected that all infinite subsets of R have either the cardinality of the cardinality c of the continuum. Assuming the axiom of choice; rephrased there are no cardinals between c= and. The continuum hypothesis can be phrased as The generalized continuum hypothesis reads Gödel (1939) proved that the (generalized) continuum hypothesis is consistent with ZFC. P. Cohen proved –The continuum hypothesis is independent of ZFC. –The negation of the continuum hypothesis is consistent with ZFC

Kurt Gödel and Paul J. Cohen Born in1906 in Brno 1929 PhD at the Unversity of Vienna 1930 faculty at the University of Vienna 1931 Incompleteness Theorems Habilitation 1940 emigration to the US bcoming citizen in Member of the IAS in Princeton (permanent from 1953 on) 1940 relative consistency of the continuum- hypothesis. Died in 1978 Born in PhD University of Chicago Was at MIT and the IAS and became faculty at Stanford in Fields Medal Invented “forcing”. This can be used to show the independence of the axiom of choice and the generalized continuum hypothesis.