Pages that link to "Item:Q1780896"

The following pages link to Undecidability without arithmetization (Q1780896):

Displaying 20 items.

• The paradox of the knower revisited (Q392283) (← links)
• 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)
• Mathematical intuition and natural numbers: a critical discussion (Q535375) (← links)
• Structuralism and meta-mathematics (Q707711) (← links)
• The logical strength of compositional principles (Q1704080) (← links)
• On decidability of theories of regular languages (Q2043872) (← links)
• Weak essentially undecidable theories of concatenation (Q2085573) (← links)
• Bases for structures and theories. I. (Q2198318) (← links)
• On undecidability of concatenation theory for one-symbol languages (Q2207016) (← links)
• On theory of regular languages with the Kleene star operation (Q2211370) (← links)
• First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
• The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
• CONSISTENCY AND THE THEORY OF TRUTH (Q3195585) (← links)
• Arithmetic on semigroups (Q3616353) (← 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)
• Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories (Q5404169) (← links)
• INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)