Weak theories of concatenation and arithmetic
From MaRDI portal
(Redirected from Publication:435240)
Recommendations
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- Weak essentially undecidable theories of concatenation
- On undecidability of concatenation theory for one-symbol languages
- On interpretability in the theory of concatenation
- Arithmetic on semigroups
Cites work
- scientific article; zbMATH DE number 5295812 (Why is no real title available?)
- scientific article; zbMATH DE number 3632437 (Why is no real title available?)
- scientific article; zbMATH DE number 1215477 (Why is no real title available?)
- scientific article; zbMATH DE number 1062120 (Why is no real title available?)
- scientific article; zbMATH DE number 3999883 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- scientific article; zbMATH DE number 3285224 (Why is no real title available?)
- scientific article; zbMATH DE number 3020851 (Why is no real title available?)
- An interpretation of Robinson arithmetic in its Grzegorczyk's weaker variant
- Arithmetic on semigroups
- Concatenation as a basis for arithmetic
- Decorated linear order types and the theory of concatenation
- Growing commas. A study of sequentiality and concatenation
- On interpretability in the theory of concatenation
- Relatives of Robinson arithmetic
- Undecidability without arithmetization
- Undecidable theories
- Variants of Robinson's essentially undecidable theoryR
Cited in
(11)- Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
- Growing commas. A study of sequentiality and concatenation
- On interpretability in the theory of concatenation
- Relatives of Robinson arithmetic
- First-order concatenation theory with bounded quantifiers
- The strength of replacement in weak arithmetic
- Weak essentially undecidable theories of concatenation
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
- Weak essentially undecidable theories of concatenation. II.
- Decorated linear order types and the theory of concatenation
This page was built for publication: Weak theories of concatenation and arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435240)
