Fr. 134.40

Proofs and Computations

English · Hardback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

Informationen zum Autor 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. Klappentext This major graduate-level text provides a detailed, self-contained coverage of proof theory. Zusammenfassung Written by acknowledged experts! for advanced students and researchers in mathematical logic and computer science! this volume provides a detailed! self-contained coverage of proof theory in both classical and constructive arithmetics! up to finitely iterated inductive definitions. Deep connections with computability! complexity and program extraction form the principal themes. Inhaltsverzeichnis Preface; Preliminaries; Part I. Basic Proof Theory and Computability: 1. Logic; 2. Recursion theory; 3. Godel's theorems; Part II. Provable Recursion in Classical Systems: 4. The provably recursive functions of arithmetic; 5. Accessible recursive functions, ID

Product details

Authors Helmut Schwichtenberg, Helmut (Ludwig-Maximilians-Univers Schwichtenberg, Helmut Wainer Schwichtenberg, SCHWICHTENBERG HELMUT WAINER STA, Stanley S. Wainer
Publisher Cambridge University Press ELT
 
Languages English
Product format Hardback
Released 15.12.2011
 
EAN 9780521517690
ISBN 978-0-521-51769-0
No. of pages 480
Series Perspectives in Logic
Perspectives in Logic
Subject Natural sciences, medicine, IT, technology > Mathematics > Basic principles

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.