The reviewed record of science sign in
Pith

arxiv: 2205.06391 · v1 · pith:3DTCIV2G · submitted 2022-05-12 · cs.LO · cs.AI

PVS Embeddings of Propositional and Quantified Modal Logic

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3DTCIV2Grecord.jsonopen to challenge →

classification cs.LO cs.AI
keywords modallogicstandardallowembeddingspropositionalquantifiedreport
0
0 comments X
read the original abstract

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional and quantified modal logic in the PVS verification system. The resources of PVS allow this to be done in an attractive way that supports much of the standard syntax of modal logic, while providing effective automation. The report introduces and formally specifies and verifies several standard topics in modal logic such as relationships between the standard modal axioms and properties of the accessibility relation, and attributes of the Barcan Formula and its converse in both constant and varying domains.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.