{"id":"https://openalex.org/W2039142144","doi":"https://doi.org/10.1305/ndjfl/1093870624","title":"Trees and finite satisfiability: proof of a conjecture of Burgess.","display_name":"Trees and finite satisfiability: proof of a conjecture of Burgess.","publication_year":1984,"publication_date":"1984-07-01","ids":{"openalex":"https://openalex.org/W2039142144","doi":"https://doi.org/10.1305/ndjfl/1093870624","mag":"2039142144"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093870624","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093870624","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-25/issue-3/Trees-and-finite-satisfiability--proof-of-a-conjecture-of/10.1305/ndjfl/1093870624.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-25/issue-3/Trees-and-finite-satisfiability--proof-of-a-conjecture-of/10.1305/ndjfl/1093870624.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008053802","display_name":"George Boolos","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"George Boolos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008053802"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5276,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.6240435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"25","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9811000227928162,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9686999917030334,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6893086433410645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5729691982269287},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.48729121685028076},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4288441240787506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42725855112075806},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3446028232574463},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.041009724140167236}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6893086433410645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5729691982269287},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.48729121685028076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4288441240787506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42725855112075806},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3446028232574463},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.041009724140167236},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093870624","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093870624","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-25/issue-3/Trees-and-finite-satisfiability--proof-of-a-conjecture-of/10.1305/ndjfl/1093870624.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093870624","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093870624","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1093870624","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093870624","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-25/issue-3/Trees-and-finite-satisfiability--proof-of-a-conjecture-of/10.1305/ndjfl/1093870624.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2039142144.pdf","grobid_xml":"https://content.openalex.org/works/W2039142144.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W1529615003","https://openalex.org/W4403868128"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W3037419933","https://openalex.org/W44982509","https://openalex.org/W2952234674","https://openalex.org/W1543051890","https://openalex.org/W4299809933"],"abstract_inverted_index":{"The":[0],"method":[1,34,60,99,135],"of":[2,72,80,107],"trees,":[3],"expounded":[4],"in":[5,45,87,117,121],"such":[6],"books":[7],"as":[8,28,126],"Jeffrey's":[9],"[2]":[10],"and":[11,17,92],"Smullyan's":[12],"[3],":[13],"provides":[14],"a":[15,49,81,84,108],"sound":[16],"complete":[18],"positive":[19],"algorithmic":[20],"test":[21],"for":[22,26,57,113],"unsatisfiability":[23],"(and":[24],"hence,":[25],"validity":[27],"well).":[29],"1":[30],"On":[31],"occasion,":[32],"the":[33,54,59,62,70,73,78,89,98,104,127,134,137],"can":[35],"also":[36],"be":[37],"used":[38],"to":[39,53,131],"demonstrate":[40,103],"finite":[41,50,105],"satisfiability,":[42],"i.e.,":[43],"truth":[44],"some":[46],"model":[47,82,120],"with":[48,83],"domain.":[51],"Applied":[52,130],"sentence":[55],"3xFx,":[56],"example,":[58,114],"yields":[61],"one-branch":[63,139],"tree:":[64,140],"ixFx":[65],"Fa":[66,93],",":[67],"from":[68],"which":[69,88,122],"argument":[71],"usual":[74],"completeness":[75],"proof":[76],"proves":[77],"existence":[79],"one-element":[85,119],"domain":[86],"sentences":[90],"3xFx":[91],"are":[94],"both":[95],"true.":[96],"But":[97],"does":[100],"not":[101],"invariably":[102],"satisfiability":[106],"finitely":[109],"satisfiable":[110],"sentence.":[111],"VxlyRxy,":[112],"is":[115,124],"true":[116],"every":[118],"R":[123],"interpreted":[125],"identity":[128],"relation.":[129],"this":[132],"sentence,":[133],"produces":[136],"infinite":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}