Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
- 1 March 1974
- journal article
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 16 (1-2), 67-84
- https://doi.org/10.1007/bf02025119
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On the Decision Problem for Formulas in which all Disjunctions are BinaryPublished by Elsevier ,1971
- The decision problem for formulas in prenex conjunctive normal form with binary disjunctionsThe Journal of Symbolic Logic, 1970
- The Decision Problem for Segregated Formulas in First-Order Logic.MATHEMATICA SCANDINAVICA, 1967
- A property of sentences that define quasi-order.Notre Dame Journal of Formal Logic, 1966
- An improved prenex normal form1The Journal of Symbolic Logic, 1962
- Turing-machines and the EntscheidungsproblemMathematische Annalen, 1962
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASEProceedings of the National Academy of Sciences, 1962
- Some theorems on definability and decidabilityThe Journal of Symbolic Logic, 1952
- On the reduction of the decision problemThe Journal of Symbolic Logic, 1947
- On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicateThe Journal of Symbolic Logic, 1939