KRF.thetaExpressiveComplete
OpenKRF.thetaExpressiveCompleteTheorem 1 (b): the canonical KRF is expressively complete.
Preamble
import Definitions.Def_KRF_Machinery
noncomputable section
open KRFCore
open KRFCore.FStruct
open KRF
variable {σD σQ : Sig}
/-- The canonical-KRF predicate (platform form of thetaKrf): the theory
engine mapping carried by the StarContract. -/
def IsTheta {σD σQ : Sig} {Q : QueryLanguage σQ} (c : Coding σD σQ)
(S : StarContract σD σQ Q) (T : Krf σD σQ Q) : Prop :=
∃ hdom : T.dom = S.isTheory,
∀ (π : Nat) (h : S.isTheory π), ∀ D φ,
T.Γ π (hdom ▸ h) D φ ↔ KM (S.theoryEngine h) D φFormal statement
theorem KRF.thetaExpressiveComplete {Q : QueryLanguage σQ} (c : Coding σD σQ) (S : StarContract σD σQ Q) :
∃ T : Krf σD σQ Q, IsTheta c S T ∧ ExpressiveComplete T :=
sorrySource
arXiv 2412.11855v2 (Zhang, Jiang, Quan)