Abstract
A new, logical approach is propounded to resolve the decidability problem for the hierarchies of Straubing and Brzozowski based on preservation theorems in model theory, a theorem of Higman, and the Rabin tree theorem. We thus manage to obtain purely logical, short proofs of some known decidability facts, which definitely may be of methodological interest. The given approach also applies in some other similar situations, for instance, to the hierarchies of formulas modulo a theory of linear orderings with finitely many unary predicates.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
