Double Exponential Inseparability Of Robinson Subsystem Q+ From The Unsatisfiable Sentences In The Language Of Addition (1992)  (Make Corrections)   Giovanni Faglia, Paul YoungKGC: Kurt Godel Colloquium on Computational Logic and Proof Theory   Home/Search   Context   Related

View or download: washington.edu/tr/...CSE920901.PS.Z Cached:  PS.gz  PS  PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.   PS.gz  PS  PDF   Image  Update  Help From:  washington.edu (more) (Enter author homepages)

Rate this article: (best)   Comment on this article

@inproceedings{ faglia93double,
    author = "Faglia",
    title = "Double Exponential Inseparability of Robinson Subsystem {Q}_+ from the Unsatisfiable Sentences in the Language of Addition",
    booktitle = "{KGC}: Kurt Godel Colloquium on Computational Logic and Proof Theory",
    publisher = "LNCS, Springer-Verlag",
    year = "1993",
    url = "citeseer.ist.psu.edu/faglia92double.html" }