Abstract:
It has been established that a negative representable model is computable if and only if its standard enrichment with constants is isomorphically embedded in any model of a suitable computable enumerated set of universal sentences implemented in this model. It is shown that for computable enumerable sets of existential sentences this statement is incorrect.
Keywords:computable, negative and positive representations of models, standard enrichment, negative and positive diagram, universal and existential determinability.
Fulltext:
PDF file (364 kB)