Weak essentially undecidable theories of concatenation

DOI10.1007/S00153-022-00820-YMaRDI QIDQ2085573zbMATH OpenOpenAlexFDO

Authors Juvenal Murwanashyaka

Publication date 18 October 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

first-order arithmeticinterpretabilitytheory of concatenation

Mathematics Subject Classification ID

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

Recommendations

• Weak theories of concatenation and arithmetic
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Arithmetic on semigroups
• Relatives of Robinson arithmetic
• On interpretability in the theory of concatenation

Cites work

• Arithmetic on semigroups
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decidable and undecidable fragments of first-order concatenation theory
• Degrees of formal systems
• Finding the limit of incompleteness. I
• First-order concatenation theory with bounded quantifiers
• Growing commas. A study of sequentiality and concatenation
• scientific article; zbMATH DE number 5295812 (Why is no real title available?)
• scientific article; zbMATH DE number 3053259 (Why is no real title available?)
• Logical number theory I. An introduction
• On interpretability between some weak essentially undecidable theories
• On interpretability in the theory of concatenation
• Recursive functions and existentially closed structures
• The classical decision problem.
• Undecidability without arithmetization
• Undecidable theories
• Variants of Robinson's essentially undecidable theoryR
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Why the theory R is special

Cited in

(15)

• On interpretability in the theory of concatenation
• On interpretability between some weak essentially undecidable theories
• On undecidability of concatenation theory for one-symbol languages
• First-order concatenation theory with bounded quantifiers
• Weak theories of concatenation and arithmetic
• Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• scientific article; zbMATH DE number 937384 (Why is no real title available?)
• Relatives of Robinson arithmetic
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
• scientific article; zbMATH DE number 3894493 (Why is no real title available?)
• scientific article; zbMATH DE number 5233159 (Why is no real title available?)
• Weak essentially undecidable theories of concatenation. II.
• A weak theory of building blocks
• A weak first-order theory of sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085573)