Recursion theory in a lower semilattice

DOI10.2307/2275438zbMATH Open0770.03011OpenAlexW2049135746MaRDI QIDQ4032870FDOQ4032870

Authors: 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

Recommendations

• Elementary theories and hereditary undecidability for semilattices of numberings
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• Maximal theories
• Sufficiency conditions for theories with recursive models

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Elementary descent recursion and proof theory
• A countable model for the theory of complete dense binary order
• Title not available (Why is that?)

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

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