<--- Back to Details
First PageDocument Content
Cardinal numbers / Axiom of choice / Function / Finite set / Axioms of set theory / Mathematical proof / Axiom schema of replacement / Cantor–Bernstein–Schroeder theorem / Mathematics / Mathematical logic / Set theory
Date: 2006-05-31 15:44:59
Cardinal numbers
Axiom of choice
Function
Finite set
Axioms of set theory
Mathematical proof
Axiom schema of replacement
Cantor–Bernstein–Schroeder theorem
Mathematics
Mathematical logic
Set theory

Add to Reading List

Source URL: www.math.dartmouth.edu

Download Document from Source Website

File Size: 201,21 KB

Share Document on Facebook

Similar Documents

The universal algorithm Classical consequences Universal finite set

DocID: 1vnO8 - View Document

Justin Marks* (), Matthew Fickus and Miriam J. Poteet. Constructing optimal finite frames with a given set of lengths. When constructing finite frames for a given application, the most imp

DocID: 1v65p - View Document

Math Wrangle Practice Problems American Mathematics Competitions November 19, Find the sum of all positive two-digit integers that are divisible by each of their digits. 2. A finite set S of distinct real numbers

DocID: 1umCl - View Document

Logic and the Methodology of Science June 2003 Preliminary Exam August 23, Let L be a finite first-order language whose formulae have been Godel numbered in some natural way. Let Sat be the set of all (Godel numb

DocID: 1u2Wk - View Document

Extending small arcs to large arcs Simeon Ball Abstract An arc is a set of vectors of the k-dimensional vector space over the finite field with q elements Fq , in which every subset of size k is a basis of the space, i.e

DocID: 1tOjf - View Document