Abstract
As we have seen, after a number of steps t * not exceeding the number of variables in S 0, DPP terminates producing as output a set S t* of clauses without variables. S t* can have only one of two possible forms: S t* = □ or S t* = ø
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Italia
About this chapter
Cite this chapter
Mundici, D. (2012). Robinson’s Completeness Theorem. In: Logic: A Brief Course. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-2361-1_4
Download citation
DOI: https://doi.org/10.1007/978-88-470-2361-1_4
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-2360-4
Online ISBN: 978-88-470-2361-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)