PhilArchive
open access
Sahlqvist Formulas Unleashed in Polyadic Modal Languages
We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.
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
- Robust XML Encoding Rules (RXER) for Abstract Syntax Notation One (ASN.1)#500889
- The Status of Arguments in Abstract Argumentation Frameworks. A Tableaux Method#709036
- A corpus linguistics study of translation correspondences in English and German#1148656
- Translating Metainferences Into Formulae: Satisfaction Operators and Sequent Calculi#763714
- Gradient Cybernetics: The Calculus of Recursion - Synthesis Essay XV - The Terminal Proofs: Logical, Mathematical, and Equational Closure#80698
Record · ID 737279
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