Results 1  10
of
17
Weak Typed Böhm Theorem on IMLL
 Annals of Pure and Applied Logic
, 2007
"... In the Böhm theorem workshop on Crete island, Zoran Petric called Statman’s “Typical Ambiguity theorem ” typed Böhm theorem. Moreover, he gave a new proof of the theorem based on settheoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In the Böhm theorem workshop on Crete island, Zoran Petric called Statman’s “Typical Ambiguity theorem ” typed Böhm theorem. Moreover, he gave a new proof of the theorem based on settheoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment of intuitionistic linear logic without the multiplicative unit 1 (for short IMLL) weak typed Böhm theorem holds. The system IMLL exactly corresponds to the linear lambda calculus without exponentials, additives and logical constants. The system IMLL also exactly corresponds to the free symmetric monoidal closed category without the unit object. As far as we know, our separation result is the first one with regard to these systems in a purely syntactical manner. 1
On Varieties of Closed Categories and Dependency of Diagrams of Canonical Maps ∗.
"... We present a series of diagrams Dn in Symmetric Monoidal Closed Categories such that there is infinitely many different varieties of SMCC (in the sense of universal algebra) defined by diagrams of this series as equations. Similar result will hold for weaker closed categories. We discuss the notion ..."
Abstract
 Add to MetaCart
(Show Context)
We present a series of diagrams Dn in Symmetric Monoidal Closed Categories such that there is infinitely many different varieties of SMCC (in the sense of universal algebra) defined by diagrams of this series as equations. Similar result will hold for weaker closed categories. We discuss the notion of dependency of diagrams in connection with this result. 1 Introduction. Canonical maps in closed categories may be seen as instances of morphisms of the free closed category generated by an infinite set of atoms. There exist many types of closed categories, for example Cartesian Closed Categories (CCC), Symmetric Monoidal Closed Categories (SMCC) etc. Closed
Coherent bicartesian and sesquicartesian categories
, 2006
"... Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the initial object with itself are the same. (Every ..."
Abstract
 Add to MetaCart
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the initial object with itself are the same. (Every
Bicartesian coherence revisited
, 2008
"... A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places, some formulations and proofs are here corrected, and matters are updated. The categories investigated in this paper fo ..."
Abstract
 Add to MetaCart
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places, some formulations and proofs are here corrected, and matters are updated. The categories investigated in this paper formalize equality of proofs in classical and intuitionistic conjunctivedisjunctive logic without distribution of conjunction over disjunction.
Identity of Proofs Based on Normalization and Generality
, 2003
"... Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, bas ..."
Abstract
 Add to MetaCart
(Show Context)
Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, based on reduction to cutfree form in sequent systems, but he also suggested understanding identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally the rules involved in them they yield the same premises and conclusions up to renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it did not fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to lowdimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic.
Identity of Proofs Based on Normalization and Generality
, 2002
"... Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, bas ..."
Abstract
 Add to MetaCart
(Show Context)
Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, based on reduction to cutfree form in sequent systems, but he also suggested to understand identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally the rules involved in them they yield the same premises and conclusions up to renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it didn’t fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to lowdimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic.
Identity of Proofs Based on Normalization and Generality
, 2002
"... Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, bas ..."
Abstract
 Add to MetaCart
(Show Context)
Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, based on reduction to cutfree form in sequent systems, but he also suggested to understand identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally the rules involved in them they yield the same premises and conclusions up to renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it didn’t fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to lowdimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic.
Identity of Proofs Based on Normalization and Generality
, 2003
"... Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, bas ..."
Abstract
 Add to MetaCart
(Show Context)
Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, based on reduction to cutfree form in sequent systems, but he also suggested to understand identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally the rules involved in them they yield the same premises and conclusions up to renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it did not fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to lowdimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic.
Identity of Proofs Based on Normalization and Generality
, 2002
"... Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, bas ..."
Abstract
 Add to MetaCart
(Show Context)
Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz’s, based on reduction to cutfree form in sequent systems, but he also suggested to understand identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally the rules involved in them they yield the same premises and conclusions up to renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it didn’t fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to lowdimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic.