Handbook of Set Theory
Matthew Foreman, Akihiro Kanamori
Springer Science & Business Media, Dec 10, 2009 - Mathematics - 2230 pages
Numbers imitate space, which is of such a di?erent nature —Blaise Pascal It is fair to date the study of the foundation of mathematics back to the ancient Greeks. The urge to understand and systematize the mathematics of the time led Euclid to postulate axioms in an early attempt to put geometry on a ?rm footing. With roots in the Elements, the distinctive methodology of mathematics has become proof. Inevitably two questions arise: What are proofs? and What assumptions are proofs based on? The ?rst question, traditionally an internal question of the ?eld of logic, was also wrestled with in antiquity. Aristotle gave his famous syllogistic s- tems, and the Stoics had a nascent propositional logic. This study continued with ?ts and starts, through Boethius, the Arabs and the medieval logicians in Paris and London. The early germs of logic emerged in the context of philosophy and theology. The development of analytic geometry, as exempli?ed by Descartes, ill- tratedoneofthedi?cultiesinherentinfoundingmathematics. Itisclassically phrased as the question ofhow one reconciles the arithmetic with the geom- ric. Arenumbers onetypeofthingand geometricobjectsanother? Whatare the relationships between these two types of objects? How can they interact? Discovery of new types of mathematical objects, such as imaginary numbers and, much later, formal objects such as free groups and formal power series make the problem of ?nding a common playing ?eld for all of mathematics importunate. Several pressures made foundational issues urgent in the 19th century.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Successors of Singular Cardinals
Beginning Inner Model Theory
The Covering Lemma
An Outline of Inner Model Theory
A Core Model Toolbox and Guide
Structural Consequences of AD
Other editions - View all
antichain apply argument Aronszajn tree assume axioms Boolean algebra Borel equivalence relations bounded closed unbounded club cofinal Cohen collapse combinatorial consistency construction Corollary countably complete cov(B defined Definition denote dense disjoint elementary embedding elements example exists extension filter finite forcing poset function f ground model Hence holds hypothesis implies inaccessible induction infinite initial segment inner model intersection isomorphic Jensen large cardinal Lemma Let G limit ordinal Logic Magidor maximal antichain measurable cardinal morphism n e w node nonstationary ideal normal order type P-generic partial ordering poset preserves proof proper forcing Proposition prove recursion regular cardinal result Saharon Shelah satisfies Sect sequence set theory singular cardinal stationary set stationary subset structure successor supercompact Suppose Theorem tree ultrafilter ultrapower uncountable weakly compact Woodin cardinal ωω