What is the problem with proof nets for classical logic?

Authors:
Lutz Straßburger
Affiliations:
INRIA Saclay, Île-de-France and LIX, École Polytechnique
Venue:
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Year:
2010

Citing 12
Cited 0

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Proofs and types

Proofs and types
On Matrices with Connections

Journal of the ACM (JACM)
Polarized proof-nets and λµ-calculus

Theoretical Computer Science
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Local System for Classical Logic

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Non-commutativity and MELL in the Calculus of Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Control categories and duality: on the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science
Classical logic, continuation semantics and abstract machines

Journal of Functional Programming
Constructing Free Boolean Categories

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Refutations by Matings

IEEE Transactions on Computers
Naming proofs in classical propositional logic

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatisfactory.