Back to Results
First PageMeta Content
Propositional calculus / Model theory / Boolean algebra / Formal languages / Predicate logic / Propositional variable / First-order logic / Interpretation / Propositional formula / Logic / Mathematical logic / Mathematics


Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas Patrick Doherty Dept. of Computer Science Link¨oping University S[removed]Link¨oping, Sweden
Add to Reading List

Document Date: 2012-02-01 08:08:21


Open Document

File Size: 93,87 KB

Share Result on Facebook
UPDATE