Structural completeness in propositional logics of dependence (Q334998): Difference between revisions

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.