Trees and finite satisfiability: proof of a conjecture of Burgess.
Boolos, George
Notre Dame J. Formal Logic, Tome 25 (1984) no. 1, p. 193-197 / Harvested from Project Euclid
Publié le : 1984-07-14
Classification:  03B10,  03C13
@article{1093870624,
     author = {Boolos, George},
     title = {Trees and finite satisfiability: proof of a conjecture of Burgess.},
     journal = {Notre Dame J. Formal Logic},
     volume = {25},
     number = {1},
     year = {1984},
     pages = { 193-197},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1093870624}
}
Boolos, George. Trees and finite satisfiability: proof of a conjecture of Burgess.. Notre Dame J. Formal Logic, Tome 25 (1984) no. 1, pp.  193-197. http://gdmltest.u-ga.fr/item/1093870624/