Skip to main content

Correctness of inconsistent theories with notions of feasibility

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 208))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. H. Poincare, The foundations of science, Science Press, 1913.

    Google Scholar 

  2. P. Bernays, On Platonism in Mathematics, Philosophy of mathematics, Prentice-Hall, New Jersey, 1964, pp.274–288.

    Google Scholar 

  3. D. van Dantzig, Is 101010 a finite number?, Dialectica, v. 9, 3/4 (35/36), 1955, pp. 273–277.

    Google Scholar 

  4. A.S. Yessenin-Volpin, Analysis of potencial feasibility (in Russian), in: Logicheskie issledovanija, Moscow, 1959, pp. 218–262.

    Google Scholar 

  5. A.S. Yessenin-Volpin, About infinity, finiteness and finitization, in: Constructive mathematics, Lect. Notes in Math. 873, Springer, 1981, pp. 274–313.

    Google Scholar 

  6. R. Parikh, Existence and feasibility in arithmetic, Lourn. of Symbolic Logic, v. 36, 3, 1971, pp. 494–508.

    Google Scholar 

  7. 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 

  8. S.C. Kleene, Introduction to metamathematics, Van Nostrand C, N.Y., Toronto, 1952.

    Google Scholar 

  9. A.N. Kolmogoroff, A.G. Dragalin, Introduction to Mathematical Logic (in Russian), Moscow Univ. Press, Moscow, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dragalin, A.G. (1985). Correctness of inconsistent theories with notions of feasibility. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-16066-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16066-3

  • Online ISBN: 978-3-540-39748-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics