Switch to: References

Citations of:

The decision problem: solvable classes of quantificational formulas

Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb (1979)

Add citations

You must login to add citations.
  1. Tautology: How not to use a word.Burton Dreben & Juliet Floyd - 1991 - Synthese 87 (1):23 - 49.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Frank Ramsey and the Realistic Spirit.Steven Methven - 2014 - London and Basingstoke: Palgrave Macmillan.
    This book attempts to explicate and expand upon Frank Ramsey's notion of the realistic spirit. In so doing, it provides a systematic reading of his work, and demonstrates the extent of Ramsey's genius as evinced by both his responses to the Tractatus Logico-Philosophicus , and the impact he had on Wittgenstein's later philosophical insights.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Reduktionstyp und Spektrale Darstellung Mit Dem Präfix.Michael Deutsch - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (18):273-288.
    Download  
     
    Export citation  
     
    Bookmark  
  • Decidability of ∀*∀‐Sentences in Membership Theories.Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti - 1996 - Mathematical Logic Quarterly 42 (1):41-58.
    The problem is addressed of establishing the satisfiability of prenex formulas involving a single universal quantifier, in diversified axiomatic set theories. A rather general decision method for solving this problem is illustrated through the treatment of membership theories of increasing strength, ending with a subtheory of Zermelo-Fraenkel which is already complete with respect to the ∀*∀ class of sentences. NP-hardness and NP-completeness results concerning the problems under study are achieved and a technique for restricting the universal quantifier is presented.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Ein neuer beweis und eine verschärfung für den reduktionstyp ∀∃∀∞(0, 1) mit einer anwendung auf die spektrale darstellung Von prädikaten. [REVIEW]Michael Deutsch & M. Deutsch - 1992 - Mathematical Logic Quarterly 38 (1):559-574.
    Download  
     
    Export citation  
     
    Bookmark  
  • Herbrand's Theorem for a Modal Logic.Melvin Fitting - unknown
    Herbrand’s theorem is a central fact about classical logic, [9, 10]. It provides a constructive method for associating, with each first-order formula X, a sequence of formulas X1, X2, X3, . . . , so that X has a first-order proof if and only if some Xi is a tautology. Herbrand’s theorem serves as a constructive alternative to..
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Reduktionstyp und Spektrale Darstellung Mit Dem Präfix.Michael Deutsch - 1991 - Mathematical Logic Quarterly 37 (18):273-288.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)First‐Order Formulas in Conjunctive Quantificational Form.Hans Kleine Büning & Theodor Lettmann - 1988 - Mathematical Logic Quarterly 34 (1):53-64.
    Download  
     
    Export citation  
     
    Bookmark  
  • The classical decision problem, Egon börger, Erich grädel, and Yuri Gurevich.Maarten Marx - 1999 - Journal of Logic, Language and Information 8 (4):478-481.
    Download  
     
    Export citation  
     
    Bookmark