Effective choice for relations and reducibilities in classes of constructive and positive models-Reference-Cited by-同舟云学术

Effective choice for relations and reducibilities in classes of constructive and positive models

Published:1992-03 Issue:2 Volume:31 Page:63-73
ISSN:0002-5232
Container-title:Algebra and Logic
language:en
Short-container-title:Algebr Logic

Author:

Ventsov Yu. G.

Publisher

Springer Science and Business Media LLC

Subject

Logic,Analysis

Link

http://link.springer.com/content/pdf/10.1007/BF02259845.pdf

Reference15 articles.

1. Yu. G. Ventosov, "On effective choice of constructivizations," Siberian Advances in Mathematics,2, No. 1, 1–7 (1992).

2. Yu. G. Ventsov, "Effective choice of constructivizations and recursive compatibility of problems on constructive models," Algebra Logika,31, No. 1, 3–20 (1992).

3. Yu. G. Ventsov, "Nonuniform stability of models," Algebra Logika,26, No. 6, 68–70 (1987).

4. Yu. L. Ershov, Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).

5. V. A. Uspenskii and A. L. Semenov, Theory of Algorithms: Fundamental Discoveries and Applications [in Russian], Nauka, Moscow (1987).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of the theory of a computably presented metric structure;Archive for Mathematical Logic;2023-06-09

2. On Decidable Categoricity and Almost Prime Models;Siberian Advances in Mathematics;2020-07

3. COMPUTABLE POLISH GROUP ACTIONS;The Journal of Symbolic Logic;2018-06

4. Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey;Computability and Complexity;2016-12-01

5. Effectively Existentially-Atomic Structures;Computability and Complexity;2016-12-01