Translator Disclaimer
July 1984 Trees and finite satisfiability: proof of a conjecture of Burgess.
George Boolos
Notre Dame J. Formal Logic 25(3): 193-197 (July 1984). DOI: 10.1305/ndjfl/1093870624
First Page PDF

Sorry, your browser doesn't support embedded PDFs, Download First Page

JOURNAL ARTICLE
5 PAGES


SHARE
Vol.25 • No. 3 • July 1984
Back to Top