Introduction

Abstract

Abstract This book is, to the best of my knowledge, the first monograph exclusively devoted to automated theorem proving in many-valued* logics. There are several books on automated theorem proving, for instance Chang and Lee (1973), Wos et al. (1984), Bibel (1987), Wos (1988), Fitting (1990b), and even more on many-valued logic† (Rosser and Turquette, 1952; Ackermann, 1967; Rescher, 1969; Dunn and Epstein, 1977; Gottwald, 1989; Bole and Borowik, 1992). There are also books on automated theorem proving in other non-classical logics, for example, Wallen (1990). In general, the interest in theorem proving in various non-classical logics, triggered mainly by new applications in computer science,‡ has grown vastly in the last ten years. One can easily find dozens of references on theorem proving in intuitionistic, modal, linear, conditional, non-monotonic and temporal logic, but not so on theorem proving in many-valued logic.