|
SEMINARS |
Seminars
"Proof Theory" and "Logic Online Seminar"
|
|||
|
Punctual structures, automatic structures and index sets. Part 2 N. A. Bazhenova, I. Sh. Kalimullinb a Novosibirsk State University b Kazan (Volga Region) Federal University |
|||
Abstract: A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. An interrelated notion is punctual structures where domain, functions, and relations belong to some fixed subrecursive class. In the first part we will give a sketch of the proof showing that the index set of punctually presentable computable structures is Language: English
|