有恶臭
发表于 2025-3-23 10:15:40
,Correspondence Theory for Generalized Modal Algebras,s are not the clopen valuations anymore, but values in the set . which are only closed and satisfy additional properties, not necessarily open. This situation is significantly different from existing settings using Stone/Priestley-like dualities, where all admissible valuations are clopen valuations.
Terrace
发表于 2025-3-23 14:42:13
,Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting, complexity of the non-emptiness problem for the presented machines. We demonstrate the usefulness of our automata models by polynomially encoding the two-variable guarded fragment extended with Presburger constraints, improving the existing triply-exponential upper bound to a single exponential.
reaching
发表于 2025-3-23 18:44:54
0302-9743 ith 8 extra abstracts, 5 invited talks and 3 tutorials were fully reviewed and selected from 46 submissions. The conference aims fostering interdisciplinary research in pure and applied logic.978-3-031-15297-9978-3-031-15298-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
角斗士
发表于 2025-3-23 23:09:27
,Fixed Point Logics and Definable Topological Properties,rfect core, and thus we dub them . We show that the .-calculus is sound and complete for these classes. Our examples are minimal in the sense that they use a single instance of a greatest fixed point.
不给啤
发表于 2025-3-24 03:44:35
http://reply.papertrans.cn/59/5881/588062/588062_15.png
Ornithologist
发表于 2025-3-24 07:10:18
,Towards an Intuitionistic Deontic Logic Tolerating Conflicting Obligations,gic and it is semantically characterised by a suitable neighbourhood semantics. We further present a simple cut-free sequent calculus for this logic. By means of this calculus we show that logic MIND is decidable and that it satisfies the disjunction property.
无所不知
发表于 2025-3-24 12:26:09
http://reply.papertrans.cn/59/5881/588062/588062_17.png
hangdog
发表于 2025-3-24 17:37:17
,Logic of Visibility in Social Networks,nstruction to post an unpopular opinion that may reach many agents. The network is presented both in a static and dynamic form. We prove completeness, expressivity and model checking problem complexity results for the corresponding logical systems.
Ingest
发表于 2025-3-24 19:39:49
http://reply.papertrans.cn/59/5881/588062/588062_19.png
Demulcent
发表于 2025-3-25 00:04:58
http://reply.papertrans.cn/59/5881/588062/588062_20.png