{"id":"https://openalex.org/W2122406460","doi":"https://doi.org/10.1305/ndjfl/1093870374","title":"Tense trees: a tree system for ${\\rm K}_{{\\rm t}}$.","display_name":"Tense trees: a tree system for ${\\rm K}_{{\\rm t}}$.","publication_year":1983,"publication_date":"1983-07-01","ids":{"openalex":"https://openalex.org/W2122406460","doi":"https://doi.org/10.1305/ndjfl/1093870374","mag":"2122406460"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093870374","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093870374","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-24/issue-3/Tense-trees-a-tree-system-for-rm-K_rm-t/10.1305/ndjfl/1093870374.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-24/issue-3/Tense-trees-a-tree-system-for-rm-K_rm-t/10.1305/ndjfl/1093870374.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028464928","display_name":"B. J. Copeland","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"B. J. Copeland","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028464928"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7752,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.81221188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9848999977111816,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9848999977111816,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9453999996185303,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9370999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/tree","display_name":"Tree (set theory)","score":0.5653824210166931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.536088764667511},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47029420733451843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3863523304462433},{"id":"https://openalex.org/keywords/forestry","display_name":"Forestry","score":0.3619290590286255},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.17723524570465088}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5653824210166931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.536088764667511},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47029420733451843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3863523304462433},{"id":"https://openalex.org/C97137747","wikidata":"https://www.wikidata.org/wiki/Q38112","display_name":"Forestry","level":1,"score":0.3619290590286255},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.17723524570465088}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093870374","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093870374","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-24/issue-3/Tense-trees-a-tree-system-for-rm-K_rm-t/10.1305/ndjfl/1093870374.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/1093870374","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093870374","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/1093870374","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093870374","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-24/issue-3/Tense-trees-a-tree-system-for-rm-K_rm-t/10.1305/ndjfl/1093870374.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/W2122406460.pdf","grobid_xml":"https://content.openalex.org/works/W2122406460.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1529615003","https://openalex.org/W2155581733","https://openalex.org/W4256562411","https://openalex.org/W6682590233"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W4238204885"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}