Maqola

Computability and Universal Determinability of Negatively Representable Models

R. N. DadazhanovNational University of Uzbekistan, 4 University str., 100174, Tashkent, Republic of Uzbekistan

Russian Mathematicsjournal2022en

ABI

Annotatsiya

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.

Mavzular

Computability, Logic, AI Algorithms Logic, Reasoning, and Knowledge Cellular Automata and Applications

Identifikatorlar

DOI: 10.3103/s1066369x22100036

Iqtiboslar va manbalar

1 ta iqtibos 18 ta foydalanilgan manba

Koʻrsatkichlar — AkademScholar · Tez orada