Undecidability without arithmetization

DOI10.1007/s11225-005-2976-1zbMath1080.03004OpenAlexW2062842033MaRDI QIDQ1780896

Andrzej Grzegorczyk

Publication date: 14 June 2005

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-005-2976-1

zbMATH Keywords

representabilitydecidabilityconcatenationKurt GödeldiscernibilityarithmetizationAlfred Tarski

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Related Items

CONSISTENCY AND THE THEORY OF TRUTH, The paradox of the knower revisited, Bases for structures and theories. I., INTERLEAVING LOGIC AND COUNTING, The logical strength of compositional principles, Weak theories of concatenation and arithmetic, On undecidability of concatenation theory for one-symbol languages, On theory of regular languages with the Kleene star operation, First-order concatenation theory with bounded quantifiers, Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\), MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY, Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories, The scope of Gödel's first incompleteness theorem, Mathematical intuition and natural numbers: a critical discussion, Structuralism and meta-mathematics, Arithmetic on semigroups, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, On decidability of theories of regular languages, FINDING THE LIMIT OF INCOMPLETENESS I, Weak essentially undecidable theories of concatenation