54 search results - page 1 / 11 » Extracting Algorithms from Intuitionistic Proofs |
71
Voted
MLQ
1998
15 years 2 days ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
102
click to vote
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
90
Voted
TABLEAUX
1995
Springer
15 years 4 months ago
1995
Springer
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
126
Voted
TABLEAUX
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
103
click to vote
TLCA
1993
Springer
15 years 4 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...