Computability theory
It is shown that set of homogeneous automatic structures is $Pi^0_3$-complete. It is shown that set of automatically homogeneous automatic structures is $Pi^0_2$-complete.
Mail to Webmaster alc9@math.nsc.ru |
|Home Page| |English Part| |
Go to Home |