International audienceWe design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov's principle suited for predicate logic. At the computational level, the extraction of an existential witness out of a proof of its double negation is done by using a form of statically-bound exception mechanism, what can be seen as a direct-style variant of Friedman's A-translation
Double negations are easily recognised in both the so-called “negative literature” and the original ...
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer p...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...
International audienceWe design an intuitionistic predicate logic that supports a limited amount of ...
Intuitionistic first-order logic extended with a restricted form of Markov\u27s principle is constru...
We propose a very simple modification of Kreisel\u27s modified realizability in order to computation...
International audienceThe usual reading of logical implication A → B as " if A then B " fails in int...
AbstractWe consider the restriction of classical principles like Excluded Middle, Markov’s Principle...
Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we inve...
Constructive arithmetic, or the Markov arithmetic MA, is obtained from intuitionistic arithmetic HA ...
This paper compares the roles classical and intuitionistic logic play in restricting the free use of...
We propose the beginnings of an intuitionistic propopsitional dynamic logic, and describe several se...
We show that the so-called weak Markov's principle (WMP) which states that every pseudo-positive rea...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
We discuss the philosophical implications of formal results showing the con- sequences of ...
Double negations are easily recognised in both the so-called “negative literature” and the original ...
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer p...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...
International audienceWe design an intuitionistic predicate logic that supports a limited amount of ...
Intuitionistic first-order logic extended with a restricted form of Markov\u27s principle is constru...
We propose a very simple modification of Kreisel\u27s modified realizability in order to computation...
International audienceThe usual reading of logical implication A → B as " if A then B " fails in int...
AbstractWe consider the restriction of classical principles like Excluded Middle, Markov’s Principle...
Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we inve...
Constructive arithmetic, or the Markov arithmetic MA, is obtained from intuitionistic arithmetic HA ...
This paper compares the roles classical and intuitionistic logic play in restricting the free use of...
We propose the beginnings of an intuitionistic propopsitional dynamic logic, and describe several se...
We show that the so-called weak Markov's principle (WMP) which states that every pseudo-positive rea...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
We discuss the philosophical implications of formal results showing the con- sequences of ...
Double negations are easily recognised in both the so-called “negative literature” and the original ...
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer p...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...