Andere Kunden interessierten sich auch für
![General Recursion Theory]( "General Recursion Theory")
General Recursion Theory115,99 €![A Theory of Truth]( "A Theory of Truth")
A Theory of Truth160,99 €![Logical Foundations of Proof Complexity]( "Logical Foundations of Proof Complexity")
Logical Foundations of Proof Complexity69,99 €![Fundamentals of Stability Theory]( "Fundamentals of Stability Theory")
Fundamentals of Stability Theory149,99 €![Higher Recursion Theory]( "Higher Recursion Theory")
Higher Recursion Theory134,99 €![Essential Stability Theory]( "Essential Stability Theory")
Essential Stability Theory131,99 €![Categories and Modules with K-Theory in View]( "Categories and Modules with K-Theory in View")
Categories and Modules with K-Theory in View148,99 €
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.
Table of contents:
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 characteristics E. Cichon; 7. Logics for termination and correction of functional programs S. Feferman; 8. Reflecting the semantics of reflected proof D. Howe; 9. Fragments of Kripke-Platek set theory M. Rathjen; 10. Provable computable selection functions on abstract structures J. Tuckers and J. Zucker.
A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.
A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.
Table of contents:
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 characteristics E. Cichon; 7. Logics for termination and correction of functional programs S. Feferman; 8. Reflecting the semantics of reflected proof D. Howe; 9. Fragments of Kripke-Platek set theory M. Rathjen; 10. Provable computable selection functions on abstract structures J. Tuckers and J. Zucker.
A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.
A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.