Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings > The Logical Strength of the Uniform Continuity Theorem
Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings |
Arnold Beckmann; Ulrich Berger; Benedikt Löwe; John V. Tucker
Springer Berlin Heidelberg
Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings
The Logical Strength of the Uniform Continuity Theorem
Authors

Josef Berger

ARI Id

1664740329249_3017966

Access

Not Available Free

Pages

35-39

DOI

10.1007/11780342_4

Chapter URL

https://rd.springer.com/chapter/10.1007/11780342_4

Table of Contents of Book
Showing 1 to 20 of 63 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
Erika Ábrahám; Andreas Grüner; Martin Steffen
1-10
From Constructibility and Absoluteness to Computability and Domain Independence
Arnon Avron
11-20
Datatype-Generic Reasoning
Roland Backhouse
21-34
The Logical Strength of the Uniform Continuity Theorem
Josef Berger
35-39
Elementary Algebraic Specifications of the Rational Function Field
J. A. Bergstra
40-54
Random Closed Sets
Paul Brodhead; Douglas Cenzer; Seyyed Dashti
55-64
Deep Inference and Its Normal Form of Derivations
Kai Brünnler
65-74
Logspace Complexity of Functions and Structures
Douglas Cenzer; Zia Uddin
75-84
Prefix-Like Complexities and Computability in the Limit
Alexey Chernov; Jürgen Schmidhuber
85-93
Partial Continuous Functions and Admissible Domain Representations
Fredrik Dahlgren
94-104
An Invariant Cost Model for the Lambda Calculus
Ugo Dal Lago; Simone Martini
105-114
On the Complexity of the Sperner Lemma
Stefan Dantchev
115-124
The Church-Turing Thesis: Consensus and Opposition
Martin Davis
125-132
Gödel and the Origins of Computer Science
John W. Dawson Jr.
133-136
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design
Gregorio de Miguel Casado; Juan Manuel García Chamizo
137-146
Turing Universality in Dynamical Systems
Jean-Charles Delvenne
147-152
Every Sequence Is Decompressible from a Random One
David Doty
153-162
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
Jérôme Durand-Lose
163-172
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
Roy Dyckhoff; Stéphane Lengrand
173-185
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 63 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings