Cantitate/Preț
Produs
Total produse
Vezi coșul
Proof Theory: A selection of papers from the Leeds Proof Theory Programme 1990 de Peter Aczel

Proof Theory: A selection of papers from the Leeds Proof Theory Programme 1990

Editat de Peter Aczel, Harold Simmons, Stanley S. Wainer
en Limba Engleză Hardback – 10 feb 1993
The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both mathematicians and computer scientists.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 27917 lei  6-8 săpt.
  Cambridge University Press – 20 ian 2008 27917 lei  6-8 săpt.
Hardback (1) 79122 lei  6-8 săpt.
  Cambridge University Press – 10 feb 1993 79122 lei  6-8 săpt.

Preț: 79122 lei

Preț vechi: 98902 lei
-20% Nou

Puncte Express: 1187
Preț estimativ în valută:
13999€ • 16309$ • 12225£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521414135
ISBN-10: 052141413X
Pagini: 320
Dimensiuni: 152 x 229 x 22 mm
Greutate: 0.64 kg
Ediția:New.
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:Cambridge, United Kingdom

Cuprins

Preface; Programme of lectures; 1. Basic proof theory S. Wainer and L. Wallen; 2. A short course in ordinal analysis W. Pohlers; 3. Proofs as programs H. Schwichtenberg; 4. A simplified version of local predicativity W. Buchholz; 5. A note on bootstrapping intuitionistic bounded arithmetic S. Buss; 6. Termination orderings and complexity characterisations E. Cichon; 7. Logics for termination and correctness of functional programs, II. Logics of strength PRA S. Feferman; 8. Reflecting the semantics of reflected proof D. Howe; 9. Fragments of Kripke-Platek set theory with infinity M. Rathjen; 10. Provable computable selection functions on abstract structures J. Tucker and J. Zucker.

Descriere

A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.