Entry Mairson:1992:SPT from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Mairson:1992:SPT,
author = "Harry G. Mairson",
title = "A simple proof of a theorem of {Statman}",
journal = j-THEOR-COMP-SCI,
volume = "103",
number = "2",
pages = "387--394",
day = "14",
month = sep,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:16:41 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=103&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=103&issue=2&aid=1244",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Cambridge Res. Lab., Digital Equipment Corp., MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "beta eta-equality; coding; computational complexity;
decidability; deciding; first-order typable
lambda-terms; Henkin quantifier elimination procedure;
proof; theorem",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- beta,
88(1)171,
95(1)143,
107(2)253
- coding,
87(1)25,
94(2)295,
117(1)67,
121(1)59,
134(2)403
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- deciding,
71(2)265,
112(2)311,
123(2)183,
131(2)441
- elimination,
79(2)295,
91(2)265,
104(1)109,
114(2)317,
115(1)3,
119(1)173,
134(2)493
- first-order,
73(1)47,
85(2)213,
93(2)169,
94(1)63,
95(1)75,
96(1)249,
97(1)157,
100(1)45,
102(1)207,
104(1)109,
104(1)129,
105(1)57,
106(2)337,
108(1)83,
111(1)145,
111(1)211,
111(1)253,
112(1)99,
113(1)3,
118(2)167,
118(2)231,
120(1)69,
122(1)69,
123(1)31,
123(1)117,
124(2)221,
126(1)97,
127(1)1,
131(1)95,
133(2)307,
135(1)139
- lambda-terms,
121(1)71,
126(2)281,
129(1)39
- order, first-,
73(1)47,
85(2)213,
93(2)169,
94(1)63,
95(1)75,
96(1)249,
97(1)157,
100(1)45,
102(1)207,
104(1)109,
104(1)129,
105(1)57,
106(2)337,
108(1)83,
111(1)145,
111(1)211,
111(1)253,
112(1)99,
113(1)3,
118(2)167,
118(2)231,
120(1)69,
122(1)69,
123(1)31,
123(1)117,
124(2)221,
126(1)97,
127(1)1,
131(1)95,
133(2)307,
135(1)139
- procedure,
72(2)169,
72(2)265,
80(2)319,
81(2)169,
81(2)223,
82(1)19,
88(2)313,
91(2)265,
93(1)1,
95(1)97,
95(1)115,
97(1)67,
98(1)137,
102(1)1,
103(2)283,
104(2)207,
106(1)87,
107(2)209,
110(2)419,
112(1)145,
113(1)119,
115(1)3,
118(1)81,
119(1)173,
120(1)69,
123(1)55,
124(2)273,
128(1)179,
129(1)167,
133(2)267,
133(2)307
- quantifier,
81(2)223,
83(1)29,
97(2)233,
102(1)207,
107(1)145,
126(1)97
- simple,
70(2)179,
71(2)177,
71(2)193,
82(1)151,
86(1)35,
87(1)25,
87(1)81,
88(1)15,
89(1)33,
102(2)215,
102(2)283,
103(2)273,
112(2)215,
112(2)391,
114(2)317,
117(1)99,
119(2)293
- terms, lambda-,
121(1)71,
126(2)281,
129(1)39