This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aanderaa, S.O.: On the decision problem for formulas in which all disjunctions are binary. Proc. of the Second Scand. Log. Symp. (1971), pp.1–18.
Aanderaa, S.O., Börger, E., Gurevich, Yu.: Prefix classes of Krom formulae with identity. Archiv math. Logik 22 (1982), pp.43–49.
Aanderaa, S.O., Lewis, H.: Prefix classes of Krom formulas. Journal of Symbolic Logic 38 (1973), pp.628–642.
Börger, E.: Reduktionstypen in Krom-und Hornformeln. Diss. Münster 1971.
Börger, E.: Eine entscheidbare Klasse von Kromformeln. Zeitschrift f. Math. Logik u. Grundl. d. M. 19 (1973), pp.117–120.
Börger, E.: Decision problems in predicate logic. Bericht Nr. 153/1983 der Abteilung Informatik der Universität Dortmund.
Deutsch, M.: Zur Reduktionstheorie des Entscheidungsproblems. Zeitschr. f. Math. Logik u. Grundlagen d. Math. 27 (1981), pp. 113–117.
Deutsch, M.: Zur gödelisierungsfreien Darstellung der rekursiven und primitiv-rekursiven Funktionen und rekursiv aufzählbaren Prädikate über Quotiententermmengen. Zeitschr.f. Math. Logik u. Grundlagen d. Math. 26 (1980), pp. 1–32.
Deutsch, M.: Eine Verschärfung eines Satzes von Kostyrko zur Reduktionstheorie. To appear in Zeitschr. f. Math. Logik u. Grundlagen d. Math.
Goldfarb, W.D.: On the Gödel class with identity. The Journal of Symbolic Logic 46 (1981), pp. 354–364.
Goldfarb, W.D., Gurevich, Yu., Shelah, S.: On the Gödel class with identity. To appear.
Gurevich, Yu.: Ob effektivnom raspoznavanii vipolnimostik formul UIP. Algebra i Logika 5 (1966), pp. 25–55.
Gurevich, Yu.: Formulas with one ∀. In Memory of A.I. Maltsev, 1973 (in Russian).
Gurevich, Yu.: The decision problem for standard classes. The Journal of Symbolic Logic 41 (1976), pp. 460–464.
Kostyrko, V.F.: Klass cvedeniya ∀εn∀. Algebra i Logika 3 (1964), pp. 45–65.
Kostyrko, V.F.: Klass cvedeniya ∀ε∀. Kibernetika 2 (1966), pp. 15–19.
Krom, M.R.: The decision problem for a class of first-order formulas in which all disjunctions are binary. Zeitschr. f. Math. Logik u. Grundlagen d. Math. 13 (1967), pp. 15–20.
Krom, M.R.: The decision problem for formulas in prenex conjunctive normal form with binary disjunctions. The Journal of Symbolic Logic 35 (1970), pp.210–216.
Lewis, H.R.: Krom formulas with one dyadic predicate letter. The Journal of Symbolic Logic 41 (1976), pp.341–362.
Lewis, H.R.: Unsolvable classes of quantificational formulas. Reading (Mass.) 1979.
Deutsch, M.: Zum Reduktionstyp ∀3∃∞(0,1). To appear in Zeitschrift f. Math. Logik u. Grundlagen d. Mathematik.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deutsch, M. (1984). Reductions for the satisfiability with a simple interpretation of the predicate variable. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_47
Download citation
DOI: https://doi.org/10.1007/3-540-13331-3_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13331-5
Online ISBN: 978-3-540-38856-2
eBook Packages: Springer Book Archive