Proofs and Computations Image close
Proofs and Computations on Hardback by Helmut Schwichtenberg
Proofs and Computations on Hardback by Helmut Schwichtenberg
Show Hide Adult Content
Proofs and Computations close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Mathematical foundations  
Mathematical logic

Proofs and Computations

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Hardback
$218.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley

Buy Now, Pay Later with:

4 payments of $54.75 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 14-26 June using International Courier

Explore more Perspectives in Logic

See all products in this series

General Recursion Theory on Hardback by Jens E Fenstad
$306.99
General Recursion Theory
by Jens E Fenstad ~ Hardback
Available - Usually ships in 3-4 weeks
Proper and Improper Forcing on Hardback by Saharon Shelah
$507.99
Proper and Improper Forcing
by Saharon Shelah ~ Hardback
Available - Usually ships in 3-4 weeks
Model-Theoretic Logics on Hardback
$505.99
Model-Theoretic Logics
Hardback
Available - Usually ships in 3-4 weeks
Recursion-Theoretic Hierarchies on Hardback by Peter G. Hinman
$397.99
Recursion-Theoretic Hierarchies
by Peter G. Hinman ~ Hardback
Available - Usually ships in 3-4 weeks
Pure Inductive Logic on Hardback by Jeffrey Paris
$344.99
Pure Inductive Logic
by Jeffrey Paris ~ Hardback
Available - Usually ships in 3-4 weeks
Higher Recursion Theory on Hardback by Gerald E Sacks
$358.99
Higher Recursion Theory
by Gerald E Sacks ~ Hardback
Available - Usually ships in 3-4 weeks
Subsystems of Second Order Arithmetic by Stephen G. Simpson
$142.99
Subsystems of Second Order Arithmetic
by Stephen G. Simpson ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Lambda Calculus with Types on Hardback by Henk Barendregt
$245.99
Lambda Calculus with Types
by Henk Barendregt ~ Hardback
Available - Usually ships in 3-4 weeks
Subsystems of Second Order Arithmetic on Hardback by Stephen G. Simpson
$384.99
Subsystems of Second Order Arithmetic
by Stephen G. Simpson ~ Hardback
Available - Usually ships in 3-4 weeks
Degrees of Unsolvability on Hardback by Manuel Lerman
$309.99
Degrees of Unsolvability
by Manuel Lerman ~ Hardback
Available - Usually ships in 3-4 weeks
Essential Stability Theory on Hardback by Steven Buechler
$345.99
Essential Stability Theory
by Steven Buechler ~ Hardback
Available - Usually ships in 3-4 weeks
Admissible Sets and Structures on Hardback by Jon Barwise
$346.99
Admissible Sets and Structures
by Jon Barwise ~ Hardback
Available - Usually ships in 3-4 weeks
Fundamentals of Stability Theory on Hardback by John T. Baldwin
$396.99
Fundamentals of Stability Theory
by John T. Baldwin ~ Hardback
Available - Usually ships in 3-4 weeks
Metamathematics of First-Order Arithmetic on Hardback by Petr Hajek
$397.99
Metamathematics of First-Order Arithmetic
by Petr Hajek ~ Hardback
Available - Usually ships in 3-4 weeks
Computability in Analysis and Physics on Hardback by Marian B Pour-El
$306.99
Computability in Analysis and Physics
by Marian B Pour-El ~ Hardback
Available - Usually ships in 3-4 weeks
Constructibility on Hardback by Keith J Devlin
$361.99
Constructibility
by Keith J Devlin ~ Hardback
Available - Usually ships in 3-4 weeks

Description

Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to Π11–CA0. Ordinal analysis and the (Schwichtenberg–Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and Π11–CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.

Author Biography:

Helmut Schwichtenberg is an Emeritus Professor of Mathematics at Ludwig-Maximilians-Universität München. He has recently developed the 'proof-assistant' MINLOG, a computer-implemented logic system for proof/program development and extraction of computational content. Stanley S. Wainer is an Emeritus Professor of Mathematics at the University of Leeds and a past-President of the British Logic Colloquium.
Release date Australia
December 15th, 2011
Audience
  • Professional & Vocational
Illustrations
8 Line drawings, unspecified
Pages
480
Dimensions
160x236x30
ISBN-13
9780521517690
Product ID
10839335

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Mathematical foundations >
Mathematical logic