Recursion theory in a lower semilattice

DOI10.2307/2275438zbMath0770.03011OpenAlexW2049135746MaRDI QIDQ4032870

Alex Feldman

Publication date: 1 April 1993

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275438

zbMATH Keywords

countable modeldecidable modelmodel completionrecursive structureslattice of recursively enumerable and recursive substructurespartial order with greatest lower bound function

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Some undecidability results for lattices in recursion theory
• Automorphisms of substructure lattices in recursive algebra

This page was built for publication: Recursion theory in a lower semilattice