Weak sequential theories of finite full binary trees

DOI10.1007/978-3-031-08740-0_18OpenAlexW4285249065MaRDI QIDQ2104270

Juvenal Murwanashyaka

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_18

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Pairs, sets and sequences in first-order theories
• Growing commas. A study of sequentiality and concatenation
• On interpretability between some weak essentially undecidable theories
• Undecidable theories
• Sequence encoding without induction
• A lattice of chapters of mathematics (interpretations between theorems [theories)]
• MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
• Some Prime Elements in the Lattice of Interpretability Types
• Axiomatizability by a schema
• Concatenation as a basis for arithmetic

This page was built for publication: Weak sequential theories of finite full binary trees