Admissibility of fixed-point induction in first-order logic of typed theories

  • Shigeru Igarashi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5)


Inference Rule Truth Function Induction Rule Elimination Rule Weak Continuity 
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.

Unable to display preview. Download preview PDF.


  1. [1]
    Gentzen, G., Untersuchungen über das logische Schließen, Mathemtische Zeitschrift, 39 (1934–5).Google Scholar
  2. [2]
    Igarashi, S., An axiomatic approach to the equivalence problems of algorithms with applications, Reports of Computer Centre, University of Tokyo, 1, No. 1 (1968).Google Scholar
  3. [3]
    Igarashi, S., Semantic of Algol-like statements, Symposium on Semantics of Algorithmic Languages, Engeler, E. (ed.), Lecture Notes in Mathematics, 188, Springer-Verlag (1971).Google Scholar
  4. [4]
    McCarthy, J., On adding quantifiers to LCF, private communication, Stanford (1972).Google Scholar
  5. [5]
    McCarthy, J., & Painter, J., Correctness of a compiler for arithmetic expressions, Proceedings of a Symposium in Applied Mathematics, 19, Schwartz, J.T. (ed.), American Mathematical Society, (1967).Google Scholar
  6. [6]
    Milner, R., Implementation and applications of Scott's logic for computable functions, Proceedings of a Conference on Proving Assertions about Programs, New Mexico State University, SIGPLAN Notices 7 (1972).Google Scholar
  7. [7]
    Milner, R., Private Communication, Stanford (1972).Google Scholar
  8. [8]
    Milner, R. and Weyhrauch, R., Proving compiler correctness in a mechanized logic, Machine Intelligence 7, Michie, D. (ed.) Edinburgh University Press (1972, to appear).Google Scholar
  9. [9]
    Park, D., Fixpoint induction and proofs of program properties, Machine Intelligence 5, Meltzer, B. and Michie, D. (eds.), Edinburgh University Press (1970).Google Scholar
  10. [10]
    Scott, D., Private Communication, Oxford (1969).Google Scholar
  11. [11]
    Shoenfield, J.R., Mathematical Logic, Addison-Wesley Publ. Co. (1967).Google Scholar
  12. [12]
    Wang, H., Logic of many-sorted theories, Journal of Symbolic Logic, 17, No. 2 (1952).Google Scholar
  13. [13]
    Weyhrauch, R. and Milner, R., Program semantics and correctness in a mechanized logic, Proceedings of USA-Japan Computer Conference, Tokyo, (1972, to appear).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Shigeru Igarashi
    • 1
  1. 1.Kyoto UniversityJapan

Personalised recommendations