Collections | Livre | Chapitre
Putnam's theorem on the complexity of models
pp. 45-50
Résumé
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.
Détails de la publication
Publié dans:
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
Citation complète:
Goldfarb Warren, 2018, Putnam's theorem on the complexity of models. In G. Hellman & R. T. Cook (eds.) Hilary Putnam on logic and mathematics (45-50). Dordrecht, Springer.