Description of structures computable in polynomial time

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic Pub Date : 2025-07-16 DOI:10.1016/j.apal.2025.103636

Pavel E. Alaev

引用次数: 0

Abstract

We describe structures computable in polynomial time (P-computable) by a simple and short criterion. We prove that every substructure of a P-computable structure generated by a c.e. set also has a P-computable presentation. For example, we easily prove that every computable torsion-free Abelian group has a P-computable presentation.

查看原文本刊更多论文

在多项式时间内可计算的结构描述

我们用一个简单而简短的准则描述了多项式时间内可计算的结构（p -可计算）。证明了由c.e.集生成的p -可计算结构的每个子结构也具有p -可计算表示。例如，我们很容易证明每个可计算的无扭阿贝尔群都具有p -可计算的表示。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Annals of Pure and Applied Logic 数学-数学

CiteScore

1.40

自引率

12.50%

发文量

审稿时长

200 days

期刊介绍： The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.