Free deduction: An analysis of “computations” in classical logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 592 LNCS, Issue , 1992, Pages 361-380

  Parigot, Michel ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING;

CLASSICAL LOGIC; CUT-ELIMINATION PROCEDURE; DEDUCTION SYSTEMS; FUNCTIONAL LANGUAGES; INTUITIONISTIC LOGIC; NATURAL DEDUCTION; NON DETERMINISM; SEQUENT CALCULUS;

COMPUTER CIRCUITS;

EID: 85029753803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55460-2_27     Document Type: Conference Paper

References (4)

1. BARENDREGT, The lambda calculus, North-Holland, 1985.
2. GIRARD, Proof theory and logical complexity, Bibliopolis, 1987.
3. HOWARD, The formulae-as-types notion of construction, in “To HB Curry…", Academic Press, 1980.
4. PRAWITZ, Natural deduction, Almqvist & Wiksell, 1965.