<--- Back to Details
First PageDocument Content
Computability theory / Proof theory / Theory of computation / Cardinal numbers / Ordinal notation / Limit ordinal / Recursively enumerable set / Recursive ordinal / Large countable ordinal / Mathematical logic / Mathematics / Ordinal numbers
Date: 2014-02-24 17:59:08
Computability theory
Proof theory
Theory of computation
Cardinal numbers
Ordinal notation
Limit ordinal
Recursively enumerable set
Recursive ordinal
Large countable ordinal
Mathematical logic
Mathematics
Ordinal numbers

Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

Add to Reading List

Source URL: www.mtnmath.com

Download Document from Source Website

File Size: 327,81 KB

Share Document on Facebook

Similar Documents

 	 

 	 		


          

DocID: 18WMw - View Document

 	 

 	 		


          

DocID: 18UD4 - View Document

Linear Logic complements Classical Logic Vaughan Pratt∗ Dept. of Computer Science Stanford University Stanford, CA[removed]removed]

Linear Logic complements Classical Logic Vaughan Pratt∗ Dept. of Computer Science Stanford University Stanford, CA[removed]removed]

DocID: MSeE - View Document

Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

DocID: bWnn - View Document

An overview of the ordinal calculator Paul Budnik Mountain Math Software [removed] c[removed]Mountain Math Software Copyright

An overview of the ordinal calculator Paul Budnik Mountain Math Software [removed] c[removed]Mountain Math Software Copyright

DocID: bW6B - View Document