Subtractive logic

Theoretical Computer Science

Volumn 254, Issue 1-2, 2001, Pages 151-185

  Crolard, Tristan ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL LINGUISTICS; THEOREM PROVING;

SUBTRACTIVE LOGIC;

FORMAL LOGIC;

EID: 0034926402     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00124-3     Document Type: Article

References (23)

1. Equality between functionals in the presence of coproducts
2. Mathematical intuitionism - Introduction to proof theory
3. Contraction-free sequent calculi for intuitionistic logic
4. Declarative continuations: An investigation of duality in programming language semantics
5. A new constructive logic: Classical logic
6. On the unity of logic
7. Cartesian closed categories and lambda-calculus
8. An introduction to higher order categorical logic
9. Typed λ-calculi with explicit substitutions may not terminate
10. Model extension theorem and Graigs interpolation theorem for intermediate predicate logics
11. λμ-calculus: An algorithmic interpretation of classical natural deduction
12. Classical proofs as programs
13. Semi-boolean algebras and their applications to intuitionistic logic with dual operations
14. A categorical characterization of boolean algebras
15. Intuitionistic logic