Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words

Abstract : We prove that there exist some 1-counter Büchi automata A_n for which some elementary properties are independent of theories like T_n =: ZFC + " There exist (at least) n inaccessible cardinals " , for integers n ≥ 1. In particular , if T_n is consistent, then " L(A_n) is Borel " , " L(A_n) is arithmetical " , " L(A_n) is ω-regular " , " L(A_n) is deterministic " , and " L(A_n) is unambiguous " are provable from ZFC + " There exist (at least) n+1 inaccessible cardinals " but not from ZFC + " There exist (at least) n inaccessible cardinals ". We prove similar results for infinitary rational relations accepted by 2-tape Büchi automata.
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01234945
Contributor : Olivier Finkel <>
Submitted on : Friday, November 27, 2015 - 2:28:40 PM
Last modification on : Thursday, April 4, 2019 - 1:27:25 AM
Document(s) archivé(s) le : Saturday, April 29, 2017 - 2:48:58 AM

Files

ICALP-2015-O-Finkel.pdf
Files produced by the author(s)

Identifiers

Citation

Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words. 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Jul 2015, Kyoto, Japan. pp.222--233, ⟨10.1007/978-3-662-47666-6_18⟩. ⟨hal-01234945⟩

Share

Metrics

Record views

612

Files downloads

112