4.2 Article

There are no minimal essentially undecidable theories

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Mathematics

Weak essentially undecidable theories of concatenation

Juvenal Murwanashyaka

Summary: This passage describes the formulation of two theories, WD and D, in a specific language where constant, function, and relation symbols are used. These theories are mutually interpreted with arithmetic theories R and Q respectively. The intended model for WD and D is generated by certain elements in a free semigroup, extended with string concatenation and the prefix relation. Unlike Q, WD and D are purely universally axiomatized.

ARCHIVE FOR MATHEMATICAL LOGIC (2022)

Article Computer Science, Artificial Intelligence

On Q

Albert Visser

SOFT COMPUTING (2017)