scientific article; zbMATH DE number 1302876
zbMATH Open0933.03043MaRDI QIDQ4249362FDOQ4249362
Authors: J. F. Knight
Publication date: 29 March 2000
Title of this publication is not available (Why is that?)
Recommendations
workersmodels of arithmeticTuring degreejump degreedynamic storage allocationrecursive modelsatomic diagramdegrees of isomorphic copiesdegrees of modelsmodels for highly non-recursive theories
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Models of arithmetic and set theory (03C62)
Cited In (18)
- Sequences of n-diagrams
- A fixed point for the jump operator on structures
- Title not available (Why is that?)
- Coding and definability in computable structures
- Invariance in ℰ* and ℰ_{Π}
- Degrees of Indiscernibles in Decidable Models
- Weak truth table degrees of structures
- Degrees of models
- Degrees of Recursively Saturated Models
- Effectively existentially-atomic structures
- Enumeration reducibility and computable structure theory
- Boolean algebras, Stone spaces, and the iterated Turing jump
- Title not available (Why is that?)
- Degrees of freedom and model search
- Measuring complexities of classes of structures
- Sufficiency conditions for theories with recursive models
- Some elementary degree-theoretic reasons why structures need similarity types
- The property ``arithmetic-is-recursive on a cone
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 Q4249362)