{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:40:11Z","timestamp":1706650811790},"reference-count":0,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1983,7,1]]},"DOI":"10.1305\/ndjfl\/1093870374","type":"journal-article","created":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T11:42:59Z","timestamp":1134474179000},"source":"Crossref","is-referenced-by-count":0,"title":["Tense trees: a tree system for ${\\rm K}_{{\\rm t}}$."],"prefix":"10.1215","volume":"24","author":[{"given":"B. J.","family":"Copeland","sequence":"first","affiliation":[]}],"member":"73","container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1093870374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:07:55Z","timestamp":1706648875000},"score":1,"resource":{"primary":{"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.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7,1]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[1983,7,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1093870374","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7,1]]}}}