Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words

DOI10.1007/978-3-662-47666-6_18zbMath1440.03056OpenAlexW1171724780MaRDI QIDQ3449478

Olivier Finkel

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_18

zbMATH Keywords

large cardinalsinfinite wordslogic in computer scienceautomata and formal languagesmodels of set theory2-tape Büchi automatonincompleteness theoremsinaccessible cardinals``\(\mathbf{ZFC}\) + there exist \(n\) inaccessible cardinals1-counter Büchi automatonindependence from the axiomatic system

Mathematics Subject Classification ID

Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05) Consistency and independence results (03E35) Large cardinals (03E55)

Related Items (2)

Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words ⋮ Incompleteness Theorems, Large Cardinals, and Automata over Finite Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations rationnelles infinitaires
• Descriptive set theory
• Set theory. An introduction to independence proofs
• Borel hierarchy and omega context free languages.
• Automata, logics, and infinite games. A guide to current research
• Ambiguity of {\omega}-Languages of Turing Machines
• Some problems in automata theory which depend on the models of set theory
• Decision Problems for Recognizable Languages of Infinite Pictures
• The Complexity of Infinite Computations In Models of Set Theory
• Borel ranks and Wadge degrees of context free $\omega$-languages
• On the Accepting Power of 2-Tape Büchi Automata

This page was built for publication: Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words