- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Unsolvable Classes of Quantificational Formulas
Journal of Symbolic Logic 47 (1):221-222 (1982)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Review: Harry R. Lewis, Unsolvable Classes of Quantificational Formulas. [REVIEW]Dieter Rodding - 1982 - Journal of Symbolic Logic 47 (1):221-222.
LEWIS, H. R. Unsolvable Classes of Quantificational Formulas. [REVIEW]G. Lolli - 1982 - Scientia 76 (17):420.
Lewis, H. R. Unsolvable Classes Of Quantificational Formulas. [REVIEW]G. Lolli - 1982 - Scientia 76 (117):420.
Unsolvable classes of quantificational formulas.Harry R. Lewis - 1979 - Reading, Mass.: Addison-Wesley.
Conservative reduction classes of Krom formulas.Stål O. Aanderaa, Egon Börger & Harry R. Lewis - 1982 - Journal of Symbolic Logic 47 (1):110-130.
The Decision Problem. Solvable Classes of Quantificational Formulas.Peter B. Andrews - 1982 - Journal of Symbolic Logic 47 (2):452-453.
Review: Burton Dreben, Warren D. Goldfarb, The Decision Problem. Solvable Classes of Quantificational Formulas. [REVIEW]Peter B. Andrews - 1982 - Journal of Symbolic Logic 47 (2):452-453.
The decision problem: solvable classes of quantificational formulas.Burton Dreben - 1979 - Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb.
Reduction to first degree in quantificational S5.Michael J. Carroll - 1979 - Journal of Symbolic Logic 44 (2):207-214.
Prefix classes of Krom formulas.Stål O. Aanderaa & Harry R. Lewis - 1973 - Journal of Symbolic Logic 38 (4):628-642.
First-Order Formulas in Conjunctive Quantificational Form.Hans Büning - 1988 - Mathematical Logic Quarterly 34 (1):53-64.
First‐Order Formulas in Conjunctive Quantificational Form.Hans Kleine Büning & Theodor Lettmann - 1988 - Mathematical Logic Quarterly 34 (1):53-64.
Hyperformulas and Solid Algebraic Systems.Klaus Denecke & Dara Phusanga - 2008 - Studia Logica 90 (2):263-286.
Analytics
Added to PP
2017-02-21
Downloads
9 (#1,252,744)
6 months
2 (#1,196,523)
2017-02-21
Downloads
9 (#1,252,744)
6 months
2 (#1,196,523)
Historical graph of downloads
Citations of this work
On the decision problem for two-variable first-order logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
Asymptotic conditional probabilities: The non-unary case.Adam J. Grove, Joseph Y. Halpern & Daphne Koller - 1996 - Journal of Symbolic Logic 61 (1):250-276.
Decidability of ∀*∀‐Sentences in Membership Theories.Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti - 1996 - Mathematical Logic Quarterly 42 (1):41-58.
Undecidability of modal and intermediate first-order logics with two individual variables.D. M. Gabbay & V. B. Shehtman - 1993 - Journal of Symbolic Logic 58 (3):800-823.
On the gödel class with identity.Warren D. Goldfarb - 1981 - Journal of Symbolic Logic 46 (2):354-364.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-wg6s5 uwo