PhilArchive
open access
Notes on exact verification in modal languages
The basic modal language into which we embed intuitionistic logic cannot express the difference between exact and inexact verification of a sentence given a state. I describe few ways to expand the language of basic modal logic that allow us to express this difference. The specific expansion needed depends on the intermediate logic we are interested in.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Completeness theorems for modal (sub)intuitionistic logic without a monotonic valuation function#108433
- The Lost Pillar of Deontic Modality (Part of the Dissertation Portfolio Modality, Names and Descriptions)#779015
- Making Theorem-Proving in Modal Logic Easy#756446
- Modeling future indeterminacy in possibility semantics#105695
- Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality#746188
Record · ID 706977
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive