Generalized hyperarithmetical computability over structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6536312 (Why is no real title available?)
- scientific article; zbMATH DE number 3921954 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 890268 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A jump inversion theorem for the semilattices of \(\Sigma\)-degrees
- Completing theories by forcing
- Degrees of presentability of structures. I
- Degrees of presentability of structures. II
- Effective model theory vs. recursive model theory
- Elementary induction on abstract structures
- First-order dynamic logic
- Generic copies of countable structures
- On processes and structures
- On quasiregular structures with computable signatures
- Processes and structures on approximation spaces
- The theory of A-spaces
- Theory and Applications of Models of Computation
Cited in
(5)
This page was built for publication: Generalized hyperarithmetical computability over structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401541)