The following pages link to (Q3509164):
Displaying 11 items.
- Weak theories of concatenation and arithmetic (Q435240) (← links)
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) (Q481870) (← links)
- On decidability of theories of regular languages (Q2043872) (← links)
- Weak essentially undecidable theories of concatenation (Q2085573) (← links)
- On interpretability between some weak essentially undecidable theories (Q2106592) (← links)
- Bases for structures and theories. I. (Q2198318) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY (Q4640303) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- FINDING THE LIMIT OF INCOMPLETENESS I (Q4984861) (← links)
