Search
Now showing items 11-16 of 16
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 ...
Platonism, intuition and the nature of mathematics
(Bulgarian Academy of Sciences, Sofia, 1988)
Platonism is an essential aspect of mathematical method. Mathematicians are learned ability " t o l i v e " in the "world" of mathematical concepts. Here we have the main source of the creative power of mathematics, and ...
Inductive inference of recursive functions: complexity bounds
(Springer Verlag, 1991)
This survey includes principal results on complexity
of inductive inference for recursively enumerable classes of total
recursive functions. Inductive inference is a process to find an
algorithm from sample computations. ...
Comparing various types of limiting synthesis and prediction of functions
(Latvia State University, 1974)