A Syntactic Characterization of Minimal Entailment

• cours magistral - matière potentielle : notes
• exposé

A Syntactic Characterization of Minimal Entailment1 Marek A. Suchenek Department of Computer Science The Wichita State University Wichita, KS 67208, U.S.A. Bitnet addr: Suchenek@twsuvax Key words: closed world assumption, deductive data bases, model theory for non-monotonic logics, non-standard negation, preservation under homomorphisms. AMS classification: 68G99, 03C40, 03C52. Abstract This paper investigates a consistent versions cwaS of sometimes inconsistent Reiter's closed world assumption cwa, proving (theorem 4.3) that for every ∀-sentence ϕ and for every ∀-theory Σ, ϕ ∈ cwaS(Σ) iff Σ min ϕ.

• cwas
• gcwa
• wichita state university wichita
• minimal model of σ
• theory σ
• proof
• a.
• problem