Effective choice operations on constructive and positive models
Article
Received:
- 17 Downloads
Keywords
Mathematical Logic Positive Model Effective Choice Choice Operation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Yu. G. Ventsov, “Effective choice for relations and reducibilities in classes of constructive and positive models,”Algebra Logika, 31, No. 2, 101–118 (1991).Google Scholar
- 2.Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).Google Scholar
- 3.C. J. Ash, “Categoricity in hyperarithmetical degrees,”Ann. Pure Appl. Log., 34, No. 1, 1–14 (1987).Google Scholar
- 4.J. Myhill and J. C. Shepherdson, “Effective operations on partial recursive functions,”Zeit. Math. Log. Grund. Math., 1, 310–317 (1955).Google Scholar
- 5.V. A. Uspenskii, “On enumeration operators,”Dokl. Akad. Nauk SSSR, 103, 773–776 (1955).Google Scholar
- 6.V. V. V'ugin, “Some examples of upper semilattices of computable enumerations,”Algebra Logika, 13, No. 5, 512–529 (1973).Google Scholar
- 7.J. Chisholm, “The complexity of intrinsically r.e. subsets of existentially decidable models,”J. Symb. Log., 55, No. 3, (1990).Google Scholar
- 8.G. Kreisel, D. Lacombe, and J. R. Shöenfield, “Partial recursive functionals and effective operations,” in:Constructivity in Mathematics, North-Holland (1957), pp. 195–207.Google Scholar
- 9.G. S. Ceytin, “Algorithmic operators in constructive complete separable metric spaces,”Dokl. Akad. Nauk, 128, 49–52 (1959).Google Scholar
Copyright information
© Plenum Publishing Corporation 1993