Applied algorithmic logic

  • Andrzej Salwicki
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


This is a survey of the last year's work of the group of algorithmic logic. Our studies have concetrated on two (not disjoint) tasks:
  • design of programming language LOGLAN 77.

  • studies of computational complexity.

The questions of data structures implementation and of non-sequential computing processes were the main aims of our research. The work devoted to LOGLAN language has paid back handsomely in discovering possibilities of algorithmic approach to the foundations of set theory. The survey ends with a short presentation of an early stage of research connected with P=NP problem.


Turing Machine None None Priority Queue Algorithmic Logic Common Prefix 
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.
    Aho, A.V.,Hopcroft, J.E.,Ullman, J.D., The design and analysis of computer algorithms, Addison Wesley, Reading,Mass.,1968Google Scholar
  2. 2.
    Birtwistle, G.M.,Dahl, O-J.,Mayhrhaug, B.,Nygaard, K., SIMULA begin. Studentliteratur, Lund,1973Google Scholar
  3. 3.
    Banachowski, L., An axiomatic approach to the theory of data structures, Bull.Acad.Pol.Sci.Ser.Math.Astr.Phys., 23 (1975) 315–323Google Scholar
  4. 4.
    Brinch Hansen, P., Concurrent Pascal, Information Science TR 10 Caltech, Pasadena,1976Google Scholar
  5. 5.
    Heyting, A., Intuitionism,North Holland, Amsterdam, 1956Google Scholar
  6. 6.
    Hoare, C.A.R.,Monitors: an operating system structuring concept Com.ACM, 17 (1974),549–557CrossRefGoogle Scholar
  7. 7.
    Knuth, D.E.,The art of computer programming, I,III, Addison-Wesley, Reading,Mass., 1968Google Scholar
  8. 8.
    LOGLAN 77, internal report University of Warsaw, 1977Google Scholar
  9. 9.
    Mirkowska, G.,Algorithmic logic..., to appear in Fundamenta Informaticae, see also On formalized systems of algorithmic logic, Bull.Acad.Pol.Sci.Ser.Math.Astr.Phys., 19(1971),421–428Google Scholar
  10. 10.
    Mirkowska, G.,Salwicki, A., A complete axiomatic characterization of algorithmic properties... in Proc.MFCS-76 Gdańsk, Lecture Notes in Computer Science, Springer Verlag, Berlin, 1976,602–608Google Scholar
  11. 11.
    Müldner,T.,Implementation and properties of certain notions of quasi-parallel and parallel computations, to appear in Fundamenta InformaticaeGoogle Scholar
  12. 12.
    Müldner, T., On properties of certain synchronising tool for parallel computations, Proc.FCT'77 Poznań, Lecture Notes in Computer Science, Springer Verlag, Berlin, 1977Google Scholar
  13. 13.
    Radziszowski,S., Programmability and P=NP conjecture, ibidemGoogle Scholar
  14. 14.
    Salwicki, A., Procedures, formal computations and models. Proc.MFCS 74 Jadwisin, Lecture Notes in Computer Science 28 Springer Verlag, Berlin 1974, 464–484Google Scholar
  15. 15.
    Salwicki, A.,An algorithmic approach to set theory, Proc FCT'77 Poznań, Lecture Notes in Compuer Science, Springer Vlg, Berlin 1977Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Andrzej Salwicki
    • 1
  1. 1.Department of MathematicsUniversity of WarsawWarszawaPoland

Personalised recommendations