The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary

Mathematical Logic Quarterly 13 (1‐2):15-20 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19670130104

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary.M. R. Krom - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):15-20.
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 for formulas in prenex conjunctive normal form with binary disjunctions.M. R. Krom - 1970 - Journal of Symbolic Logic 35 (2):210-216.
Some interpolation theorems for first-order formulas in which all disjunctions are binary.M. R. Krom - 1968 - Logique Et Analyse 43 (196):8.
A reduction class containing formulas with one monadic predicate and one binary function symbol.Charles E. Hughes - 1976 - Journal of Symbolic Logic 41 (1):45-49.
M. R. Krom. Separation principles in the hierarchy theory of pure first-order logic. The journal of symbolic logic, vol. 28 no. 3 , pp. 222–236.D. A. Clarke - 1966 - Journal of Symbolic Logic 31 (3):503.
A Method for Finding Formulae Corresponding to First Order Universal Decision Elements in m‐Valued Logic.John Loader - 1974 - Mathematical Logic Quarterly 20 (1‐3):1-18.
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.
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.

Analytics

Added to PP
2013-12-01

Downloads
35 (#445,801)

6 months
3 (#1,208,833)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
No Rationality Through Brute-Force.Danilo Fraga Dantas - 2017 - Filosofia Unisinos 18 (3):195-200.

View all 9 citations / Add more citations

References found in this work

A system of quantificational deduction.Thomas E. Patton - 1963 - Notre Dame Journal of Formal Logic 4 (2):105-112.

Add more references