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

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 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: 91,881

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 - Mathematical Logic Quarterly 13 (1‐2):15-20.
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.
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.
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.
Simple methods for evaluating and comparing binary experiments.Thomas A. Weber - 2010 - Theory and Decision 69 (2):257-288.
A Bdd-based Simplification And Skolemization Procedure.Jean Goubault - 1995 - Logic Journal of the IGPL 3 (6):827-855.
Ultraproducts and Higher Order Formulas.Gábor Sági - 2002 - Mathematical Logic Quarterly 48 (2):261-275.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
First-Order Logic and First-Order Functions.Rodrigo A. Freire - 2015 - Logica Universalis 9 (3):281-329.
You Have to Be Two to Start: Rational Thoughts About Love.E. Von Glasersfeld - 2006 - Constructivist Foundations 2 (1):1-5.
Some Decidability Results for ℤ[G]‐Modules when G is Cyclic of Squarefree Order.Carlo Toffalori - 1996 - Mathematical Logic Quarterly 42 (1):433-445.
The ground-negative fragment of first-order logic is πp2-complete.Andrei Voronkov - 1999 - Journal of Symbolic Logic 64 (3):984 - 990.
First order theory for literal‐paraconsistent and literal‐paracomplete matrices.Renato A. Lewin & Irene F. Mikenberg - 2010 - Mathematical Logic Quarterly 56 (4):425-433.
A First-order Conditional Probability Logic.Miloš Milošević & Zoran Ognjanović - 2012 - Logic Journal of the IGPL 20 (1):235-253.

Analytics

Added to PP
2016-02-04

Downloads
44 (#361,254)

6 months
4 (#790,394)

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