Effectivity problems of algorithmic logic

  • Antoni Kreczmar
Friday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Normal Form Propositional Variable Algorithmic Logic Algorithmic Property Open 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Engeler, Algorithmic properties of structures, Math. Sys. Theory, 1 /1967/, 183–195.CrossRefGoogle Scholar
  2. [2]
    E.Engeler, Remarks on the theory of geometrical constructions, in Syntax and Semantics of Infinitary Languages, Lec. Notes No 72 /1968/.Google Scholar
  3. [3]
    E.Engeler, Algorithmic definability, in the Proceedings of Inter.Symp.Summ.Sch. on Math.Found. of Com.Scien., Warsaw /1972/.Google Scholar
  4. [4]
    C.A. Hoare, An axiomatic basis for computer programming, Com. ACM, 12 /1969/, 576–583.CrossRefGoogle Scholar
  5. [5]
    S.Igarashi, An axiomatic approach to the equivalence problems of algorithms with applications, Rep.Comp.Cent.Univ., Tokyo, 1 /1968/.Google Scholar
  6. [6]
    D.E. Knuth, R.W. Floyd, Notes on avoiding ‘goto’ statements, Inf.Proc.Let. 1 /1971/, 23–31.Google Scholar
  7. [7]
    A. Kreczmar, Degree of recursive unsolvability of algorithmic logic, Bull.Acad.Pol.Sci.Ser.Math., 20 /1972/, 615–618.Google Scholar
  8. [8]
    E.G. Lopez-Escobar, The interpolation theorem for denumerably long formulas, Fund.Math., 57, /1968/, 253–272.Google Scholar
  9. [9]
    D.C. Luckham, D.M. Park, M.S. Paterson, On formalized computer programs, JCSS, 4 /1970/; 220–249Google Scholar
  10. [10]
    S.Mazur, Computable analysis, Diss.Math., No 33 /1963/.Google Scholar
  11. [11]
    M. Mirkowska, On formalized systems of algorithmic logic, Bull.Acad.Pol.Sci.Ser.Math., 19 /1971/, 421–428.Google Scholar
  12. [12]
    M.Mirkowska, Algorithmic logic and its applications, Doct. Diss., Warsaw /1972/, in Polish.Google Scholar
  13. [13]
    H.Rasiowa, R.Sikorski, Mathematics of Metamathematics, Pol.Sc.Publ., Warsaw /1963/.Google Scholar
  14. [14]
    H. Rogers Jr., Theory of recursive functions and effective computability, Mc Graw Hill, New York /1967/.Google Scholar
  15. [15]
    A. Salwicki, Formalized algorithmic languages, Bull.Acad.Pol.Sci.Ser.Math., 18 /1970/, 227–232.Google Scholar
  16. [16]
    A. Salwicki, On the equivalence of FS-expressions and programs, Bull. Acad.Pol. Sci.Ser.Math., 18 /1970/, 275–278.Google Scholar
  17. [17]
    A.Tarski, A decision method for elementary algebra and geometry, Berkeley, /1951/.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Antoni Kreczmar
    • 1
  1. 1.Warsaw UniversityPoland

Personalised recommendations