Search
Now showing items 11-20 of 34
On the reducibility of function classes
(Latvia State University, 1972)
N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, ...
On computation in the limit by non-deterministic Turing machines
(Scientific Proceedings of Latvia State University, 1974)
The double-incompleteness theorem
(Stiinca, Kishinev, 1976)
Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is ...
The double-incompleteness theorem
(Latvia State University, 1975)
Let T be a theory, Q - a metatheory of T. Under certain conditions there exist T-undecidable sentences for which this undecidability cannot be proved in Q.
For English translation and proof, see K. Podnieks What is ...
Arheoloģija un etnogrāfija, 11
(Izdevniecība "Zinātne", 1974)
Arheoloģija un etnogrāfija, 9
(Izdevniecība "Zinātne", 1970)
Arheoloģija un etnogrāfija, 13
(Izdevniecība "Zinātne", 1979)
Arheoloģija un etnogrāfija, 12
(Izdevniecība "Zinātne", 1978)
Arheoloģija un etnogrāfija, 10
(Izdevniecība "Zinātne", 1973)