Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Murwanashyaka, Juvenal"'
We introduce a first-order theory $\mathsf{Seq}$ which is mutually interpretable with Robinson's $\mathsf{Q}$. The universe of a standard model for $\mathsf{Seq}$ consists of sequences. We prove that $\mathsf{Seq}$ directly interprets the adjuctive s
Externí odkaz:
http://arxiv.org/abs/2402.14286
We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.
Externí odkaz:
http://arxiv.org/abs/2207.08174
Autor:
Murwanashyaka, Juvenal
We show that we can interpret concatenation theories in arithmetical theories without coding sequences.
Externí odkaz:
http://arxiv.org/abs/2112.13907
Autor:
Murwanashyaka, Juvenal
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction of Post`s C
Externí odkaz:
http://arxiv.org/abs/2111.00573
Autor:
Murwanashyaka, Juvenal1 (AUTHOR) juvenalm@math.uio.no
Publikováno v:
Archive for Mathematical Logic. May2024, Vol. 63 Issue 3/4, p353-390. 38p.
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
Comment: arXiv
Comment: arXiv
Externí odkaz:
http://arxiv.org/abs/2003.04964
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
Externí odkaz:
http://arxiv.org/abs/1804.06367
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Murwanashyaka, Juvenal
Publikováno v:
Murwanashyaka, Juvenal . Weak Sequential Theories of Finite Full Binary Trees. Revolutions and Revelations in Computability -18th Conference on Computability in Europe, CiE 2022 Swansea, UK, July 11–15, 2022 Proceedings. 2022, 208-219 Springer Nature
Externí odkaz:
http://hdl.handle.net/10852/94700
https://www.duo.uio.no/bitstream/handle/10852/94700/1/Murwanashyaka_WeakSequentialTheories.pdf
https://www.duo.uio.no/bitstream/handle/10852/94700/1/Murwanashyaka_WeakSequentialTheories.pdf
Autor:
Murwanashyaka, Juvenal
Publikováno v:
Murwanashyaka, Juvenal . Hilbert's Tenth Problem for Term Algebras with a Substitution Operator. Revolutions and Revelations in Computability -18th Conference on Computability in Europe, CiE 2022 Swansea, UK, July 11–15, 2022 Proceedings. 2022, 196-207 Springer Nature
Externí odkaz:
http://hdl.handle.net/10852/94701
https://www.duo.uio.no/bitstream/handle/10852/94701/1/Murwanashyaka_Hilberts10thProblem.pdf
https://www.duo.uio.no/bitstream/handle/10852/94701/1/Murwanashyaka_Hilberts10thProblem.pdf