Advertisement

Acta Informatica

, Volume 25, Issue 4, pp 439–473 | Cite as

Program-substitution and admissibility of rules in algorithmic logic

  • Andrzej Biela
Article

Summary

The purpose of this work is to show a point of view upon the notions of program-substitution and admissibility of rules which are the tools for proving properties of programs of algorithmic logic and the so-called extended algorithmic logic with quantifiers and with non-deterministic programs. We prove that the set of theses of algorithmic logic is closed under each program-substitution. This substitution rule allows us to formulate a problem of algorithmic structural completeness as a question about derivability of all structural, finitary and admissible rules. We prove the incompleteness of algorithmic logic strengthened by the substitution rule and its algorithmically structural completeness.

Keywords

Inductive Hypothesis Generalize Formula Ordinal Number Classical Formula Elementary Formula 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Banachowski, L.: Investigations of properties of programs by means of the extended algorithmic logic I. Annales Societatis Mathematicae Polonae. Ser. IV. Fundamenta Informaticae. Vol. I, No. 1, 1977,93–119.MathSciNetGoogle Scholar
  2. 2.
    Bernert, J., Biela, A.: On two different modal logics denoted by S9. Reports on Math. Logic.13, 3–9 (1981)Google Scholar
  3. 3.
    Biela, A., Dziobiak, W.: On two properties of structurally complete logics. Reports on Math. Logic.16, 51–54 (1982)MathSciNetGoogle Scholar
  4. 4.
    Chlebus, B.: On the decidability of propositional algorithmic logic. Zeitschr. für Math. Logik und Grundlagen der Math.28, 247–261 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Church, A.: Introduction on Mathematical Logic. Princeton 1956.Google Scholar
  6. 6.
    Danko, W.: Algorithmic properties of finitely generated structures. Proceedings, Poznan, August 1980, Lect, Notes in Comput. Sci. Vol. 148. Logic of Programs and Their Applications. Berlin, Heidelberg, New York: Springer 1983Google Scholar
  7. 7.
    Dummet, M.: Elements of Intuitionism, Clarendon Press. Oxford 1977, p. 169.Google Scholar
  8. 8.
    Engeler, E.: Algorithmic properties of structures. Math. Syst. Theory1, 183–195 (1967)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Harel, D., Pratt, V.: Nondeterminism in Logics of Programs, Proc. 9-th Ann. ACM Symp. on Theory of Computing, Boulder, Colorado, May 1977. MIT, Cambridge, MA 1977.Google Scholar
  10. 10.
    Hermes, H.: Introduction to Mathematical Logic. Berlin, Heidelberg, New York: Springer 1973zbMATHGoogle Scholar
  11. 11.
    Hilbert, D., Ackermann, W.: Grundzüge der theoretischen Logik. Berlin, Heidelberg, New York: Springer 1967zbMATHGoogle Scholar
  12. 12.
    Kreczmar, A.: Effectivity problems of algorithmic logic. Annales Societatis Math. Polon. Ser. IV, Fundam. Inf.1, 19–32 (1977)MathSciNetGoogle Scholar
  13. 13.
    Kreczmar, A.: The set of all tautologies of algorithmic logic is hyperarithmetical. Bull. Acad. Polon. Sci., Ser. Math.21, 781–783 (1971)MathSciNetGoogle Scholar
  14. 14.
    Kröger, F.: LAR: A Logic of Algorithmic Reasoning. Acta Inf.8, 243–266 (1977)zbMATHGoogle Scholar
  15. 15.
    Minc, G.: Proizvodost dopustimych pravił. Issliedovanija po konstruktiwnoj matiematikie i matiematiczeskoj logikie, vol. 5, pp. 85–89. Leningrad: Nauka AN CCCP Matiematiczeskij Institut im. V.A. Steklova. Leningradskoje otdielienie. (1972)Google Scholar
  16. 16.
    Mirkowska, G.: Algorithmic logic and its applications in the theory of programs I. Annales Societatis Math. Polon. Ser. IV, Fundam. Inf.1, 1–17 (1977)MathSciNetGoogle Scholar
  17. 17.
    Mirkowska, G.: Algorithmic logic and its applications in the theory of programs II. Annales Societatis Math. Polon. Ser. IV. Fundam. Inf.1, 147–165 (1977)MathSciNetGoogle Scholar
  18. 18.
    Mirkowska, G.: Algorithmic logic with nondeterministic programs. Annales Societatis Math. Polon. Ser. IV. Fundam. Inf.3, 45–64 (1980)MathSciNetGoogle Scholar
  19. 19.
    Mirkowska, G.: Model existence theorem in algorithmic logic with non-deterministic programs. Annales Societatis Math. Polon, Ser. IV. Fundam. Inf.3, 157–170 (1980)MathSciNetGoogle Scholar
  20. 20.
    Mirkowska, G.: On formalized systems of algorithmic logic. Bull. Acad. Polon. Sci. Ser. Math.19, 421–428 (1971)zbMATHMathSciNetGoogle Scholar
  21. 21.
    Perkowska, E.: On algorithmic m-valued logics, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astr. Phys.20, 717–719(1972)zbMATHMathSciNetGoogle Scholar
  22. 22.
    Petermann, U.: On Algorithmic Logic with partial operations. Proceedings, Poznań, August 1980, Lect. Notes Comput. Sci. Vol. 148. Logic of Programs and Their Applications, pp. 213–223. Berlin, Heidelberg, New York: Springer 1983Google Scholar
  23. 23.
    Pogorzelski, W.A.: Structural completeness of the propositional calculus, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astr. Phys.19, 349–351 (1971)zbMATHMathSciNetGoogle Scholar
  24. 24.
    Pogorzelski, W.A., Prucnal, T.: Structural completeness of the first order predicate calculus. Zeitschr. für Math. Logik und Grundlagen der Math.21, 315–320 (1975)zbMATHMathSciNetGoogle Scholar
  25. 25.
    Porte, J.: Antitheses in systems of relevant implication. J. Symb. Logic,48, 97–99 (1983)CrossRefMathSciNetGoogle Scholar
  26. 26.
    Pratt, V.: Semantical Considerations on Floyd-Hoare Logic, in: Proceedings 17-th Ann. IEEE Symp. on FCS, pp. 109–121, October 1976Google Scholar
  27. 27.
    Prucnal, T.: Structural completeness of Lewis’s system S 5, Bulletin de 1’ Acad. Polon. des Sci. Ser. Sci. Math. Astr. Phys.29, 101–103 (1972)MathSciNetGoogle Scholar
  28. 28.
    Radziszewski, S.: Programmability andP = NP conjecture, Proc. FCT’ 77, Cont. Lect. Notes Comput. Sci. Vol. 56. Berlin, Heidelberg: Springer 1977Google Scholar
  29. 29.
    Rasiowa, H.: On logical structure of programs, Bull. Polon. Acad. Sci. Ser. Math. Astr. Phys.20, 319–324(1972)zbMATHMathSciNetGoogle Scholar
  30. 30.
    Rasiowa, H.: Ω+-valued algorithmic logic as a tool to investigate procedures. Proc. MFCS ’74. Lect. Notes Comput. Sci. Vol. 28. Berlin, Heidelberg: Springer 1974Google Scholar
  31. 31.
    Salwicki, A.: Axioms of Algorithmic Logic univocally determine Semantics of programs. Proc. MFCS ’80. Lect. Notes Comput. Sci. Vol. 88, pp. 352–361. Heidelberg, Berlin, New York: Springer 1980Google Scholar
  32. 32.
    Salwicki, A.: Formalized algorithmic languages, Bull. Acad. Pol. Sci. Ser. Sci. Math. Astr. Phys.18, 227–232 (1970)zbMATHMathSciNetGoogle Scholar
  33. 33.
    Segerberg, K.: A Completeness Theorem in Modal Logic of Programs, abstract, Notices of the American Mathematical Society, Oct. 1977.Google Scholar
  34. 34.
    Thiele, H. : Wissenschaftstheoretische Untersuchungen in algorithmischen Sprachen, VEB Deutscher Verlag der Wissenschaften Berlin 1966Google Scholar
  35. 35.
    Tsitkin, A.I.: On structurally complete superintuitionistic logics. Dokl. Akad. Nauk CCCP.241, 40–43 (1978)MathSciNetGoogle Scholar
  36. 36.
    Wojtylak, P.: On structural completeness of many valued logic’s. Studia Logica3, 2–8(1974)Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Andrzej Biela
    • 1
  1. 1.Department of MathematicsUniversity of SilesiaKatowicePoland

Personalised recommendations