Punctual Structures and Primitive Recursive Reducibility

被引：0
|
作者：
I. Sh. Kalimullin
机构：
[1] N.I. Lobachevskii Institute of Mathematics and Mechanics,
[2] Kazan (Volga Region) Federal University,undefined
来源：
Lobachevskii Journal of Mathematics | 2022年 / 43卷
关键词：
punctual algebraic structure; computable function; primitive recursive function;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：582 / 586
页数：4
相关论文
共 50 条
  • [1] Punctual Structures and Primitive Recursive Reducibility
    Kalimullin, I. Sh
    LOBACHEVSKII JOURNAL OF MATHEMATICS, 2022, 43 (03) : 582 - 586
  • [2] Undecidability of the degree structure of primitive recursive m-reducibility
    Kalmurzayev, Birzhan S.
    Bazhenov, Nikolay A.
    Iskakov, Alibek M.
    JOURNAL OF LOGIC AND COMPUTATION, 2024,
  • [3] Primitive Recursive Degree Spectra of Structures
    Kalimullin, Iskander
    UNITY OF LOGIC AND COMPUTATION, CIE 2023, 2023, 13967 : XXV - XXVII
  • [4] REDUCIBILITY OF PUNCTUAL HILBERT SCHEMES OF CONE VARIETIES
    Miro-Roig, Rosa M.
    Pons-Llopis, Joan
    COMMUNICATIONS IN ALGEBRA, 2013, 41 (05) : 1776 - 1780
  • [5] Primitive recursive equivalence relations and their primitive recursive complexity
    Bazhenov, Nikolay
    Ng, Keng Meng
    San Mauro, Luca
    Sorbi, Andrea
    COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2022, 11 (3-4): : 187 - 221
  • [6] On reducibility of partial recursive functions
    Dëgtev, AN
    Sakunova, ES
    SIBERIAN MATHEMATICAL JOURNAL, 2000, 41 (06) : 1111 - 1114
  • [7] THE REDUCIBILITY BY GENERAL RECURSIVE OPERATORS
    KANOVICH, MI
    DOKLADY AKADEMII NAUK SSSR, 1983, 273 (04): : 793 - 796
  • [8] On Reducibility of Partial Recursive Functions
    A. N. Dëgtev
    E. S. Sakunova
    Siberian Mathematical Journal, 2000, 41 : 1111 - 1114
  • [9] REDUCIBILITY OF PARTIAL RECURSIVE FUNCTIONS
    DEGTEV, AN
    SIBERIAN MATHEMATICAL JOURNAL, 1975, 16 (05) : 741 - 754
  • [10] Punctual definability on structures
    Kalimullin, Iskander
    Melnikov, Alexander
    Montalban, Antonio
    ANNALS OF PURE AND APPLIED LOGIC, 2021, 172 (08)
12345