Back to Results
First PageMeta Content
Automated theorem proving / Logic programming / Logic in computer science / Boolean algebra / Model theory / Substitution / Boolean satisfiability problem / Interpretation / Relationships among probability distributions / Lifting theory


THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of
Add to Reading List

Document Date: 2015-02-06 12:14:26


Open Document

File Size: 323,40 KB

Share Result on Facebook