Switch to: Citations

Add references

You must login to add references.
  1. The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
    One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. Unlike the commonly used degrees of structures, the structure degree measure is total. We introduce and study the jump operation for structure degrees. We prove that it has all natural jump properties (including jump inversion theorem, theorem of Ash), which show that our definition is relevant. We study the relation between the structure degree jump (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A note on the hyperarithmetical hierarchy.H. B. Enderton & Hilary Putnam - 1970 - Journal of Symbolic Logic 35 (3):429-430.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Coding and Definability in Computable Structures.Antonio Montalbán - 2018 - Notre Dame Journal of Formal Logic 59 (3):285-306.
    These are the lecture notes from a 10-hour course that the author gave at the University of Notre Dame in September 2010. The objective of the course was to introduce some basic concepts in computable structure theory and develop the background needed to understand the author’s research on back-and-forth relations.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
    Download  
     
    Export citation  
     
    Bookmark   42 citations