Academic interests
Mathematical logic
Tags:
Mathematics,
Logic
Publications


Murwanashyaka, Juvenal
(2022).
Weak Sequential Theories of Finite Full Binary Trees.
Lecture Notes in Computer Science (LNCS).
ISSN 03029743.
13359,
p. 208–219.
doi:
10.1007/9783031087400_18.
Full text in Research Archive
Show summary
We study a firstorder theory of finite full binary trees with an axiom schema of open induction. We show that this theory is sequential by constructing a direct interpretation of Adjunctive Set Theory in a very weak finitely axiomatized subtheory. We show that weakening the latter theory by removal of an axiom which states that the subtree relation is transitive gives a theory that directly interprets Vaught’s weak set theory, a nonfinitely axiomatizable fragment of Adjunctive Set Theory.





View all works in Cristin
Published Aug. 13, 2019 2:12 PM
 Last modified Aug. 22, 2019 8:20 PM