A weak theory of building blocks

DOI10.1002/malq.202300015MaRDI QIDQ6589164

Juvenal Murwanashyaka

Publication date: 19 August 2024

Published in: Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairs, sets and sequences in first-order theories
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Undecidability without arithmetization
• Weak essentially undecidable theories of concatenation
• Weak sequential theories of finite full binary trees
• On interpretability between some weak essentially undecidable theories
• Decidability of general extensional mereology
• Undecidable theories
• Interpretability in Robinson's Q
• Sequence encoding without induction
• A lattice of chapters of mathematics (interpretations between theorems [theories)]
• Arithmetic on semigroups
• Set-theoretic mereology
• Mereology
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
• Some Prime Elements in the Lattice of Interpretability Types
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Concatenation as a basis for arithmetic
• The classical decision problem.
• TREE THEORY: INTERPRETABILITY BETWEEN WEAK FIRST-ORDER THEORIES OF TREES

This page was built for publication: A weak theory of building blocks