Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature
Chang, Ch.-L., Lee, R. Ch.-T.: Symbolic Logic and Mechanical Theorem Proving. New York 1973.
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.
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
Jech, T. J.: Lectures in Set Theory with Particular Emphasis on the Method of Forcing, Springer Lecture Notes in Mathematics, vol. 217, 1971
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
Rosser, J. B.: Simplified Independence Proofs, Boolean Valued Models of Set Theory, New York 1969
Author information
Authors and Affiliations
Editor information
Rights 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