Repository | Series | Book | Chapter
Putnam's theorem on the complexity of models
pp. 45-50
Abstract
A streamlined proof of a theorem of Putnam's: any satisfiable schema of predicate calculus has a model in which the predicates are interpreted as Boolean combinations of recursively enumerable relations. Related open problems are canvassed.
Publication details
Published in:
Hellman Geoffrey, Cook Roy T. (2018) Hilary Putnam on logic and mathematics. Dordrecht, Springer.
Pages: 45-50
DOI: 10.1007/978-3-319-96274-0_4
Full citation:
Goldfarb Warren (2018) „Putnam's theorem on the complexity of models“, In: G. Hellman & R. T. Cook (eds.), Hilary Putnam on logic and mathematics, Dordrecht, Springer, 45–50.