Computable Structure and Non-Structure Theorems
Authors:
- 1 November 2002
- journal article
- Published by Springer Nature in Algebra and Logic
- Vol. 41 (6) , 351-373
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Degrees of orderings not isomorphic to recursive linear orderingsAnnals of Pure and Applied Logic, 1991
- Jumps of orderingsTransactions of the American Mathematical Society, 1990
- Pairs of recursive structuresAnnals of Pure and Applied Logic, 1990
- Higher Recursion Theory1990
- What is a Structure Theory?Bulletin of the London Mathematical Society, 1987
- Categoricity in hyperarithmetical degreesAnnals of Pure and Applied Logic, 1987
- Recursive labelling systems and stability of recursive structures in hyperarithmetical degreesTransactions of the American Mathematical Society, 1986
- Classification of first order theories which have a structure theoremBulletin of the American Mathematical Society, 1985
- Autostability and computable families of constructivizationsAlgebra and Logic, 1975
- Recursive pseudo-well-orderingsTransactions of the American Mathematical Society, 1968