scientific article; zbMATH DE number 1302876

MaRDI QIDQ4249362zbMATH OpenFDO

Authors J. F. Knight

Publication date 29 March 2000

zbMATH Keywords

workersmodels of arithmeticTuring degreejump degreedynamic storage allocationrecursive modelsatomic diagramdegrees of isomorphic copiesdegrees of modelsmodels for highly non-recursive theories

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 4012589
• Degrees of Recursively Saturated Models
• The degrees of categorical theories with recursive models
• Orderings with αth Jump Degree 0 (α)

Cited in

(18)

• Enumeration reducibility and computable structure theory
• scientific article; zbMATH DE number 2222018 (Why is no real title available?)
• Weak truth table degrees of structures
• Degrees of freedom and model search
• Coding and definability in computable structures
• A fixed point for the jump operator on structures
• Degrees of models
• scientific article; zbMATH DE number 4012589 (Why is no real title available?)
• The property ``arithmetic-is-recursive on a cone
• Degrees of Recursively Saturated Models
• Invariance in ℰ* and ℰ_{Π}
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Degrees of Indiscernibles in Decidable Models
• Measuring complexities of classes of structures
• Some elementary degree-theoretic reasons why structures need similarity types
• Sufficiency conditions for theories with recursive models
• Sequences of n-diagrams
• Effectively existentially-atomic structures

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)