Entry Nagaymam:1998:GTC from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Nagaymam:1998:GTC,
author = "M. Nagaymam and M. Okada",
title = "A graph-theoretic characterization theorem for
multiplicative fragment of noncommutative linear
logic",
journal = j-THEOR-COMP-SCI,
volume = "197",
number = "1--2",
pages = "246--??",
day = "15",
month = may,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed May 27 07:21:35 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4210 (Formal logic); C4240 (Programming
and algorithm theory)",
conflocation = "Tokyo, Japan; 28 March-2 April 1996",
conftitle = "Linear Logic '96 (papers in summary form only
received)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "commutative linear logic; cyclic linear logic; formal
logic; graph theory; graph-theoretic characterization
theorem; module cyclic shifts; multiplicative fragment;
noncommutative linear logic; plane Danos-Regnier graph;
proof net; stack-condition; theorem proving",
pubcountry = "Netherlands",
treatment = "G General Review",
xxnote = "Check page numbers: duplicate in adjacent entries",
}
Related entries
- C1230,
135(1)67,
137(1)3,
137(1)25,
137(1)53,
137(1)85,
137(1)159,
140(2)205,
140(2)231,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
141(1)151,
141(1)253,
142(2)141,
142(2)209,
142(2)229,
142(2)257,
142(2)299,
143(1)51,
148(1)141,
149(1)129,
150(1)161,
151(1)3,
151(1)37,
151(2)437,
151(2)487,
152(1)91,
152(2)219,
152(2)269,
154(2)183,
155(1)157,
155(2)365,
160(1)283,
160(1)321,
161(1)235,
163(1)161,
164(1)185,
164(1)253,
165(1)171,
166(1)221,
166(1)291,
167(1)47,
167(1)73,
167(1)95,
170(1)129,
170(1)209,
170(1)383,
171(1)3,
171(1)61,
171(1)111,
171(1)147,
171(1)221,
171(1)247,
171(1)281,
172(1)43,
173(2)311,
173(2)393,
173(2)485,
174(1)251,
175(1)75,
177(1)155,
177(1)183,
180(1)155,
182(1)183,
184(1)1,
184(1)105,
185(1)47,
185(1)63,
185(1)129,
185(1)159,
185(1)177,
185(1)191,
185(2)217,
185(2)277,
188(1)79,
189(1)109,
189(1)129,
192(1)77,
192(1)107,
192(2)259,
192(2)287,
192(2)315,
197(1)139,
197(1)245,
197(1)245-1,
197(1)247-2
- characterization,
138(2)391,
140(1)5,
142(1)89,
143(1)1,
146(1)5,
147(1)55,
148(1)33,
150(1)77,
154(1)67,
154(1)85,
154(2)247,
154(2)379,
156(1)289,
160(1)321,
162(1)5,
162(1)45,
163(1)245,
163(1)303,
164(1)287,
168(1)53,
169(2)185,
172(1)281,
175(2)239,
177(1)183,
179(1)301,
184(1)195,
186(1)1,
187(1)49,
189(1)1,
191(1)79,
191(1)117,
193(1)113,
195(2)227,
205(1)135,
205(1)195,
209(1)123,
215(1)31,
218(2)297,
219(1)319,
226(1)37
- commutative,
160(1)87,
161(1)157,
163(1)1,
172(1)273,
177(1)217,
184(1)61,
197(1)245,
197(1)248-1
- cyclic,
164(1)223,
175(1)93,
194(1)244-2,
197(1)242-1,
197(1)245,
197(1)245,
201(1)275
- fragment,
156(1)177,
176(1)159,
176(1)283,
183(2)187,
183(2)215,
197(1)242-1,
197(1)245,
197(1)245-2,
224(1)267
- graph-theoretic,
174(1)67
- module,
153(1)49,
153(1)245,
155(2)349,
159(2)143,
166(1)101,
172(1)135,
172(1)303,
173(2)485,
177(2)407,
187(1)49,
192(1)3,
192(2)201,
194(1)248-1,
194(1)z,
208(1)149
- multiplicative,
144(1)161,
176(1)159,
197(1)242-1,
197(1)245,
197(1)245,
197(1)247-2,
224(1)115
- noncommutative,
197(1)242-1
- Okada, M.,
197(1)246-2
- plane,
140(2)265,
145(1)241,
156(1)159,
157(1)129,
159(1)105,
172(1)175,
197(1)203
- proof,
135(1)67,
138(1)113,
138(2)243,
139(1)355,
140(1)95,
141(1)69,
150(1)161,
151(1)3,
151(2)487,
152(2)219,
153(1)49,
155(2)439,
165(1)3,
165(1)75,
165(1)171,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
169(1)3,
170(1)1,
170(1)129,
170(1)407,
173(2)311,
173(2)393,
175(1)29,
175(1)159,
176(1)159,
176(1)283,
177(2)487,
178(1)257,
179(1)103,
179(1)137,
179(1)333,
180(1)309,
180(1)371,
181(2)317,
183(2)253,
184(1)1,
185(2)319,
188(1)211,
189(1)71,
190(1)41,
191(1)37,
191(1)215,
193(1)53,
194(1)244-3,
194(1)247-2,
194(1)z,
197(1)242-3,
197(1)245-1,
197(1)245-2,
197(1)246-2,
197(1)247-2,
198(1)201,
206(1)257,
206(1)331,
206(1)353,
212(1)141,
215(1)329,
216(1)271,
216(1)395,
227(1)299,
227(1)333
- proving,
138(1)101,
138(1)169,
138(2)243,
139(1)355,
141(1)69,
142(2)209,
142(2)229,
142(2)257,
142(2)299,
145(1)111,
146(1)185,
146(1)199,
151(1)3,
151(2)487,
153(1)49,
154(1)3,
155(2)291,
155(2)439,
165(1)3,
165(1)57,
166(1)173,
166(1)291,
167(1)193,
169(1)3,
170(1)129,
170(1)245,
170(1)407,
172(1)1,
173(1)235,
173(1)283,
173(2)311,
173(2)393,
176(1)159,
177(1)183,
179(1)103,
180(1)371,
181(2)317,
183(2)187,
183(2)253,
189(1)71,
192(1)55,
194(1)244-3,
194(1)247-2,
197(1)245,
197(1)245-1,
197(1)247-2,
198(1)201,
206(1)163,
206(1)341,
208(1)149
- shift,
148(1)1,
158(1)81,
163(1)117,
168(2)461,
174(1)203,
226(1)61
- theoretic, graph-,
174(1)67