<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2018-04-25 11:34:43Mathematics Theoretical computer science Mathematical logic Lemmas Model theory Interpolation Logic in computer science Craig interpolation Satisfiability modulo theories Farkas' lemma Quantifier elimination First-order logic |
Add to Reading List |
Selfless Interpolation for Infinite-State Model Checking? Tanja Schindler1 and Dejan Jovanovi´c2 1 University of Freiburg | Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document |
 | Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document |
 | Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document |
 | Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document |
 | CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |