Resolution and model building in the infinite-valued calculus of L̵ukasiewicz
- 1 June 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 200 (1-2) , 335-366
- https://doi.org/10.1016/s0304-3975(98)00012-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Optimal comparison strategies in Ulam's searching game with two errorsTheoretical Computer Science, 1997
- Exploiting data dependencies in many-valued logicsJournal of Applied Non-Classical Logics, 1996
- Logic of infinite quantum systemsInternational Journal of Theoretical Physics, 1993
- Satisfiability in many-valued sentential logic is NP-completeTheoretical Computer Science, 1987
- The decision problem for formulas in prenex conjunctive normal form with binary disjunctionsThe Journal of Symbolic Logic, 1970
- Fragments of many-valued statement calculiTransactions of the American Mathematical Society, 1958
- A theorem about infinite-valued sentential logicThe Journal of Symbolic Logic, 1951