The decision problem for formulas in prenex conjunctive normal form with binary disjunctions

E-ISSN： 1943-5886|35|2|210-216

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.35, Iss.2, 1970-06, pp. : 210-216

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An improved prenex normal form¹

The Journal of Symbolic Logic, Vol. 27, Iss. 3, 1962-09 ,pp. : 317-326

Cambridge University Press

Access to resources Recommend Favorite

A conjunctive normal form for S3.5

The Journal of Symbolic Logic, Vol. 34, Iss. 2, 1969-07 ,pp. : 253-255

Cambridge University Press

Access to resources Recommend Favorite

Omitting types of prenex formulas

The Journal of Symbolic Logic, Vol. 32, Iss. 1, 1967-06 ,pp. : 61-74

Cambridge University Press

Access to resources Recommend Favorite

The decision problem for formulas with a small number of atomic subformulas

The Journal of Symbolic Logic, Vol. 38, Iss. 3, 1973-09 ,pp. : 471-480

Cambridge University Press

Access to resources Recommend Favorite

A normal form theorem for first order formulas and its application to Gaifman's splitting theorem

The Journal of Symbolic Logic, Vol. 49, Iss. 4, 1984-12 ,pp. : 1262-1267

Cambridge University Press

Access to resources Recommend Favorite