UID:
almahu_9948234256302882
Format:
1 online resource (x, 306 pages) :
,
digital, PDF file(s).
ISBN:
9780511896262 (ebook)
Content:
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.
Note:
Title from publisher's bibliographic system (viewed on 24 Feb 2016).
,
Basic proof theory / S. Wainer and L. Wallen -- A short course in ordinal analysis / W. Pohlers -- Proofs as programs / H. Schwichtenberg -- A simplified version of local predicativity / W. Bucholz -- A note on bootstrapping intuitionistic bounded arithmetic / S. Buss -- Termination orderings and complexity characterisations / E. Cichon -- Logics for termination and correctness of functional programs, II. Logics of strength PRA / S. Feferman -- Reflecting the semantics of reflected proof / D. Howe -- Fragments of Kripke-Platek set theory with infinity / Michael Rathjen -- Provable computable selection functions on abstract structures / J. Tucker and J. Zucker.
Additional Edition:
Print version: ISBN 9780521414135
Language:
English
URL:
https://doi.org/10.1017/CBO9780511896262
Bookmarklink