On the Decision Problem for Formulas in which all Disjunctions are Binary
- 1 January 1971
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- 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
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are BinaryMathematical Logic Quarterly, 1967
- Turing machines with restricted memory accessInformation and Control, 1966
- 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
- Classification of $AEA$ formulas by letter atomsBulletin of the American Mathematical Society, 1962
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961