preview

Theory, Computer Science And Axiomatizations Of Set Theory

Good Essays

Set Theory, Computer Science and axiomatizations of Set Theory
Prashant Sharma
MATH419 D001 Sum 15
American Military University
Instructor Mehrdad Mahmoudi Zarandi

Abstract
This paper contains the brief introduction of Set theory which included the definition, origination, history and modernization of set theory and mathematical field related to it. The main focus of this paper will be on the application of set theory in different discipline.

Set Theory, Computer Science and axiomatizations of Set Theory
Mathematics is the study of numbers, and counting, and measuring, but that is only the beginning. Mathematics involves the study of number patterns and relationships. Set theory is an area of mathematics that deals with inconceivable numbers, and bottomless concepts such as infinity. The history of set theory is relatively dissimilar from the history of most other parts of mathematics. Set Theory was founded by Georg Cantor in 1874 in his paper “On a Characteristics Property of All Real Algebraic Numbers”. Naive set theory is fun, and as we saw with Cantor’s diagonalization, it can produce some incredibly beautiful results. But as we’ve seen before, in the simple world of naive set theory, it’s easy to run into trouble, in the form of Russell’s paradox and a variety of related problems.
The sake of completeness, Russell’s paradox concerns the set R={s | s ∉ s}. Is R∈R? If R∈R, then by the definition of R∉R. But by definition, if R∉R,

Get Access