Weak theories of concatenation and minimal essentially undecidable theories. An encounter of WTC and S2S

DOI10.1007/S00153-014-0391-XMaRDI QIDQ481870zbMATH OpenOpenAlexFDO

Authors Kojiro Higuchi, Yoshihiro Horihata

Publication date 15 December 2014

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

Full work available at URL https://doi.org/10.1007/s00153-014-0391-x

zbMATH Keywords

interpretabilitytheory of concatenationminimal essentially undecidable theorymonadic second-order theory of two successors

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Undecidability and degrees of sets of sentences (03D35) Relative consistency and interpretations (03F25)

Recommendations

• Weak essentially undecidable theories of concatenation
• Weak theories of concatenation and arithmetic
• Separations of theories in weak bounded arithmetic
• Proof-theoretic conservations of weak weak intuitionistic constructive set theories
• On interpretability between some weak essentially undecidable theories
• About the proof-theoretic ordinals of weak fixed point theories
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• Weak cardinality theorems for first-order logic (extended abstract)
• Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
• The Property of Being Binary for ℵ0-Categorical Weakly o-Minimal Theories

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 1748963 (Why is no real title available?)
• scientific article; zbMATH DE number 3285224 (Why is no real title available?)
• Arithmetic on semigroups
• Concatenation as a basis for arithmetic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decidability without mathematics
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Undecidability without arithmetization
• Undecidable theories
• Variants of Robinson's essentially undecidable theoryR
• Weak theories of concatenation and arithmetic

Cited in

(9)

• Weak essentially undecidable theories of concatenation. II.
• Weak essentially undecidable theories of concatenation
• On interpretability between some weak essentially undecidable theories
• Weak theories of concatenation and arithmetic
• Current research on Gödel's incompleteness theorems
• Growing commas. A study of sequentiality and concatenation
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
• Finding the limit of incompleteness. I
• First-order concatenation theory with bounded quantifiers

This page was built for publication: Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)

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