Disjunction and existence properties in modal arithmetic
Taishi Kurahashi, Motoki Okuda

TL;DR
This paper explores various disjunction and existence properties in modal arithmetic, introduces new classes of formulas, and establishes equivalences between these properties under certain conditions.
Contribution
It introduces three new classes of formulas in modal arithmetic and proves their relationships with disjunction and existence properties, expanding understanding of modal arithmetic theories.
Findings
$ ext{B}$-existence and disjunction properties are equivalent for certain theories.
Modal disjunction property is equivalent to $ ext{B}$-soundness in theories extending $ ext{PA}( ext{K4})$.
New classes $ ext{B}$, $ riangle( ext{B})$, and $ ext{S}( ext{B})$ are introduced and studied.
Abstract
We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes , , and of formulas of modal arithmetic, and study basic properties of them. Then, we prove several implications between the properties. In particular, among other things, we prove that for any consistent recursively enumerable extension of with , the -disjunction property, the -existence property, and the -existence property are pairwise equivalent. Moreover, we introduce the notion of the -soundness of theories, and prove that for any consistent recursively enumerable extension of , the modal disjunction property is equivalent to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Logic, programming, and type systems
