 Sets, Logic, and CategoriesSaunders Mac Lane
Chapter Chapter XI in Mathematics Form and Function, 1986, pp 358-408 from Springer Abstract: Abstract The rich multiplicity of Mathematical objects and the proofs of theorems about them can be set out formally with absolute precision on a remarkably parsimonious base. Thus almost all the objects of Mathematics can be described as sets: A natural number is a set of sets (a cardinal), a rational number is a set of pairs (an equivalence class), a real number is a set of rationals (a Dedekind cut), and a function is a set of ordered pairs (a table of values). Similarly the theorems of Mathematics can all be written as formulas in a very parsimonious formal language which uses only set-membership, the basic connectives of logic (or, not, there exists) and the needed primitive terms of each subject (thus “point” and “line” for incidence geometry). Finally, most of the proofs of Mathematical theorems can be stated with absolute rigor as a sequence of inferences, each an instance of a finite number of basic schemes of inference. Keywords: Cardinal Number; Axiom Scheme; Peano Arithmetic; Incompleteness Theorem; Contravariant Functor (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-4872-9_12 Ordering information: This item can be ordered from DOI: 10.1007/978-1-4612-4872-9_12 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.