Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words - Archive ouverte HAL
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
ICALP-2015-O-Finkel.pdf (163.52 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01234945 , version 1 (27-11-2015)

Identifiers

Cite

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⟩
370 View
246 Download

Altmetric

Share

More