Abstract
This chapter present a method to prove that a proposition is not provable in a theory: the construction of a model. It gives proofs of the soundness and completeness theorems. Finally, it discusses other applications of the notion of model in algebra and in computer science.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dowek, G. (2011). Models. In: Proofs and Algorithms. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-121-9_2
Download citation
DOI: https://doi.org/10.1007/978-0-85729-121-9_2
Publisher Name: Springer, London
Print ISBN: 978-0-85729-120-2
Online ISBN: 978-0-85729-121-9
eBook Packages: Computer ScienceComputer Science (R0)