Search Results - "Murwanashyaka, Juvenal"

Weak essentially undecidable theories of concatenation, part II by Murwanashyaka, Juvenal

“…We show that we can interpret concatenation theories in arithmetical theories without coding sequences by identifying binary strings with 2 × 2 matrices with…”
Get full text

Weak essentially undecidable theories of concatenation by Murwanashyaka, Juvenal

“…In the language { 0 , 1 , ∘ , ⪯ } , where 0 and 1 are constant symbols, ∘ is a binary function symbol and ⪯ is a binary relation symbol, we formulate two…”
Get full text

First-order concatenation theory with bounded quantifiers by Kristiansen, Lars, Murwanashyaka, Juvenal

“…We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results…”
Get full text

A weak theory of building blocks by Murwanashyaka, Juvenal

“…We apply the mereological concept of parthood to the coding of finite sequences. We propose a first‐order theory in which coding finite sequences is intuitive…”
Get full text

There are no minimal essentially undecidable theories by Murwanashyaka, Juvenal, Pakhomov, Fedor, Visser, Albert

“…Abstract We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories…”
Get full text

First-Order Concatenation Theory with Bounded Quantifiers by Kristiansen, Lars, Murwanashyaka, Juvenal

“…We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results…”
Get full text

Weak Essentially Undecidable Theories of Concatenation II by Murwanashyaka, Juvenal

“…We show that we can interpret concatenation theories in arithmetical theories without coding sequences…”
Get full text

Undecidability in First-Order Theories of Term Algebras Extended with a Substitution Operator by 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…”
Get full text

Notes on Interpretability between Weak First-order Theories: Theories of Sequences by Kristiansen, Lars, 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…”
Get full text

First-Order Concatenation Theory with Bounded Quantifiers by Kristiansen, Lars, Murwanashyaka, Juvenal

“…We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results…”
Get full text

There are no minimal essentially undecidable Theories by Pakhomov, Fedor, Murwanashyaka, Juvenal, Visser, Albert

“…We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories…”
Get full text

Notes on Fragments of First-Order Concatenation Theory by Kristiansen, Lars, Murwanashyaka, Juvenal

“…We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is…”
Get full text