Add to ORKGAbstract: A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledgerepresentation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.
In this article, a syntactical proof of decidability ofmonadic first-order logic (and of its complet...
A general class of labeled sequent calculi is investigated, and necessary and su cient conditions ar...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...
A uniform construction for sequent calculi for finite-valued first-order logics with distribution qu...
International audienceThe paper presents a method for transforming a given sound and complete n-sequ...
AbstractWe investigate the problem of finding optimal axiomatizations for operators and distribution...
The primary objective of this paper, which is an addendum to the author’s [8], is to apply the gener...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
The worst-case complexity of cut elimination in sequent calculi for first order based logics is inve...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
In this paper we define internal cut-free sequent calculi for any n-valued Lukasiewicz logic Ln. The...
25 pages, final version, accepted for publication at LMCS, special issue for CSL 2012International a...
Abstract. An approximate Herbrand theorem is established for first-order infinite-valued Łukasiewicz...
We present two deductively equivalent calculi for non-deterministicmany-valued logics. One is define...
The proof theory of many-valued systems has not been investigated to an extent comparable to the wor...
In this article, a syntactical proof of decidability ofmonadic first-order logic (and of its complet...
A general class of labeled sequent calculi is investigated, and necessary and su cient conditions ar...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...
A uniform construction for sequent calculi for finite-valued first-order logics with distribution qu...
International audienceThe paper presents a method for transforming a given sound and complete n-sequ...
AbstractWe investigate the problem of finding optimal axiomatizations for operators and distribution...
The primary objective of this paper, which is an addendum to the author’s [8], is to apply the gener...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
The worst-case complexity of cut elimination in sequent calculi for first order based logics is inve...
In this paper we present a method to reduce the decision problem of several infinite-valued proposit...
In this paper we define internal cut-free sequent calculi for any n-valued Lukasiewicz logic Ln. The...
25 pages, final version, accepted for publication at LMCS, special issue for CSL 2012International a...
Abstract. An approximate Herbrand theorem is established for first-order infinite-valued Łukasiewicz...
We present two deductively equivalent calculi for non-deterministicmany-valued logics. One is define...
The proof theory of many-valued systems has not been investigated to an extent comparable to the wor...
In this article, a syntactical proof of decidability ofmonadic first-order logic (and of its complet...
A general class of labeled sequent calculi is investigated, and necessary and su cient conditions ar...
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Ta...