Princeton University Press (1955)

Abstract
Using set theory in the first part of his book, and proof theory in the second, Gaisi Takeuti gives us two examples of how mathematical logic can be used to obtain results previously derived in less elegant fashion by other mathematical techniques, especially analysis. In Part One, he applies Scott- Solovay's Boolean-valued models of set theory to analysis by means of complete Boolean algebras of projections. In Part Two, he develops classical analysis including complex analysis in Peano's arithmetic, showing that any arithmetical theorem proved in analytic number theory is a theorem in Peano's arithmetic. In doing so, the author applies Gentzen's cut elimination theorem. Although the results of Part One may be regarded as straightforward consequences of the spectral theorem in function analysis, the use of Boolean- valued models makes explicit and precise analogies used by analysts to lift results from ordinary analysis to operators on a Hilbert space. Essentially expository in nature, Part Two yields a general method for showing that analytic proofs of theorems in number theory can be replaced by elementary proofs. Originally published in 1978. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
Keywords Logic, Symbolic and mathematical  Algebra, Boolean
Categories (categorize this paper)
Reprint years 1978
Buy this book $25.78 new (14% off)   $29.95 from Amazon    $37.04 used   Amazon page
Call number QA9.T26
ISBN(s) 069108212X   0691638373   0691610223   9780691082127
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,811
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

From Absolute to Local Mathematics.J. L. Bell - 1986 - Synthese 69 (3):409 - 426.
Hilbert’s Program.Richard Zach - 2003 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Center for the Study of Language and Information, Stanford University.
Why a Little Bit Goes a Long Way: Logical Foundations of Scientifically Applicable Mathematics.Solomon Feferman - 1992 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:442 - 455.
Number Theory and Elementary Arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
How Subtle is Gödel's Theorem? More on Roger Penrose.Martin Davis - 1993 - Behavioral and Brain Sciences 16 (3):611-612.

View all 37 citations / Add more citations

Similar books and articles

A Course in Mathematical Logic.J. L. Bell - 1977 - Sole Distributors for the U.S.A. And Canada American Elsevier Pub. Co..
Augustus De Morgan's Boolean Algebra.Daniel D. Merrill - 2005 - History and Philosophy of Logic 26 (2):75-91.
Canonical Expressions in Boolean Algebra.Archie Blake - 1938 - University of Chicago Press.

Analytics

Added to PP index
2009-01-28

Total views
0

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes