Skip to main content
SpringerLink
Log in
Book cover

Workshop on Logic of Programs

Logic of Programs 1980: Logics of Programs and Their Applications pp 118–131Cite as

Algorithmic properties of finitely generated structures

  • Conference paper
  • First Online:

  • 107 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 148))

Abstract

We consider abstract structures and relations definable in those structures by formulas of Algorithmic Logic [1,3,14]. We notice that in the case where a structure is finitely generated every relation defined by an algorithmic formula can be defined by an algorithmic formula without classical quantifiers. Using the above fact we prove analogons of Łoś-Tarski Theorem for Algorithmic Logic and for Lω1ω.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.Banachowski, Investigations of properties of programs by means of the extended algorithmic logic, Fundamenta Informaticae I, 1977

    Google Scholar 

  2. W.Dańko, Programs with tables and procedures on the ground of algorithmic logic, doctoral dissertation, University of Warsaw, 1976

    Google Scholar 

  3. W.Dańko, Algorithmic logic with tables and classical quantifiers Zeszyty naukowe Filii UW w Białymstoku, (in print)

    Google Scholar 

  4. E.Engeler, Algorithmic properties of structures, Math. Sys. Theory I, 1967

    Google Scholar 

  5. M.Grabowski, The set of all tautologies of the zero order algorithmic logic is decidable, Bull.Acad.Polon.Sci. Sèr.Math.Astr.Phys., 20, 1972

    Google Scholar 

  6. H. Friedman, Algorithmic procedures, generalized Turing algorithms and elementary recursion theory, Logic Colloquium '69 North-Holland Publ. Co., Amsterdam 1971

    Google Scholar 

  7. D.Harel, A.Meyer, V.Pratt, Computability and completeness in logic of programs, MIT Cambridge Mess. May 1977

    Google Scholar 

  8. C.Hoare, An axiomatic basis of computer programming, Com. ACM 12, 1969

    Google Scholar 

  9. A.Kreczmar, Programmability in fields, Fundamenta Informaticae I 1977

    Google Scholar 

  10. D.Luckham, D.Park, M.Paterson, On formalized computer programs, ICSS 4, 1970

    Google Scholar 

  11. E.G.Lopez-Escobar, The interpolation theorem for denumerable long formulas, Fund.Math. 57, 1968

    Google Scholar 

  12. H.J. Keisler, Model theory for infinitary logic, North-Holland Publ. Co., Amsterdam 1972

    Google Scholar 

  13. G. Mirkowska, Algorithmic logic and its applications in program theory, Fund. Inf. I, 1977

    Google Scholar 

  14. G.Mirkowska, On formalized system of algorithmic logic, Bull. Acad.Polon.Sci.Sèr.Math.Astr.Phys. 19, 1971

    Google Scholar 

  15. H. Rasiowa, R. Sikorski, Mathematics of metamathematics, PWN, Warszawa, 1963

    Google Scholar 

  16. H.Rasiowa, On logical structure of programs, Bull.Acad.Polon.Sci.Sèr.Math.Astr.Phys. 20, 1972

    Google Scholar 

  17. A.Salwicki, On algorithmic theory of dictionaries, Fund. Inf. (in print)

    Google Scholar 

  18. A.Salwicki, Programmability and recursiveness, Dissertationes Mathematicae, (in print)

    Google Scholar 

  19. A.Salwicki, Formalized algorithmic languages, Bull.Acad.Polon. Sci.Sèr. Math.Astr.Phys. 18, 1970

    Google Scholar 

  20. J.C. Shepherdson, Computation over abstract structures, Logic Colloquium '73, North-Holland, Amsterdam 1973

    Google Scholar 

  21. J.Shoenfield, Mathematical logic, Addison-Wesley Publ. Co., 1967

    Google Scholar 

  22. J.Tiuryn, Logic of effective definitions, Fundamenta Informatice, (to appear) and R.W.T.H. Aachen Report 55, 1979

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, Białystok Division, Akademicka 2, 15-267, Białystok, Poland

    Wiktor Dańko

Authors
  1. Wiktor Dańko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Salwicki

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dańko, W. (1983). Algorithmic properties of finitely generated structures. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-11981-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11981-4

  • Online ISBN: 978-3-540-39445-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation