Canonical inference rules and canonical systems are defined in the frameworkof non-strict single-conclusion sequent systems, in which the succeedents ofsequents can be empty. Important properties of this framework are investigated,and a general non-deterministic Kripke-style semantics is provided. Thisgeneral semantics is then used to provide a constructive (and very natural),sufficient and necessary coherence criterion for the validity of the strongcut-elimination theorem in such a system. These results suggest new syntacticand semantic characterizations of basic constructive connectives
Abstract. In usual proof systems, like the sequent calculus, only a very limited way of combining pr...
"Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate ...
Abstract. Completion is a general paradigm for applying inferences to generate a canonical presentat...
Abstract. Canonical propositional Gentzen-type systems are systems which in addition to the standard...
\u3cp\u3eWe develop a general method for deriving natural deduction rules from the truth table for a...
Abstract. An (n, k)-ary quantifier is a generalized logical connective, binding k variables and conn...
The goal of this article is to design a uniform proof-theoretical framework encompassing classical, ...
We define the notion of a canonical Gödel sys-tem in the framework of single-conclusion hyper-sequen...
Abstract. Canonical propositional Gentzen-type calculi are a natural class of systems which in addit...
Propositional canonical Gentzen-type systems, introduced in 2001 by Avron andLev, are systems which ...
We present our calculus of higher-level rules, extended with propositional quantification within rul...
This paper considers Kripke completeness of Nelson’s constructive predicate logic N3 and its several...
In this work, we show that both logic programming and abstract argumentation frameworks can be inter...
We propose a new approach to formalize alternating pushdown systems as natural-deduction style infe...
International audienceTwo main lines have been adopted to prove the cut elimination theorem: the syn...
Abstract. In usual proof systems, like the sequent calculus, only a very limited way of combining pr...
"Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate ...
Abstract. Completion is a general paradigm for applying inferences to generate a canonical presentat...
Abstract. Canonical propositional Gentzen-type systems are systems which in addition to the standard...
\u3cp\u3eWe develop a general method for deriving natural deduction rules from the truth table for a...
Abstract. An (n, k)-ary quantifier is a generalized logical connective, binding k variables and conn...
The goal of this article is to design a uniform proof-theoretical framework encompassing classical, ...
We define the notion of a canonical Gödel sys-tem in the framework of single-conclusion hyper-sequen...
Abstract. Canonical propositional Gentzen-type calculi are a natural class of systems which in addit...
Propositional canonical Gentzen-type systems, introduced in 2001 by Avron andLev, are systems which ...
We present our calculus of higher-level rules, extended with propositional quantification within rul...
This paper considers Kripke completeness of Nelson’s constructive predicate logic N3 and its several...
In this work, we show that both logic programming and abstract argumentation frameworks can be inter...
We propose a new approach to formalize alternating pushdown systems as natural-deduction style infe...
International audienceTwo main lines have been adopted to prove the cut elimination theorem: the syn...
Abstract. In usual proof systems, like the sequent calculus, only a very limited way of combining pr...
"Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate ...
Abstract. Completion is a general paradigm for applying inferences to generate a canonical presentat...