CHF 215.00

Truth, Proof and Infinity
A Theory of Constructive Reasoning

English · Paperback / Softback

Shipping usually within 4 to 7 working days

Description

Read more

Constructive mathematics is based on the thesis that the meaning of a mathematical formula is given, not by its truth-conditions, but in terms of what constructions count as a proof of it. However, the meaning of the terms `construction' and `proof' has never been adequately explained (although Kriesel, Goodman and Martin-Löf have attempted axiomatisations). This monograph develops precise (though not wholly formal) definitions of construction and proof, and describes the algorithmic substructure underlying intuitionistic logic. Interpretations of Heyting arithmetic and constructive analysis are given.
The philosophical basis of constructivism is explored thoroughly in Part I. The author seeks to answer objections from platonists and to reconcile his position with the central insights of Hilbert's formalism and logic.
Audience: Philosophers of mathematics and logicians, both academic and graduate students, particularly those interested in Brouwer and Hilbert; theoretical computer scientists interested in the foundations of functional programming languages and program correctness calculi.

Product details

Authors P. Fletcher, P Fletcher
Publisher Springer Netherlands
 
Content Book
Product form Paperback / Softback
Publication date 19.10.2010
Subject Humanities, art, music > Philosophy > General, dictionaries
Non-fiction book > Philosophy, religion > Philosophy: general, reference works
 
EAN 9789048151059
ISBN 978-90-481-5105-9
Pages 470
Illustrations X, 470 p.
Dimensions (packing) 15.6 x 2.7 x 23.6 cm
Weight (packing) 737 g
 
Series Synthese Library > Vol.276
Synthese Library > 276
 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.