Complexity of countable categoricity in finite languages
A.Ivanov
TL;DR
This paper investigates the computational complexity of identifying countably categorical and Ehrenfeucht theories within finite languages, focusing on the difficulty of their index sets.
Contribution
It provides new insights into the complexity classification of these theories, a topic not extensively explored before.
Findings
Determines the complexity class of the index set for countably categorical theories.
Analyzes the complexity of Ehrenfeucht theories in finite languages.
Establishes bounds on the computational difficulty of recognizing these theories.
Abstract
We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Advanced Topology and Set Theory · semigroups and automata theory