First‐Order Formulas in Conjunctive Quantificational Form

&
Mathematical Logic Quarterly 34 (1):53-64 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19880340107

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

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 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):53-64.
Hans Kleine Buning and Theodor Lettmann, propositional logic: Deduction and algorithms.Anthony Hunter - 2002 - Studia Logica 71 (2):247-258.
Hans Kleine Buning and Theodor Lettmann, Propositional Logic: Deduction and Algorithms. [REVIEW]Hans Kleine Buning & Theodor Lettmann - 2002 - Studia Logica 71 (2):247-258.
Algebraic Characterizations of the Satisfiability of First‐Order Logical Formulas and the Halting of Programs.Jean‐Pierre Bénéjam - 1976 - Mathematical Logic Quarterly 23 (7‐12):111-120.
The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary.M. R. Krom - 1967 - Mathematical Logic Quarterly 13 (1‐2):15-20.
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.
Unsolvable classes of quantificational formulas.Harry R. Lewis - 1979 - Reading, Mass.: Addison-Wesley.
The decision problem for formulas in prenex conjunctive normal form with binary disjunctions.M. R. Krom - 1970 - Journal of Symbolic Logic 35 (2):210-216.

Analytics

Added to PP
2013-12-01

Downloads
13 (#1,066,279)

6 months
5 (#710,311)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
The decision problem: solvable classes of quantificational formulas.Burton Dreben - 1979 - Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb.

Add more references