![Logic / Mathematical logic / Mathematics / Model theory / Predicate logic / Finite model theory / Automated theorem proving / Boolean algebra / First-order logic / Resolution / FO / Interpretation Logic / Mathematical logic / Mathematics / Model theory / Predicate logic / Finite model theory / Automated theorem proving / Boolean algebra / First-order logic / Resolution / FO / Interpretation](https://www.pdfsearch.io/img/d6cc10e9e473eb28c042cce372b6e4fe.jpg) Date: 2010-03-23 07:22:00Logic Mathematical logic Mathematics Model theory Predicate logic Finite model theory Automated theorem proving Boolean algebra First-order logic Resolution FO Interpretation | | The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.Add to Reading ListSource URL: www.bedewell.comDownload Document from Source Website File Size: 191,28 KBShare Document on Facebook
|