Skip to content

Latest commit

 

History

History
67 lines (56 loc) · 2.45 KB

HereAndThere.md

File metadata and controls

67 lines (56 loc) · 2.45 KB

HereAndThere

Base

  • here-and-there interpretations
  • model relation
  • types for validity and validity of equivalences
  • two extensions of the model relation to theories (and proof of their equivalence)

Eval

  • alternative definition of the model relation based on an eval function mapping interpretations and formulas to booleans
  • equivalence proof of both model relation
  • proofs of some ht properties using the eval based relation

Properties

  • total ht is equivalent to classical logic
  • truth in <H,T> implies truth in <T,T>
  • negation in ht only depend on there component
  • contradiction (i.e. if ¬f and f hold every formula holds)
  • if ¬f holds, f ⇒ g holds for every g
  • ht is three valued

Equivalences

  • is an equivalence relation
  • equational reasoning for ht equivalences
  • commutativity and associativity
  • identities and zeroes
  • distributivity
  • substitution

Tautologies

  • weak law of excluded middle
  • hosoi
  • removal of triple negation
  • currying
  • combining of implications
  • reordering of implications
  • de-morgan
  • removal of disjunction
  • removal of nested implication
  • removal of double negation in implications

LogicPrograms

  • equivalence of theories and different kinds of logic programs

    LogicPrograms.Nested

    • every formula/theory is equivalent to a nested logic program
    • conjunction, disjunction, and implications of nested logic programs is a nested logic program
    • every formula without disjunction is equivalent to a nested logic program

    LogicPrograms.DisjunctiveConjunctive

    • every nested logic programs is equivalent to a logic program with rules of form dnf cnf
    • every nested expression is equivalent to a dnf/cnf

    LogicPrograms.SimpleDisjunctiveConjunctive

    • every logic program with rules of form dnf cnf is equivalent to a logic program with rules of form sc sd
    • removal of disjunction in rule bodies
    • removal of conjunction in rule heads

    LogicPrograms.DoubleNegation

    • every logic program with rules of form sc sd is equivalent to a logic program with double negation
    • removal of rules containing in head
    • removal of rules containing in body

    LogicPrograms.Base

    • every theory is (strongly) equivalent to a logic program
    • removal of double negation in logic programs containing double negation
    • rewriting of body/head expressions with double negation to extract one double negation