Logic, Construction, Computation / / ed. by Ulrich Berger, Hannes Diener, Peter Schuster, Monika Seisenberger.
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 asp...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1 |
---|---|
MitwirkendeR: | |
HerausgeberIn: | |
Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2013] ©2012 |
Year of Publication: | 2013 |
Language: | English |
Series: | Ontos Mathematical Logic ,
3 |
Online Access: | |
Physical Description: | 1 online resource (542 p.) :; Zahlr. Abb. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Other title: | Frontmatter -- Preface -- Contents -- Contributors -- A New Use of Friedman’s Translation: Interactive Realizability -- Polymorphic Logic -- Constructive Solutions of Ordinary Differential Equations -- A Nonstandard Hierarchy Comparison Theorem for the Slow and Fast Growing Hierarchy -- Conservativity of transitive closure over weak constructive operational set theory -- Formal Baire Space in Constructive Set Theory -- Functional Interpretations of Classical and Constructive Set Theory -- Weak Theories of Truth and Explicit Mathematics -- Axiomatizing Truth: Why and How? -- On the Strength of some Semi-Constructive Theories -- On the Relation Between Various Negative Translations -- A Finite Axiomatisation of Inductive-Inductive Definitions -- Some Conservative Extension Results on Classical and Intuitionistic Sequent Calculi -- About the Strength of Operational Regularity -- Non-Deterministic Epsilon Substitution for ID1: Effective Proof -- Another Unique Weak König’s Lemma WKL!! -- The Continuous Functionals as Limit Spaces -- Provably Recursive Functions of Reflection -- A Hierarchy of Ramified Theories Below PRA -- Representing L-Domains as Information Systems |
---|---|
Summary: | 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. |
Format: | Mode of access: Internet via World Wide Web. |
ISBN: | 9783110324921 9783110238570 9783110238488 9783110636949 9783110331226 9783110331219 |
ISSN: | 2198-2341 ; |
DOI: | 10.1515/9783110324921 |
Access: | restricted access |
Hierarchical level: | Monograph |
Statement of Responsibility: | ed. by Ulrich Berger, Hannes Diener, Peter Schuster, Monika Seisenberger. |