Natural deduction for three-valued regular logics
نویسندگان
چکیده
منابع مشابه
Yaroslav Petrukhin NATURAL DEDUCTION FOR THREE - VALUED REGULAR LOGICS
In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S. C. Kleene’s logics and two intermediate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. T...
متن کاملDeduction and Search Strategies for Regular Multiple-Valued Logics
The inference rule !-resolution was introduced in [27] as a technique for developing an SLD-style query answering procedure for the logic programming subset of annotated logic. The inference rule requires that the lattice of truth values be ordinary. In this paper, it is proved that all complete distributive lattices are ordinary. Properties of !-resolution in the general theorem proving settin...
متن کاملSystematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and norm...
متن کاملEfficient Deduction in Many-Valued Logics
This paper tries to identify the basic problems e.countered in automated theorem proving in many-valued logics and demonstrates to which extent they call be currently solved. To this end a .umber of recently developed techniques are reviewed. We list. tile avenues of research in manyvalued theorem proving that are in our eyes the most promising.
متن کاملNatural Deduction for Non-Classical Logics
We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large famili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2016
ISSN: 2300-9802,1425-3305
DOI: 10.12775/llp.2016.025