On predicate letter formulas which have no substitution instances provable in a first order language.
Weston, Kenneth
Notre Dame J. Formal Logic, Tome 6 (1965) no. 1, p. 296-300 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1965-05-14
Classification:  02.70 
@article{1093958337,
     author = {Weston, Kenneth},
     title = {On predicate letter formulas which have no substitution instances provable in a first order language.},
     journal = {Notre Dame J. Formal Logic},
     volume = {6},
     number = {1},
     year = {1965},
     pages = { 296-300},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1093958337}
}

Weston, Kenneth. On predicate letter formulas which have no substitution instances provable in a first order language.. Notre Dame J. Formal Logic, Tome 6 (1965) no. 1, pp.  296-300. http://gdmltest.u-ga.fr/item/1093958337/