Logic, Construction, Computation
1st Edition
Published on 6. August 2012
Book
Hardback
542 pages
978-3-86838-158-0 (ISBN)
Description
Over the last few decades the interest of logicians and mathematicians in constructive and computational aspects of their subjects has been steadily growing, and researchers from disparate areas realized that they can benefit enormously from the mutual exchange of techniques concerned with those aspects. A key figure in this exciting development is the logician and mathematician Helmut Schwichtenberg to whom this volume is dedicated on the occasion of his 70th birthday and his turning emeritus. The volume contains 20 articles from leading experts about recent developments in Constructive set theory, Provably recursive functions, Program extraction, Theories of truth, Constructive mathematics, Classical vs. intuitionistic logic, Inductive definitions, and Continuous functionals and domains.
More details
Persons
Ulrich Berger is a reader in Computer Science at Swansea University. His expertise is in domain theory, higher type computability and proof-theoretic methods for program extraction.
Hannes Diener is a researcher in Mathematics at the University of Siegen. He is interested in constructive analysis, algorithmic foundations of mathematics, and intuitionistic logic.
Peter Schuster is a lecturer in Mathematical Logic at the University of Leeds. His major research interest at current is the constructive content of classical proofs in abstract algebra, in particular of proofs in which with Zorn's Lemma the Axiom of Choice acts a major part.
Monika Seisenberger is a lecturer in Computer Science at Swansea University. Her research area is program extraction from proofs, verification, and interactive theorem proving.
Hannes Diener is a researcher in Mathematics at the University of Siegen. He is interested in constructive analysis, algorithmic foundations of mathematics, and intuitionistic logic.
Peter Schuster is a lecturer in Mathematical Logic at the University of Leeds. His major research interest at current is the constructive content of classical proofs in abstract algebra, in particular of proofs in which with Zorn's Lemma the Axiom of Choice acts a major part.
Monika Seisenberger is a lecturer in Computer Science at Swansea University. Her research area is program extraction from proofs, verification, and interactive theorem proving.