Pages that link to "Item:Q1038605"

The following pages link to Growing commas. A study of sequentiality and concatenation (Q1038605):

Displaying 24 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)
• The logical strength of compositional principles (Q1704080) (← links)
• Undecidability without arithmetization (Q1780896) (← links)
• On decidability of theories of regular languages (Q2043872) (← links)
• Weak essentially undecidable theories of concatenation (Q2085573) (← links)
• Weak sequential theories of finite full binary trees (Q2104270) (← links)
• On interpretability between some weak essentially undecidable theories (Q2106592) (← links)
• Bases for structures and theories. I. (Q2198318) (← links)
• On undecidability of concatenation theory for one-symbol languages (Q2207016) (← links)
• First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
• The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
• Concatenation of finite sequences (Q2416850) (← links)
• Sequence encoding without induction (Q2888636) (← links)
• CONSISTENCY AND THE THEORY OF TRUTH (Q3195585) (← 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)
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES (Q5052004) (← links)
• Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories (Q5404169) (← links)
• AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING (Q5414134) (← links)
• INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
• A weak theory of building blocks (Q6589164) (← links)
• Quantifier-free induction for lists (Q6617170) (← links)