arXiv (All)
open access
Labelled Process Logic
This paper develops a complete labelled proof-theoretic framework for process logic --- an extension of dynamic logic in which formulas specify properties of execution traces rather than only final states. The main difficulty is that first-order process logic must reason about concrete computations
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
- Executing Discrete/Continuous Declarative Process Specifications via Complex Event Processing#1105939
- Feedback Makes Perfect: A Closed-Loop Framework for NL-to-STL Translation#1117999
- The Root of the Demand: Two Limitative Theorems and a Conditional Forcing Result for Answerable Inquiry#689564
- Counterfactual Analysis of Executable Clinical Decision Logic#657299
- Provenance-Respecting Measure Specifications Without a Global Selector: The PRSpec Normal Form, Graded-Weight Augmentations, and the Classification Extended#689562
Record · ID 1117463
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