On interpretability in the theory of concatenation

DOI10.1215/00294527-2008-029zbMath1190.03051OpenAlexW2079956582MaRDI QIDQ1038606

Vítězslav Švejdar

Publication date: 18 November 2009

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2008-029

zbMATH Keywords

interpretabilityconcatenationRobinson arithmeticessential undecidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Relative consistency and interpretations (03F25)

Related Items (13)

Bases for structures and theories. I. ⋮ Weak theories of concatenation and arithmetic ⋮ On undecidability of concatenation theory for one-symbol languages ⋮ 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 ⋮ Arithmetic on semigroups ⋮ On decidability of theories of regular languages ⋮ Deflationism beyond arithmetic ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Weak essentially undecidable theories of concatenation

This page was built for publication: On interpretability in the theory of concatenation