Rekursivno perechislimye mnozhestva i stepeni nerazreshimosti

Kazanʹ: Izdatelʹstvo Kazanskogo universiteta (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.6.A784 1986

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Lokalʹnai︠a︡ teorii︠a︡ stepeneĭ nerazreshimosti i [Delta ⁰2 in column] - mnozhestva.M. M. Arslanov - 1987 - Kazanʹ: Izdatelʹstvo Kazanskogo universiteta.
Degrees of unsolvability: structure and theory.Richard L. Epstein - 1979 - New York: Springer Verlag.
Bounded Distributive Lattices with Two Subordinations.Sergio Celani & Ramon Jansana - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 217-252.
Decision problem for separated distributive lattices.Yuri Gurevich - 1983 - Journal of Symbolic Logic 48 (1):193-196.
Boolean Algebras and Distributive Lattices Treated Constructively.John L. Bell - 1999 - Mathematical Logic Quarterly 45 (1):135-143.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Computational complexity for bounded distributive lattices with negation.Dmitry Shkatov & C. J. Van Alten - 2021 - Annals of Pure and Applied Logic 172 (7):102962.
On Categorical Equivalence of Weak Monadic Residuated Distributive Lattices and Weak Monadic c-Differential Residuated Distributive Lattices.Jun Tao Wang, Yan Hong She, Peng Fei He & Na Na Ma - 2023 - Studia Logica 111 (3):361-390.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.
Recursion theory and complexity: proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997.Marat Mirzaevich Arslanov & Steffen Lempp (eds.) - 1999 - New York: W. de Gruyter.
Monadic Distributive Lattices.Aldo Figallo, Inés Pascual & Alicia Ziliani - 2007 - Logic Journal of the IGPL 15 (5-6):535-551.
Embeddings into the Medvedev and Muchnik lattices of Π0 1 classes.Stephen Binns & Stephen G. Simpson - 2004 - Archive for Mathematical Logic 43 (3):399-414.
Free Modal Lattices via Priestley Duality.Claudia B. Wegener - 2002 - Studia Logica 70 (3):339-352.
Free modal lattices via Priestley duality.Claudia B. Wegener - 2002 - Studia Logica 70 (3):339 - 352.

Analytics

Added to PP
2023-05-26

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references