Skip to main content
SpringerLink
Log in

Decidability results on a query language for data bases with incomplete information

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1980 (MFCS 1980)

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

  • 126 Accesses

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. A. Church, Introduction to mathematical logic I, Princeton Univ. Press, Princeton, New Jersey, 1956.

    Google Scholar 

  2. S.A. Kripke, The undecidability of monadic modal quantification theory, Zeitschr. f. math. Logik, 8 (1962) 113–116.

    Google Scholar 

  3. W. Lipski, Jr, On the logic of incomplete information, Proc. 6th International Symposium on Mathematical Foundations of Computer Science, Tatranska Lomnica, 1977, Lecture Note in Computer Science 55, Springer-Verlag, Berlin, (1977) 374–381.

    Google Scholar 

  4. W. Lipski, Jr, On semantic issues connected with incomplete information data bases, to appear in ACM Transactions on Database Systems.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Integrated Arts and Sciences, Hiroshima University, Hiroshima

    Hiroakira Ono

  2. Department of Applied Mathematics, Hiroshima University, Hiroshima

    Akira Nakamura

Authors
  1. Hiroakira Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akira Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ono, H., Nakamura, A. (1980). Decidability results on a query language for data bases with incomplete information. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022524

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation