<p>STIT logic is a family of logics of agency that have received attention in the literature. Despite a variety of developments, most of the existing studies on STIT logic are based on propositional logic. Such propositional STIT logics have computational advantages, but in these logics it seems difficult to distinguish the <i>de re</i> and <i>de dicto</i> readings of sentences about choice independently of models and assignments. To overcome this expressive limitation, this paper presents a cstit-based atemporal first-order STIT logic and its finite domain version as members of a family of term-modal logics possibly with a generalized axiom of independence of agents. The main result is that our proposed Hilbert-style systems for term-modal logics with the alethic modality, equality and non-rigid terms, when they have the (generalized) axiom of independence of agents only if the number of agents is finite, are strongly complete. In particular, the strong completeness of a Hilbert-style system for our first-order STIT logic of finite domain is proved.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Bringing De Re and De Dicto into STIT Logic

  • Takahiro Sawasaki

摘要

STIT logic is a family of logics of agency that have received attention in the literature. Despite a variety of developments, most of the existing studies on STIT logic are based on propositional logic. Such propositional STIT logics have computational advantages, but in these logics it seems difficult to distinguish the de re and de dicto readings of sentences about choice independently of models and assignments. To overcome this expressive limitation, this paper presents a cstit-based atemporal first-order STIT logic and its finite domain version as members of a family of term-modal logics possibly with a generalized axiom of independence of agents. The main result is that our proposed Hilbert-style systems for term-modal logics with the alethic modality, equality and non-rigid terms, when they have the (generalized) axiom of independence of agents only if the number of agents is finite, are strongly complete. In particular, the strong completeness of a Hilbert-style system for our first-order STIT logic of finite domain is proved.