First Page | Document Content | |
---|---|---|
![]() Date: 2010-05-10 07:17:13Boolean algebra Logical syntax Formal languages Well-formed formula Logical connective Propositional calculus FO Modal depth Propositional formula Logic Mathematical logic Modal logic | Add to Reading List |
![]() | Propositional Update Operators based on Formula/Literal Dependence ANDREAS HERZIG IRIT-CNRS, Toulouse JEROME LANG LAMSADE-CNRS, ParisDocID: 1uOWZ - View Document |
![]() | Some Notes on Proofs with Alpha Graphs Frithjof Dau Technische Universit¨ at Dresden, Dresden, GermanyDocID: 1r1sv - View Document |
![]() | Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1DocID: 1qi9Q - View Document |
![]() | predicate logic logical verification weekDocID: 1q9E7 - View Document |
![]() | A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates James Brotherston ∗ Carsten Fuhs † Juan A. Navarro P´erez ‡ University College LondonDocID: 1q21c - View Document |