The Inverse Method for Many-Valued Logics

Abstract

We define an automatic proof procedure for finitely manyvalued logics given by truth tables. The proof procedure is based on the inverse method. To define this procedure, we introduce so-called introduction-based sequent calculi. By studying proof-theoretic properties of these calculi we derive efficient validityand satisfiability-checking procedures based… (More)
DOI: 10.1007/978-3-642-45114-0_2

Topics

  • Presentations referencing similar topics