Predicative Arithmetic. (MN-32) / / Edward Nelson.
This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1980-1999 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2014] ©1986 |
Year of Publication: | 2014 |
Edition: | Course Book |
Language: | English |
Series: | Mathematical Notes ;
32 |
Online Access: | |
Physical Description: | 1 online resource (200 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the extraction of computational content from noneffective convergence proofs in analysis / / Pavol Safarik.
by: Safarik, Pavol,
Published: ([2014]) -
Infinity and truth / / editors, Chitat Chong, National University of Singapore, Singapore [and three others].
Published: ([2014]) -
Notes on forcing axioms / / Stevo Todorcevic, University of Toronto, Canada ; edited by Chitat Chong, National University of Singapore, Singapore [and four others].
by: Todorcevic, Stevo.
Published: ([2014]) -
Forcing for mathematicians / / Nik Weaver (Washington University in St. Louis, USA).
by: Weaver, Nik,
Published: ([2014]) -
Formalism and beyond : : on the nature of mathematical discourse / / edited by Godehard Link.
Published: ([2014])