Recursive properties of relations on models

DOI10.1016/0168-0072(93)90150-CzbMath0793.03036MaRDI QIDQ687281

Geoffrey R. Hird

Publication date: 21 August 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

recursive modelrecursive representationsrecursive vector spacerecursively enumerable relations

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

Orbits of maximal vector spaces ⋮ On the learnability of vector spaces ⋮ Quasi-simple relations in copies of a given recursive structure ⋮ Possible degrees in recursive copies. II ⋮ Turing degrees of hypersimple relations on computable structures ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Computable isomorphisms, degree spectra of relations, and Scott families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphisms of substructure lattices in recursive algebra
• Recursion theory on fields and abstract dependence
• Strong and weak constructivization and computable families
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• The first order properties of products of algebraic systems
• Recursive isomorphism types of recursive Boolean algebras
• Automorphisms of supermaximal subspaces
• Effective content of field theory
• On r.e. and co-r.e. vector spaces with nonextendible bases
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
• Recursively enumerable vector spaces

This page was built for publication: Recursive properties of relations on models