Theory of computational complexity. Part 8. Transl. from the Russian

DOI10.1007/S10958-005-0351-4zbMath1078.68520OpenAlexW2074013392MaRDI QIDQ2577628

No author found.

Publication date: 5 January 2006

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-005-0351-4

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to field theory (12-06)

Cites Work

• Intuitionistic formal theories with realizability in subrecursive classes

This page was built for publication: Theory of computational complexity. Part 8. Transl. from the Russian