Publication details
Verlag: Springer
Ort: Berlin
Jahr: 2018
Pages: 45-50
Reihe: Outstanding Contributions to Logic
ISBN (Hardback): 9783319962733
Volle Referenz:
, "Putnam's theorem on the complexity of models", in: Hilary Putnam on logic and mathematics, Berlin, Springer, 2018
Putnam's theorem on the complexity of models
pp. 45-50
in: Geoffrey Hellman, Roy T. Cook (eds), Hilary Putnam on logic and mathematics, Berlin, Springer, 2018Abstrakt
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
Verlag: Springer
Ort: Berlin
Jahr: 2018
Pages: 45-50
Reihe: Outstanding Contributions to Logic
ISBN (Hardback): 9783319962733
Volle Referenz:
, "Putnam's theorem on the complexity of models", in: Hilary Putnam on logic and mathematics, Berlin, Springer, 2018