Embeddings of computable structures

DOI10.1215/00294527-2010-004zbMATH Open1207.03041OpenAlexW2108245979MaRDI QIDQ976535FDOQ976535

Asher M. Kach, Reed Solomon, Oscar Levin

Publication date: 11 June 2010

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2010-004

zbMATH Keywords

computable structurecomputable presentationcomputable algebraically closed fieldcomputable Boolean algebracomputable embeddingcomputable equivalencecomputable ordered abelian groupcomputable tree

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computable embeddings and strongly minimal theories

This page was built for publication: Embeddings of computable structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976535)