Add to ORKGAbstract. We show methods to construct, and give examples of, consistent intuitionistic theories that admit quantifier elimination. The examples are very intuitionistic in the sense that they prove the negation of the schema of linearity. 1
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is intr...
Based on an analysis of the inference rules used, we provide a complete characterization of the situ...
The purpose of this note is to clarify some syntactical matters in linear logic. We present a detail...
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theo...
Abstract. The minimal extension of intuitionistic propositional language is characterized, where pro...
AbstractIn this paper an alternative Skolemization method is introduced that, for a large class of f...
In this paper an alternative Skolemization method is introduced that for a large class of formulas i...
We present three different functional interpretations of intuitionisticlinear logic ILL and show how...
The present work contains an axiomatic treatment of some parts of the version of intuitionistic math...
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presente...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
The interplay of introduction and elimination rules for propositional connectives is often seen as s...
This thesis explores some properties of elementary intuitionistic theories. We focus on the followin...
Submitted to a Journal. Rapport interne.In this paper, in contrast with previous proof-theoretic stu...
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is intr...
Based on an analysis of the inference rules used, we provide a complete characterization of the situ...
The purpose of this note is to clarify some syntactical matters in linear logic. We present a detail...
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theo...
Abstract. The minimal extension of intuitionistic propositional language is characterized, where pro...
AbstractIn this paper an alternative Skolemization method is introduced that, for a large class of f...
In this paper an alternative Skolemization method is introduced that for a large class of formulas i...
We present three different functional interpretations of intuitionisticlinear logic ILL and show how...
The present work contains an axiomatic treatment of some parts of the version of intuitionistic math...
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presente...
AbstractAlgebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are ...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
The interplay of introduction and elimination rules for propositional connectives is often seen as s...
This thesis explores some properties of elementary intuitionistic theories. We focus on the followin...
Submitted to a Journal. Rapport interne.In this paper, in contrast with previous proof-theoretic stu...
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is intr...
Based on an analysis of the inference rules used, we provide a complete characterization of the situ...
The purpose of this note is to clarify some syntactical matters in linear logic. We present a detail...