Incompleteness Theorems, Large Cardinals, and Automata over Finite Words
DOI10.1007/978-3-319-55911-7_17zbMath1459.03055OpenAlexW2612243066MaRDI QIDQ2988824
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_17
independencecontext-free grammarslarge cardinalsPeano arithmeticpost correspondence problemlogic in computer scienceautomata and formal languagesmodels of set theoryincompleteness theoremsweighted automatoninaccessible cardinalsfinite words2-tape automatonfinitely generated matrix subsemigroups of \(\mathbb {Z}^{3\times 3}\)
Automata and formal grammars in connection with logical questions (03D05) Large cardinals (03E55) Gödel numberings and issues of incompleteness (03F40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Gödel incompleteness and finite combinatorics
- Independence results about context-free languages and lower bounds
- Set theory. An introduction to independence proofs
- Independence results in computer science?
- Set theory. An introduction to large cardinals
- A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
- Mortality in Matrix Semigroups
- Where is the Gödel-point hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive Ordinals
- Some problems in automata theory which depend on the models of set theory
- The Complexity of Infinite Computations In Models of Set Theory
- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
- Restricted one-counter machines with undecidable universe problems
- The Mathematical Import of Zermelo's Well-Ordering Theorem
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
