Weak essentially undecidable theories of concatenation

DOI10.1007/s00153-022-00820-yOpenAlexW4220738780MaRDI QIDQ2085573

Juvenal Murwanashyaka

Publication date: 18 October 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-022-00820-y

zbMATH Keywords

interpretabilityfirst-order arithmetictheory of concatenation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Gödel numberings and issues of incompleteness (03F40) Relative consistency and interpretations (03F25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Logical number theory I. An introduction
• Decidable and undecidable fragments of first-order concatenation theory
• Undecidability without arithmetization
• On interpretability between some weak essentially undecidable theories
• First-order concatenation theory with bounded quantifiers
• Undecidable theories
• Degrees of formal systems
• Arithmetic on semigroups
• Variants of Robinson's essentially undecidable theoryR
• FINDING THE LIMIT OF INCOMPLETENESS I
• Recursive functions and existentially closed structures
• Decidability of Second-Order Theories and Automata on Infinite Trees
• The classical decision problem.

This page was built for publication: Weak essentially undecidable theories of concatenation