Request Inspection Copy

If you are an Academic or Teacher and wish to consider this book as a prescribed textbook for your course, you may be eligible for a complimentary inspection copy. Please complete this form, including information about your position, campus and course, before adding to cart.

* Required Fields

To complete your Inspection Copy Request you will need to click the Checkout button in the right margin and complete the checkout formalities. You can include Inspection Copies and purchased items in the same shopping cart, see our Inspection Copy terms for further information.

Any Questions? Please email our text Support Team on text@footprint.com.au

Submit

Email this to a friend

* ALL required Fields

Order Inspection Copy

An inspection copy has been added to your shopping cart

Functional Interpretations: From The Dialectica Interpretation To Interpretations Of Classical And Constructive Set Theory

by Justus Diller World Scientific
Pub Date:
11/2019
ISBN:
9789814551397
Format:
Hbk 248 pages
Price:
AU$196.00 NZ$201.74
Product Status: Out of stock. Not available to order.
This book gives a detailed treatment of functional interpretations of arithmetic, analysis, and set theory. The subject goes back to Gödel's Dialectica interpretation of Heyting arithmetic which replaces nested quantification by higher type operations and thus reduces the consistency problem for arithmetic to the problem of computability of primitive recursive functionals of finite types. Regular functional interpretations, i.e. Dialectica and Diller-Nahm interpretation as well as Kreisel's modified realization, together with their Troelstra-style hybrids, are applied to constructive as well as classical systems of arithmetic, analysis, and set theory. They yield relative consistency and conservativity results and closure under relevant rules of the theories in question as well as axiomatic characterizations of the functional translations.Prerequisites are: familiarity with classical and intuitionistic predicate logic, basics of computability theory, Gödel's incompleteness theorems.