Skip to main content
SpringerLink
Log in

Boolean valued models and incomplete specifications

  • Submitted Papers
  • Conference paper
  • First Online:
Book cover Algebraic and Logic Programming (ALP 1988)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Chang, Ch.-L., Lee, R. Ch.-T.: Symbolic Logic and Mechanical Theorem Proving. New York 1973.

    Google Scholar 

  2. Dahn, B. I.: An analog of the least Herbrand model for non-Horn Theories, in: B. Dahn, H. Wolter (eds.), Proc. 6th Easter Conference on Model Theory, Berlin 1988, 33–52.

    Google Scholar 

  3. Green, C.: Theorem proving by resolution as a basis for question-answering systems, in: Meltzer, B., Michie, D. (eds.), Machine Intelligence, Edinburgh 1969, 183–205

    Google Scholar 

  4. Jech, T. J.: Lectures in Set Theory with Particular Emphasis on the Method of Forcing, Springer Lecture Notes in Mathematics, vol. 217, 1971

    Google Scholar 

  5. Makowsky, J. A.: Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples. J. Comp. and System Science, vol. 34 (1987), 266–292

    Article  MathSciNet  MATH  Google Scholar 

  6. Rosser, J. B.: Simplified Independence Proofs, Boolean Valued Models of Set Theory, New York 1969

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Humboldt-Universität, PSF 1297, DDR-1086, Berlin

    Bernd I. Dahn

Authors
  1. Bernd I. Dahn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Grabowski P. Lescanne W. Wechler

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Akademie-Verlag Berlin

About this paper

Cite this paper

Dahn, B.I. (1988). Boolean valued models and incomplete specifications. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-50667-5_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50667-6

  • Online ISBN: 978-3-540-46063-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation