Structural completeness in propositional logics of dependence (Q334998)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6646572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Structural completeness in propositional logics of dependence |
scientific article; zbMATH DE number 6646572 |
Statements
Structural completeness in propositional logics of dependence (English)
0 references
1 November 2016
0 references
The paper studies three logics of dependence: \textsf{PD}, \textsf{InqL} and \textsf{PT}. None of these logics is closed under uniform substitutions, but they are closed under substitutions of a particular type: flat substitutions which map propositional variables to flat formulas. A flat formula is a classical formula satisfying the condition \(X \models \varphi \Leftrightarrow \forall v, \{v\} \models \varphi\). In a natural way, admissibility of a rule can be defined in terms of flat substitutions. It is proven that all three aforementioned logics are closed and structurally complete relative to flat substitutions.
0 references
propositional logic
0 references
dependence logic
0 references
inquisitive logic
0 references
inference rule
0 references
admissible rule
0 references
structural completeness
0 references
0.8101924061775208
0 references
0.7465929388999939
0 references
0.7459321022033691
0 references
0.7433859705924988
0 references
