This paper extends our previous work in combining classical logic with intuitionistic logic [LM13a, LM13b] to also include affine linear logic (linear logic with weakening), resulting in a unified system that we call Affine Control Logic. The goal is to allow affine-linear extensions of the Curry-Howard isomorphism to be combined with the well known capabilities of classical λµ calculus. To this end linear logic is adjusted so that contraction is not enabled by the exponential? but by a restricted form of Peirce’s formula. This formula also has a dual, which replaces the role of! in cut elimination. Classical fragments of proofs are better isolated from non-classical fragments, thus allowing different logics to coexist without a collapse. W...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
Girard's recent system of linear logic is presented in a way that avoids the two-level structure of ...
AbstractIn this paper we (1) provide a natural deduction system for full first-order linear logic, (...
This paper extends our previous work in combining classical logic with intuitionistic logic [LM13a, ...
AbstractLight, elementary and soft linear logics are formal systems derived from Linear Logic, enjoy...
Light, elementary and soft linear logics are formal systems derived from Linear Logic, enjoying rema...
AbstractGirard described two translations of intuitionistic logic into linear logic, one where A → B...
Abstract. We give an analysis of various classical axioms and characterize a notion of minimal class...
Abstract. We give a Dialectica-style interpretation of first-order classical affine logic. By moving...
International audienceWe give an analysis of various classical axioms and characterize a notion of m...
Girard described two translations of intuitionistic logic into linear logic, one where A ! B maps t...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
AbstractThe propositional linear logic is known to be undecidable. In the current paper we prove tha...
We propose a notion of symmetric reduction for a system of proof nets for multiplicative Affine Logi...
International audienceWe show that control operators and other extensions of the Curry-Howard isomor...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
Girard's recent system of linear logic is presented in a way that avoids the two-level structure of ...
AbstractIn this paper we (1) provide a natural deduction system for full first-order linear logic, (...
This paper extends our previous work in combining classical logic with intuitionistic logic [LM13a, ...
AbstractLight, elementary and soft linear logics are formal systems derived from Linear Logic, enjoy...
Light, elementary and soft linear logics are formal systems derived from Linear Logic, enjoying rema...
AbstractGirard described two translations of intuitionistic logic into linear logic, one where A → B...
Abstract. We give an analysis of various classical axioms and characterize a notion of minimal class...
Abstract. We give a Dialectica-style interpretation of first-order classical affine logic. By moving...
International audienceWe give an analysis of various classical axioms and characterize a notion of m...
Girard described two translations of intuitionistic logic into linear logic, one where A ! B maps t...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
AbstractThe propositional linear logic is known to be undecidable. In the current paper we prove tha...
We propose a notion of symmetric reduction for a system of proof nets for multiplicative Affine Logi...
International audienceWe show that control operators and other extensions of the Curry-Howard isomor...
We reexamine the foundations of linear logic, developing a system of natural deduction following Mar...
Girard's recent system of linear logic is presented in a way that avoids the two-level structure of ...
AbstractIn this paper we (1) provide a natural deduction system for full first-order linear logic, (...