Incompleteness Theorems, Large Cardinals, and Automata over Finite Words

Abstract : We prove that one can construct various kinds of automata over finite words for which some elementary properties are actually independent from strong set theories like Tn =:ZFC + " There exist (at least) n inaccessible cardinals " , for integers n ≥ 0. In particular, we prove independence results for languages of finite words generated by context-free grammars, or accepted by 2-tape or 1-counter automata. Moreover we get some independence results for weighted automata and for some related finitely generated subsemigroups of the set Z¨{3×3} of 3-3 matrices with integer entries. Some of these latter results are independence results from the Peano axiomatic system PA.
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download
Contributor : Olivier Finkel <>
Submitted on : Friday, September 15, 2017 - 7:17:20 PM
Last modification on : Thursday, April 4, 2019 - 1:26:04 AM
Document(s) archivé(s) le : Sunday, December 17, 2017 - 2:36:32 PM


Files produced by the author(s)



Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017., Apr 2017, Bern, Switzerland. pp.231 - 246, ⟨10.1007/978-3-319-55911-7⟩. ⟨hal-01588572⟩



Record views


Files downloads