Entry Okada:1998:PSH 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{Okada:1998:PSH,
author = "M. Okada",
title = "Phase semantics for high-order completeness,
cut-elimination and normalization proofs",
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 = "C4210 (Formal logic)",
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 = "completeness theorem; cut-elimination; formal logic;
high-order completeness; linear logic; logical systems;
monoid domain; normalization proofs; phase semantics;
proof-normalization theorem",
pubcountry = "Netherlands",
treatment = "G General Review",
xxnote = "Check page numbers: duplicate in adjacent entries",
}
Related entries
- completeness,
138(2)273,
139(1)27,
141(1)109,
143(1)149,
145(1)111,
146(1)243,
150(1)161,
151(1)3,
151(2)487,
152(1)139,
155(1)1,
160(1)241,
163(1)99,
164(1)141,
167(1)95,
170(1)173,
173(1)183,
175(1)29,
177(1)217,
183(2)187,
183(2)253,
185(2)393,
190(1)41,
195(1)61,
197(1)242-1,
197(1)243-1,
197(1)245-1,
215(1)349,
227(1)249
- cut-elimination,
197(1)248,
227(1)333
- domain,
151(1)163,
151(1)195,
151(1)257,
151(1)z,
152(1)67,
155(1)221,
155(1)267,
159(2)319,
159(2)355,
160(1)1,
162(2)225,
165(1)57,
166(1)49,
166(1)203,
170(1)349,
171(1)247,
172(1)1,
172(1)43,
173(1)113,
173(1)209,
175(1)3,
176(1)89,
177(1)111,
177(1)155,
179(1)203,
179(1)217,
179(1)319,
179(1)421,
187(1)203,
189(1)179,
193(1)1,
193(1)53,
193(1)113,
193(1)181,
196(1)395,
216(1)159,
219(1)19,
219(1)169,
222(1)153
- elimination, cut-,
197(1)248,
227(1)333
- high-order,
157(1)53
- logical,
137(1)3,
138(1)201,
141(1)283,
143(1)51,
148(1)67,
149(2)201,
152(1)91,
154(1)67,
163(1)99,
166(1)173,
171(1)61,
173(2)311,
174(1)231,
175(1)75,
175(1)z,
176(1)283,
183(2)187,
184(1)105,
184(1)237,
191(1)173,
194(1)247-1,
195(2)227
- monoid,
145(1)229,
146(1)321,
148(2)227,
150(1)77,
158(1)81,
163(1)55,
163(1)259,
168(1)105,
172(1)135,
174(1)67,
178(1)257,
183(1)45,
183(1)93,
191(1)117,
191(1)219,
194(1)57,
204(1)35,
204(1)131,
204(1)169,
208(1)3,
225(1)149
- normalization,
135(1)67,
142(2)299,
151(2)487,
165(1)75,
169(2)201,
170(1)173,
185(2)217,
206(1)353,
211(1)375,
222(1)187,
227(1)333
- Okada, M.,
197(1)246-1
- order, high-,
157(1)53
- phase,
147(1)19,
149(1)179,
197(1)243-1,
227(1)333
- 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-1,
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