{"id":"https://openalex.org/W2044893645","doi":"https://doi.org/10.1305/ndjfl/1093888117","title":"Modal tree constructions.","display_name":"Modal tree constructions.","publication_year":1977,"publication_date":"1977-10-01","ids":{"openalex":"https://openalex.org/W2044893645","doi":"https://doi.org/10.1305/ndjfl/1093888117","mag":"2044893645"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093888117","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888117","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-4/Modal-tree-constructions/10.1305/ndjfl/1093888117.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-18/issue-4/Modal-tree-constructions/10.1305/ndjfl/1093888117.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058978813","display_name":"Ralph L. Slaght","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ralph L. Slaght","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058978813"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.10746466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9168999791145325,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9168999791145325,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/modal","display_name":"Modal","score":0.6016177535057068},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4713774621486664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45109909772872925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3843281865119934},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.16969361901283264},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14358574151992798},{"id":"https://openalex.org/keywords/composite-material","display_name":"Composite material","score":0.09331747889518738}],"concepts":[{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.6016177535057068},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4713774621486664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45109909772872925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3843281865119934},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.16969361901283264},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14358574151992798},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.09331747889518738}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093888117","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888117","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-4/Modal-tree-constructions/10.1305/ndjfl/1093888117.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/1093888117","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093888117","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/1093888117","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888117","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-4/Modal-tree-constructions/10.1305/ndjfl/1093888117.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":[{"display_name":"Sustainable cities and communities","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2044893645.pdf"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2016569281"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644"],"abstract_inverted_index":{"The":[0],"utility":[1],"of":[2,10,24,30,170,196,200,212,221,244],"truth":[3],"tree":[4,86,102,111,131,205,216,223,232],"constructions":[5,87],"to":[6,49,83,112,135,161,168],"determine":[7],"the":[8,22,28,37,62,84,175,181,201,219,222,231,239],"validity":[9],"truthfunctional":[11],"and/or":[12],"quantificational":[13],"arguments":[14,33],"is":[15,94,105,118,125,149,209,224,229,241],"well-known.In":[16],"what":[17],"follows,":[18],"I":[19],"have":[20,189],"extended":[21],"procedure":[23],"Jeffrey":[25],"1":[26],"for":[27,88,151,203],"purpose":[29],"also":[31],"handling":[32],"whose":[34],"sentences":[35,171],"contain":[36],"standard":[38],"modal":[39,51,78,85,204],"operators,":[40],"D":[41],"and":[42,55,114,142,158,185,233],"O.The":[43],"basic":[44],"program":[45],"has":[46,133],"been":[47,190],"designed":[48],"accommodate":[50],"system":[52],"T":[53,89],"(Hughes":[54],"Cresswell),":[56],"2":[57],"including":[58],"first-order":[59],"logic":[60],"with":[61],"Barcan":[63],"formula,":[64],"(x)":[65],"\u2022(.":[66],".":[67,69,73,75],".x":[68,74],"..)":[70],"^":[71],"\u2022(#)(.":[72],"..).The":[76],"two":[77],"notions":[79],"which":[80,132,172,188,228],"are":[81],"essential":[82],"are:":[90],"(a)":[91],"if":[92,116],"Op":[93],"a":[95,106,119,126,153,156,162,165,194,197,210,215,242],"sentence":[96,107,120,127,154],"(see":[97,137],"section":[98,138],"2.1":[99,144],"below)":[100],"in":[101,108,121,128,146,164,214,225,230],"A,":[103,122],"thenp":[104],"some":[109,245],"alternative-world":[110,130,186],"A;":[113],"(b)":[115],"\u038fp":[117],"then":[123],"p":[124],"every":[129,226,236],"access":[134],"A":[136,207],"2.4":[139],"below).2":[140],"Definitions":[141],"Notes":[143],"\"Sentence\"":[145],"these":[147],"contexts":[148],"elliptical":[150],"\"either":[152],"or":[155],"sentence-form\"":[157],"it":[159],"refers":[160],"point":[163,237],"tree,":[166],"not":[167],"components":[169],"make":[173],"up":[174],"point.2.2":[176],"\"Constructed":[177],"configuration\"":[178],"means":[179],"\"All":[180],"sentences,":[182],"trees,":[183],"paths,":[184],"trees":[187],"written":[191],"down":[192],"as":[193],"result":[195],"particular":[198],"application":[199],"Program":[202],"constructions\".2.3":[206],"path":[208,227],"sequence":[211],"points":[213],"such":[217,234],"that":[218,235],"origin":[220,240],"below":[238],"successor":[243],"previous":[246],"point.":[247]},"counts_by_year":[],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}