Incompleteness theorems, large cardinals, and automata over infinite words

DOI10.1007/978-3-662-47666-6_18zbMATH Open1440.03056OpenAlexW1171724780MaRDI QIDQ3449478FDOQ3449478

Authors: 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

Recommendations

• Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
• Incompleteness theorems, large cardinals, and automata over finite words
• Some problems in automata theory which depend on the models of set theory
• The Complexity of Infinite Computations In Models of Set Theory
• The logical strength of Büchi's decidability theorem

zbMATH Keywords

logic in computer sciencelarge cardinalsinfinite wordsautomata and formal languagesmodels of set theoryincompleteness theoremsinaccessible cardinals``\(\mathbf{ZFC}\) + there exist \(n\) inaccessible cardinals1-counter Büchi automaton2-tape Büchi automatonindependence from the axiomatic system

Mathematics Subject Classification ID

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

Cites Work

• Set theory. An introduction to independence proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Descriptive set theory
• Automata, logics, and infinite games. A guide to current research
• Title not available (Why is that?)
• 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
• Relations rationnelles infinitaires
• Title not available (Why is that?)
• Some problems in automata theory which depend on the models of set theory
• Decision problems for recognizable languages of infinite pictures
• Borel hierarchy and omega context free languages.
• Ambiguity of \(\omega \)-languages of Turing machines

Cited In (5)

• The logical strength of Büchi's decidability theorem
• Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
• Incompleteness theorems, large cardinals, and automata over finite words
• The logical strength of Büchi's decidability theorem
• Some problems in automata theory which depend on the models of set theory

This page was built for publication: Incompleteness theorems, large cardinals, and automata over infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449478)