2014/10/29 by Zoltán Ésik, Zoltan Esik, Esik, Zoltan
Computer Science · #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #acm:68Q55 #cs.LO #msc:68Q55
paper · pdf · doi:10.48550/arxiv.1410.8111
arxiv created 2015/12/10 · arxiv updated 2015/12/11
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies `the standard' identities of fixed point operations as described by the axioms of iteration theories. We also study this new fixed point operation in connection with lambda-abstraction.