{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:33Z","timestamp":1725502053865},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this paper, we present an embedding of higher-order nominal modal logic<\/jats:p><jats:p>into classical higher-order logic, and study its automation. There exists no automated theorem prover for first-order or higher-order nominal logic at the moment, hence, this is the first automation for this kind of logic.<\/jats:p><jats:p>In our work, we focus on nominal tense logic and have successfully proven some first theorems.<\/jats:p>","DOI":"10.29007\/dzc2","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:15Z","timestamp":1516748655000},"page":"59-52","source":"Crossref","is-referenced-by-count":0,"title":["Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic"],"prefix":"10.29007","volume":"33","author":[{"given":"Max","family":"Wisniewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Steen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:17Z","timestamp":1516748657000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/Cww"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/dzc2","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}