Weak theories of concatenation and minimal essentially undecidable theories. An encounter of WTC and S2S
DOI10.1007/S00153-014-0391-XzbMATH Open1339.03054OpenAlexW1730786771MaRDI QIDQ481870FDOQ481870
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
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
interpretabilitytheory of concatenationminimal essentially undecidable theorymonadic second-order theory of two successors
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)
Cites Work
- Undecidable theories
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Undecidability without arithmetization
- Growing commas. A study of sequentiality and concatenation
- On interpretability in the theory of concatenation
- Title not available (Why is that?)
- Arithmetic on semigroups
- Title not available (Why is that?)
- Weak theories of concatenation and arithmetic
- Variants of Robinson's essentially undecidable theoryR
- Concatenation as a basis for arithmetic
- Title not available (Why is that?)
- Decidability without mathematics
Cited In (9)
- 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
- Weak essentially undecidable theories of concatenation. II.
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)
