Recursion theory in a lower semilattice
The author considers the theory \(T\) with the axioms (1) \((\forall x)(\neg(x\prec x))\); (2) \((\forall x,y,z)(x\prec y\wedge y\prec z\rightarrow x\prec z)\); (3) \((\forall x,y,z)(g(x,y)\preceq x\wedge g(x,y)\preceq y\wedge ((z\prec y\wedge z\prec x)\rightarrow z\preceq g(x,y)))\); where \(x\preceq y\) is an abbreviation for \(x=y\wedge x\prec y\). This is a theory of partial order with greatest lower bound function. He proves that this theory possesses a \(\alpha_ 0\)-categorical complete decidable model completion and then he studies its unique decidable countable model. This model is interesting because it contains all countable models of \(T\). The main questions are about the lattice of recursively enumerable and recursive substructures.
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)
