Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)
Correctness of inconsistent theories with notions of feasibility
KeywordsSpecial Rule Inductive Supposition Main Formula Logical Axiom Argument Place
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.
Unable to display preview. Download preview PDF.
- H. Poincare, The foundations of science, Science Press, 1913.Google Scholar
- P. Bernays, On Platonism in Mathematics, Philosophy of mathematics, Prentice-Hall, New Jersey, 1964, pp.274–288.Google Scholar
- D. van Dantzig, Is 101010 a finite number?, Dialectica, v. 9, 3/4 (35/36), 1955, pp. 273–277.Google Scholar
- A.S. Yessenin-Volpin, Analysis of potencial feasibility (in Russian), in: Logicheskie issledovanija, Moscow, 1959, pp. 218–262.Google Scholar
- A.S. Yessenin-Volpin, About infinity, finiteness and finitization, in: Constructive mathematics, Lect. Notes in Math. 873, Springer, 1981, pp. 274–313.Google Scholar
- R. Parikh, Existence and feasibility in arithmetic, Lourn. of Symbolic Logic, v. 36, 3, 1971, pp. 494–508.Google Scholar
- V.P. Orevkov, Upper bounds for lengthening of proofs after cut-elimination, in: Theory complexity of computations (in Russian), ser. Notes of scientific seminars of Leningrad dept. of Math. Inst. of Acad. sci., v. 137, Leningrad, 1984, pp. 87–98.Google Scholar
- S.C. Kleene, Introduction to metamathematics, Van Nostrand C, N.Y., Toronto, 1952.Google Scholar
- A.N. Kolmogoroff, A.G. Dragalin, Introduction to Mathematical Logic (in Russian), Moscow Univ. Press, Moscow, 1982.Google Scholar
© Springer-Verlag Berlin Heidelberg 1985