Add to ORKGIn recent work, the authors introduced the notion of n-dimensional Boolean algebra and the corresponding propositional logic nCL. In this paper, we introduce a sequent calculus for nCL and we show its soundness and completeness.Comment: arXiv admin note: text overlap with arXiv:1806.0653
The primary objective of this paper, which is an addendum to the author’s [8], is to apply the gener...
Simple counting quantifiers that can be used to compare the number of role successors of an individu...
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers ...
We introduce Boolean-like algebras of dimension n (nBA s) having n constants e1, … , en, and an (n+ ...
AbstractWe extend the methodology in Baaz and Fermüller (1999) [5] to systematically construct analy...
We study fragments of first-order logic and of least fixed point logic thatallow only unary negation...
We define and study monadic BL-algebras as pair of BL-algebras one of which is a special case of rel...
We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequali...
The proof theory of many-valued systems has not been investigated to an extent comparable to the wor...
In this paper, we discuss that the logical results in Boolean algebra can equally be derived with or...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
Presented here are an algebra and a logic characterizing the complexity class NC1, which consists of...
We extend a methodology by Baaz and Fermüller to systematically construct analytic calculi for semi-...
International audienceThe preferential conditional logic PCL, introduced by Burgess, and its extensi...
As usual, the superintuitionistic (propositional) logics (that is, logics extending intuitionistic l...
The primary objective of this paper, which is an addendum to the author’s [8], is to apply the gener...
Simple counting quantifiers that can be used to compare the number of role successors of an individu...
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers ...
We introduce Boolean-like algebras of dimension n (nBA s) having n constants e1, … , en, and an (n+ ...
AbstractWe extend the methodology in Baaz and Fermüller (1999) [5] to systematically construct analy...
We study fragments of first-order logic and of least fixed point logic thatallow only unary negation...
We define and study monadic BL-algebras as pair of BL-algebras one of which is a special case of rel...
We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequali...
The proof theory of many-valued systems has not been investigated to an extent comparable to the wor...
In this paper, we discuss that the logical results in Boolean algebra can equally be derived with or...
AbstractThis article surveys the links between regular languages and the class NC1, showing their im...
Presented here are an algebra and a logic characterizing the complexity class NC1, which consists of...
We extend a methodology by Baaz and Fermüller to systematically construct analytic calculi for semi-...
International audienceThe preferential conditional logic PCL, introduced by Burgess, and its extensi...
As usual, the superintuitionistic (propositional) logics (that is, logics extending intuitionistic l...
The primary objective of this paper, which is an addendum to the author’s [8], is to apply the gener...
Simple counting quantifiers that can be used to compare the number of role successors of an individu...
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers ...