Foundations of Mathematics
by Stephen G. Simpson
Publisher: Pennsylvania State University 2008
Number of pages: 123
These are lecture notes for an introductory graduate-level course in foundations of mathematics. The topics covered are: computability, unsolvable problems, undecidability of the natural number system, decidability of the real number system, informal set theory, axiomatic set theory. This course is suitable for all mathematics graduate students.
Home page url
Download or read it online for free here:
by Paul Taylor - Cambridge University Press
It explains the basis of mathematical reasoning both in pure mathematics itself and in computer science. In addition to the formal logic, this volume examines the relationship between computer languages and plain English mathematical proofs.
by Julie Rowlett - BookBoon
This is a fun and rigorous introduction to pure mathematics, suitable for both students and a general audience interested in learning what pure mathematics is all about. Presented in a friendly, accessible, and nonetheless rigorous style.
by John Wesley Young - Macmillan and co.
The following lectures contain an elementary account of the logical foundations of algebra and geometry. Except in a very few instances, no knowledge of mathematics beyond the most elementary portions of algebra and geometry has been assumed.
by W.B.V. Kandasamy, F. Smarandache, K.Ilanthenral - arXiv
Basic properties of codes and super matrices are given. New type of super special vector space is constructed. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced.