Entry Constable:1993:CFB 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{Constable:1993:CFB,
author = "Robert L. Constable and Scott F. Smith",
title = "Computational foundations of basic recursive function
theory",
journal = j-THEOR-COMP-SCI,
volume = "121",
number = "1--2",
pages = "89--112",
day = "06",
month = dec,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:45 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=121&issue=1-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=1993&volume=121&issue=1-2&aid=1521",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church's thesis; computability; constructive type
theory; decidability; decidability concept; logical
foundations; recursion theory; recursive function;
recursive functions; type theory; unsolvability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- basic,
70(3)277,
77(3)267,
82(2)177,
109(1)3,
116(1)151,
125(2)315
- church,
135(2)423
- computability,
73(3)313,
77(3)221,
80(2)203,
82(1)1,
86(2)377,
94(1)101,
97(1)1,
100(2)267,
113(2)191,
116(2)317,
119(1)187,
119(1)z,
131(2)243,
132(1)113,
133(1)65,
134(2)537
- concept,
70(1)159,
77(3)267,
86(2)377,
87(1)189,
90(1)253,
100(1)157,
120(1)45,
120(2)197,
133(2)387
- constructive,
71(2)227,
71(2)z,
82(2)215,
90(1)253,
94(2)237,
102(2)215,
105(1)27,
110(2)249,
115(1)63,
121(1)59,
122(1)119,
122(1)137
- 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,
103(2)387,
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,
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
- foundation,
83(1)131,
90(2)433,
100(2)325,
111(1)253,
111(1)z,
135(1)67,
135(1)z
- logical,
71(2)227,
74(3)273,
80(2)263,
82(2)403,
85(1)75,
87(1)43,
90(1)61,
90(2)433,
92(2)291,
94(2)237,
94(2)311,
96(1)35,
96(1)73,
96(1)z,
97(1)143,
99(1)121,
103(1)143,
103(2)283,
104(1)89,
105(1)57,
106(1)3,
106(2)221,
107(1)145,
110(2)377,
111(1)59,
111(1)191,
111(1)211,
111(1)253,
114(1)3,
116(1)3,
116(1)33,
116(1)151,
118(2)99,
118(2)193,
119(1)145,
120(2)215,
122(1)119,
122(1)201,
126(1)97,
131(1)197,
132(1)37,
136(1)163
- recursion,
70(1)3,
72(2)265,
72(2)z,
76(1)53,
76(2)309,
78(1)159,
82(2)403,
86(1)35,
86(1)81,
90(1)127,
93(1)91,
115(1)151,
116(1)95,
121(1)59,
121(1)411,
124(2)273,
125(1)61,
135(2)171,
136(1)217,
136(1)243
- thesis,
70(1)151
- unsolvability,
100(2)267,
108(1)17