Abstract:
We estimate algorithmic complexity of the class of computable models of a finite and a graph signature that have a strong constructivization and are autostable relative to strong constructivizations.
Keywords:
model, computable model, constructive model, autostability, index sets.
Supported by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (grant NSh-860.2014.1) and by RFBR (project No. 14-01-00376).
Citation:
S. S. Goncharov, M. I. Marchuk, “Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations”, Algebra Logika, 54:6 (2015), 663–679; Algebra and Logic, 54:6 (2016), 428–439