Weak sequential theories of finite full binary trees

DOI10.1007/978-3-031-08740-0_18MaRDI QIDQ2104270zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Model complete theories of trees
• On quantification of weak sequential completeness
• First-order theories of bounded trees
• A first-order axiomatization of the theory of finite trees
• Weak Kleene Algebra and Computation Trees
• Restricted generating trees for weak orderings
• A coinductive calculus of binary trees
• A weakening of the axiom of choice for the standard binary tree.
• Trees and finite satisfiability: proof of a conjecture of Burgess
• scientific article; zbMATH DE number 1894708

Cites work

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

Cited in

(6)

• Strong WQO Tree Theorems
• scientific article; zbMATH DE number 4035798 (Why is no real title available?)
• Weakly binary expansions of dense meet‐trees
• A weak theory of building blocks
• A weak first-order theory of sequences
• More on \(\mathrm{SOP}_1\) and \(\mathrm{SOP}_2\)

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

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