scientific article; zbMATH DE number 1302869
From MaRDI portal
Publication:4249355
In this introduction, we describe the historical roots of recursive mathematics as well as summarize some of the major themes that have arisen in the study of recursive mathematics and that are covered by the articles in this volume. We also provide a brief description of the articles of this volume. Finally we will end with what the editors believe are promising areas for further research. For the entire collection see [Zbl 0905.03001].
Recommendations
Cited in
(34)- My work with Victor Marek: a mathematician looks at answer set programming
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Conditional terms in semantic programming
- On constructive number fields and computability of solutions of PDEs
- Recursive terms in semantic programming
- Effective completeness theorems for modal logic
- Finitely presented expansions of computably enumerable semigroups
- Graphs are not universal for online computability
- A meaning based information theory - informalogical space: basic concepts and convergence of information sequences
- Lifting proofs from countable to uncountable mathematics
- Degree spectra of intrinsically c. e. relations
- Where automatic structures benefit from weighted automata
- Spectra of structures and relations
- Classification from a Computable Viewpoint
- On the Equimorphism Types of Linear Orderings
- scientific article; zbMATH DE number 4027419 (Why is no real title available?)
- scientific article; zbMATH DE number 1302880 (Why is no real title available?)
- Computably categorical structures and expansions by constants
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Generalizing Computability Theory to Abstract Algebras
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Limitwise monotonic functions, sets, and degrees on computable domains
- Computability and uncountable linear orders. I: Computable categoricity.
- Computable trees of Scott rank ω1CK, and computable approximation
- Up to equimorphism, hyperarithmetic is recursive
- On analogues of the Church-Turing thesis in algorithmic randomness
- Effective metric model theory
- 2005–06 Winter Meeting of the Association for Symbolic Logic
- Introduction
- Effectiveness in RPL, with applications to continuous logic
- The complexity of finding SUBSEQ(A)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249355)
