Preface |
|
xi | |
Introduction |
|
1 | (1) |
|
|
1 | (2) |
|
|
3 | (2) |
|
An introduction to cut elimination and adjointness |
|
|
5 | (12) |
|
|
5 | (1) |
|
|
6 | (2) |
|
Cut elimination and adjointness |
|
|
8 | (3) |
|
Sequent systems and natural deduction |
|
|
11 | (1) |
|
Four types of sequent rules |
|
|
12 | (3) |
|
|
15 | (2) |
|
|
17 | (36) |
|
|
17 | (1) |
|
Morphisms and naturalness |
|
|
18 | (1) |
|
Graphs, graph-morphisms and transformations |
|
|
19 | (3) |
|
Deductive systems, functors, natural transformations and categories |
|
|
22 | (2) |
|
Equivalence of categories |
|
|
24 | (2) |
|
|
26 | (3) |
|
|
29 | (2) |
|
Cut elimination in free categories |
|
|
31 | (5) |
|
Cut Disintegration in free categories |
|
|
32 | (2) |
|
Necessary conditions for Cut Disintegration in free categories |
|
|
34 | (1) |
|
Particular and Total Cut Elimination |
|
|
35 | (1) |
|
Representing deductive systems and categories (Stone, Cayley and Yoneda) |
|
|
36 | (17) |
|
|
38 | (1) |
|
From graphs to deductive systems |
|
|
39 | (1) |
|
From deductive systems to categories |
|
|
40 | (2) |
|
The image of left compositional lifting |
|
|
42 | (2) |
|
Left-cone and right-cone graphs |
|
|
44 | (2) |
|
Deductive systems and categories in an alternative vocabulary |
|
|
46 | (2) |
|
|
48 | (1) |
|
The Yoneda Lemma for deductive systems |
|
|
49 | (4) |
|
|
53 | (17) |
|
Free functions and free graph-morphisms |
|
|
53 | (4) |
|
|
57 | (3) |
|
Cut elimination with free functors |
|
|
60 | (3) |
|
Cut Disintegration with free functors |
|
|
60 | (1) |
|
Necessary conditions for Cut Disintegration with free functors |
|
|
61 | (2) |
|
|
63 | (7) |
|
The standard definition of function |
|
|
64 | (1) |
|
|
65 | (2) |
|
Cancellability of relations |
|
|
67 | (1) |
|
|
68 | (2) |
|
|
70 | (11) |
|
Antecedental and consequential transformations |
|
|
70 | (2) |
|
Formations, formators and natural formations |
|
|
72 | (2) |
|
|
74 | (1) |
|
|
75 | (3) |
|
Cut elimination with free natural transformations |
|
|
78 | (3) |
|
Cut Disintegration in free natural formations |
|
|
78 | (2) |
|
Necessary conditions for Cut Disintegration in free natural formations |
|
|
80 | (1) |
|
|
81 | (68) |
|
Definitions of adjunction |
|
|
81 | (12) |
|
Primitive notions in adjunction |
|
|
82 | (3) |
|
|
85 | (1) |
|
Rectangular | adjunction |
|
|
86 | (1) |
|
Rectangular \\ adjunction |
|
|
87 | (2) |
|
Rectangular // adjunction |
|
|
89 | (1) |
|
|
89 | (2) |
|
|
91 | (2) |
|
Junctions, junctors and adjunctions |
|
|
93 | (2) |
|
|
95 | (2) |
|
|
97 | (3) |
|
Cut elimination in free adjunctions |
|
|
100 | (12) |
|
Cut Disintegration in free adjunctions |
|
|
101 | (2) |
|
Necessary conditions for Cut Disintegration in free adjunctions |
|
|
103 | (1) |
|
|
104 | (1) |
|
|
105 | (3) |
|
Cut Disintegration with alternative notions of rectangular | adjunction |
|
|
108 | (4) |
|
Decidability in free adjunctions |
|
|
112 | (12) |
|
Decision problems in free adjunctions |
|
|
112 | (2) |
|
Free adjunctions between preorders |
|
|
114 | (2) |
|
The commuting problem in free adjunctions generated by arrowless graphs |
|
|
116 | (6) |
|
Decidability in free adjunctions generated by arbitrary graphs |
|
|
122 | (2) |
|
Rectangular \\ adjunctions |
|
|
124 | (5) |
|
Rectangular \\ junctions and adjunctions |
|
|
125 | (1) |
|
Cut elimination in free rectangular \\ adjunctions |
|
|
126 | (2) |
|
Decidability in free rectangular \\ adjunctions |
|
|
128 | (1) |
|
|
129 | (3) |
|
Triangular junctions and adjunctions |
|
|
129 | (1) |
|
Cut elimination in free triangular adjunctions |
|
|
130 | (1) |
|
Decidability in free triangular adjunctions |
|
|
131 | (1) |
|
Cut elimination with other notions of adjunction |
|
|
132 | (2) |
|
Model-theoretical normalization in adjunctions |
|
|
134 | (7) |
|
A simple decision procedure for commuting in adjunctions |
|
|
135 | (4) |
|
Normalizing via links and uniqueness of normal form |
|
|
139 | (2) |
|
The maximality of adjunction |
|
|
141 | (8) |
|
|
149 | (46) |
|
|
149 | (14) |
|
Standard definition of comonad |
|
|
149 | (3) |
|
|
152 | (1) |
|
Primitive notions in comonad |
|
|
153 | (2) |
|
|
155 | (2) |
|
|
157 | (2) |
|
|
159 | (2) |
|
The Eilenberg-Moore category |
|
|
161 | (2) |
|
Adjunction between adjunctions and comonads |
|
|
163 | (7) |
|
The comonad of an adjunction |
|
|
163 | (1) |
|
Reflections and coreflections in comonads |
|
|
164 | (2) |
|
The adjunctions involving the categories of adjunctions and comonads |
|
|
166 | (2) |
|
The category of resolutions |
|
|
168 | (2) |
|
Comonographs, comonofunctors and comonads |
|
|
170 | (3) |
|
|
173 | (1) |
|
|
174 | (1) |
|
|
175 | (2) |
|
Cut elimination in free comonads |
|
|
177 | (5) |
|
Cut Disintegration in free comonads |
|
|
178 | (2) |
|
Necessary conditions for Cut Disintegration in free comonads |
|
|
180 | (1) |
|
Cut Disintegration with alternative notions of comonad |
|
|
181 | (1) |
|
Decidability in free comonads |
|
|
182 | (7) |
|
Decision problems in free comonads |
|
|
182 | (1) |
|
Free comonads in preorders |
|
|
183 | (1) |
|
The commuting problem in free comonads generated by arrowless graphs |
|
|
184 | (3) |
|
Decidability in free comonads generated by arbitrary graphs |
|
|
187 | (2) |
|
Model-theoretical normalization in comonads |
|
|
189 | (3) |
|
The maximality of comonad |
|
|
192 | (3) |
|
|
195 | (24) |
|
Rectangular | categories with binary product |
|
|
195 | (5) |
|
Triangular categories with binary product |
|
|
200 | (1) |
|
Cut elimination in free triangular categories with binary product |
|
|
201 | (2) |
|
Decidability in free triangular categories with binary product |
|
|
203 | (5) |
|
Alternative formulations of rectangular | categories with binary product |
|
|
208 | (2) |
|
Cut elimination in free rectangular | categories with binary product |
|
|
210 | (3) |
|
|
213 | (2) |
|
Cut elimination in free cartesian categories |
|
|
215 | (2) |
|
Model-theoretical normalization in cartesian categories |
|
|
217 | (2) |
Conclusion |
|
219 | (2) |
References |
|
221 | (4) |
Index |
|
225 | |