Computability and Universal Determinability of Negatively Representable Models

Аннотация

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.

Темы

Идентификаторы

DOI

10.3103/s1066369x22100036

Цитирования и источники