Scholarlink

<p>We prove the algorithmic undecidability of several simple fragments of the positive theories of free noncyclic semigroups, consisting of positive formulas with simple quantifier prefixes and with a&#xa0;small number of constants in their quantifier-free part.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Undecidable Fragments of Positive Theories of Free Semigroups

  • 期刊论文

  • 发表日期：

    2025年9月30日

查看全文
  • A. I. Zetkina,
  • V. G. Durnev

摘要

We prove the algorithmic undecidability of several simple fragments of the positive theories of free noncyclic semigroups, consisting of positive formulas with simple quantifier prefixes and with a small number of constants in their quantifier-free part.