On the propositional algorithmic theory of arithmetic

  • Grazyna Mirkowska
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 148)


Recursive Function Propositional Variable Semantic Structure Program Scheme Consequence Operation 
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]
    Chlebus B., On decidability of propositional algorithmic logic Inst.of Informatics Reports. University of Warsaw, 1979Google Scholar
  2. [2]
    Malcev A.I., Algorithms and recursive functions, Moscow 1965.Google Scholar
  3. [3]
    Mirkowska G., On the propositional algorithmic logic, Proc. of MFCS'79. Olomouc, Lecture Notes on Computer Science, Springer Verlag 74.Google Scholar
  4. [4]
    Mirkowska G., Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations Proc. 12 th Ann. ACM Symp. on theory of Computing, Los Angeles 1980.Google Scholar
  5. [5]
    Pratt V.,Salwicki A., personal communicationGoogle Scholar
  6. [6]
    Rogers H., The theory of recursive functions and effective compitability, Mc.Graw-Hill, New York 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Grazyna Mirkowska
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarsawPoland

Personalised recommendations