Repository | Book | Chapter

COPR BookmarkLink
202213

(2018) Hilary Putnam on logic and mathematics, Dordrecht, Springer.

Putnam's theorem on the complexity of models

Warren Goldfarb

pp. 45-50

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

DOI: 10.1007/978-3-319-96274-0_4

Full citation:

Goldfarb, W. (2018)., Putnam's theorem on the complexity of models, in G. Hellman & R. T. Cook (eds.), Hilary Putnam on logic and mathematics, Dordrecht, Springer, pp. 45-50.

This document is unfortunately not available for download at the moment.