Skip to main content
SpringerLink
Log in

Many-valued algorithmic logic

  • Conference paper
  • First Online:
⊨ISILC Logic Conference

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 499))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banachowski, L. Modular approach to the logical theory of programs, Proc. Intern. Symp. Math. Found. Comp. Sci., Warsaw-Jadwisin, 1974, Springer.

    Google Scholar 

  2. Banachowski, L. An axiomatic approach to the theory of data structures, Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys. to appear.

    Google Scholar 

  3. Banachowski, L. Extended algorithmic logic and properties of programs, ibid. Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys. to appear.

    Google Scholar 

  4. Banachowski, L. Modular properties of programs, ibid. Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys. to appear.

    Google Scholar 

  5. Banachowski, L. Investigations of properties of programs by means of the extended algorithmic logic, Ph. D. Thesis, Faculty of Mathematics and Mechanics, University of Warsaw, 1975.

    Google Scholar 

  6. Blikle, A.; Mazurkiewicz, A. An algebraic approach to the theory of programs, algorithms, languages and recursiveness, Proc. Intern. Symp. and Summer School Math. Found. Comp. Sci., Warsaw-Jabłonna, 1972, CCPAS Reports, 1972.

    Google Scholar 

  7. Epstein, G. The lattice theory of Post algebras, Trans. Amer. Math. Soc., 95 (1960), 300–317.

    Article  MATH  MathSciNet  Google Scholar 

  8. Kreczmar, A. The set of all tautologies of algorithmic logic is hyperarithmetical, Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys., 21 (1971), 781–783.

    MathSciNet  Google Scholar 

  9. Kreczmar, A. Degree of recursive unsolvability of algorithmic logic, ibid., 20 (1972), 615–617.

    MATH  MathSciNet  Google Scholar 

  10. Kreczmar, A. Effectivity problems of algorithmic logic, Automata, Languages and Programming, Lec. Not. Comp. Sci., 14, Springer, 1974, 584–600.

    MATH  MathSciNet  Google Scholar 

  11. Kreczmar, A. Effectivity problems of algorithmic logic (in Polish), Ph. D. Thesis, Faculty of Mathematics and Mechanics, University of Warsaw, 1973.

    Google Scholar 

  12. Maksimowa, L., Vakarelov, D. Representation theorems for generalized Post algebras of order ω+, Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys., 22 (1974), 757–764.

    Google Scholar 

  13. Maksimowa, L.; Vakarelov, D. Semantics for ω+-valued predicate calculi, ibid., 765–771.

    Google Scholar 

  14. Mirkowska, G. On formalized systems of algorithmic logic, ibid., 18 (1971), 421–428.

    MathSciNet  Google Scholar 

  15. Mirkowska, G. Herbrand theorem in algorithmic logic, ibid., 22 (1974), 539–543.

    MATH  MathSciNet  Google Scholar 

  16. Mirkowska, G. Algorithmic logic and its applications in program theory (in Polish), Ph. D. Thesis, Faculty of Mathematics and Mechanics, University of Warsaw, 1972.

    Google Scholar 

  17. Rasiowa, H. On generalized Post algebras of order ω+ and ω+-valued predicate calculi, Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys., 21 (1973), 209–219.

    MATH  MathSciNet  Google Scholar 

  18. Rasiowa, H. On logical structures of mixed-valued programs and ω+-valued algorithmic logic, ibid., 451–458.

    MATH  MathSciNet  Google Scholar 

  19. Rasiowa, H. Formalized ω+-valued algorithmic systems, ibid., 559–565.

    MATH  MathSciNet  Google Scholar 

  20. Rasiowa, H. A simplified formalization of ω+-valued algorithmic logic, ibid., 22 (1974), 595–603.

    MATH  MathSciNet  Google Scholar 

  21. Rasiowa, H. Extended ω+-valued algorithmic logic, ibid.. 605–610.

    Google Scholar 

  22. Rasiowa, H. ω +-valued algorithmic logic as a tool to investigate procedures, Proc. Intern. Symp. Math. Found. Comp. Sci., Warsaw-Jadwisin, 1974, Springer.

    Google Scholar 

  23. Rasiowa, H. Mixed-valued predicate calculi, Studia Logica, to appear.

    Google Scholar 

  24. Rasiowa, H. Post algebras as a semantic foundation of many-valued logic, MAA Studies in Mathematics, 1975.

    Google Scholar 

  25. Saloni, Z. A topological representation of generalized Post algebras of order ω+, Bull. Acad. Pol. Sci., Ser. Math. Astron. Phys., to appear.

    Google Scholar 

  26. Salwicki, A. Formalized algorithmic languages, ibid., 18 (1970), 227–232.

    MATH  MathSciNet  Google Scholar 

  27. Salwicki, A. On the equivalence of FS-expressions and programs, ibid., 275–278.

    MATH  MathSciNet  Google Scholar 

  28. Salwicki, A. On the predicate calculi with the iteration quantifiers, ibid., 279–285.

    MATH  MathSciNet  Google Scholar 

  29. Salwicki, A. Programability and recursiveness (an application of algorithmic logic to procedures), Dissertationes Mathematicae, to appear.

    Google Scholar 

  30. Scott, D. outline of a mathematical theory of computation, Oxford mon. PRG-2, Oxford University, 1970.

    Google Scholar 

  31. Speed, T. P. A note on Post algebras, Coll. Math., 24 (1971), 37–44.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, Pkin, 00-901, Warsaw, Poland

    H. Rasiowa

Authors
  1. H. Rasiowa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gert H. Müller Arnold Oberschelp Klaus Potthoff

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Rasiowa, H. (1975). Many-valued algorithmic logic. In: Müller, G.H., Oberschelp, A., Potthoff, K. (eds) ⊨ISILC Logic Conference. Lecture Notes in Mathematics, vol 499. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0079430

Download citation

  • DOI: https://doi.org/10.1007/BFb0079430

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07534-9

  • Online ISBN: 978-3-540-38022-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation