Computability Theory and Its Applications : Current Trends and Open Problems.
Saved in:
| Online Access: |
Full text (Emerson users only) |
|---|---|
| Main Author: | |
| Contributors: | , |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Providence :
American Mathematical Society,
2000.
|
| Series: | Contemporary Mathematics.
|
| Subjects: | |
| Local Note: | ProQuest Ebook Central |
Table of Contents:
- Contents
- Preface
- Program of invited talks
- Conference participants
- Randomness in computability theory
- Open questions about the n-c.e. degrees
- The theory of numberings: Open problems
- Π01 classes � structure and applications
- The global structure of computably enumerable sets
- Computability theory in arithmetic: Provability, structure and techniques
- How many Turing degrees are there?
- Questions in computable algebra and combinatorics
- Issues and problems in reverse mathematics
- 1. The Emergence of Reverse Mathematics
- 2. The Reverse Mathematics Enterprise3. The Interpretability Conjecture
- 4. The Coding Issue
- 5. Real Analysis and Topology
- 6. Banach Space Theory
- 7. Ramsey Theory
- 8. WQO Theory
- 9. Countable Abelian Group Theory
- 10. Replacing RCA0 by a Weaker Base Theory
- References
- Open problems in the theory of constructive algebraic systems
- Independence results from ZFC in computability theory: Some open problems
- Problems related to arithmetic
- Embeddings into the computably enumerable degrees
- Definability in the c.e. degrees: Questions and resultsStrong reducibilities, again
- Finitely axiomatizable theories and Lindenbaum algebras of semantic classes
- Towards an analog of Hilbert's tenth problem for a number field
- Natural definability in degree structures
- Recursion theory in set theory
- Extensions, automorphisms, and definability
- Open problems in the enumeration degrees