Entry Pasztor:1986:SIC from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Pasztor:1986:SIC,
author = "A. Pasztor and R. Statman",
title = "Scott induction and closure under omega-sups",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "251--263",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Carnegie-Mellon Univ., Pitsburgh, PA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closure under omega-sups; computability; definability;
effectiveness; finite axiomatisation; formal languages;
LCF; logic of computable functions; logic of continuous
functionals; necessary condition; Scott induction;
sufficient condition",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
Related entries
- axiomatisation,
35(1)89
- closure,
35(2)313,
36(2)291,
39(2)281,
40(2)163,
40(2)257,
43(2)315,
46(2)141,
46(2)159,
47(2)159,
47(3)315,
48(2)145,
48(2)229,
49(1)1,
51(1)53,
51(3)281,
52(3)251,
52(3)281,
57(2)225,
58(1)325,
61(2)199,
61(2)283,
63(1)43
- computability,
38(1)17,
38(1)35,
42(2)123,
46(2)197,
47(3)263,
47(3)299,
51(3)255,
51(3)265,
63(3)239,
66(2)117,
67(1)87,
68(3)267
- computable,
39(2)225,
46(2)285,
47(2)131,
47(3)263,
47(3)299,
50(2)137,
51(1)177,
54(2)341,
65(1)85,
66(2)117
- condition,
35(2)215,
36(1)27,
39(2)309,
40(1)13,
40(2)301,
41(2)223,
43(1)11,
46(1)53,
48(1)1,
48(2)297,
52(3)269,
53(1)3,
53(2)169,
56(2)223,
56(3)321,
57(2)303,
58(1)81,
61(1)17,
61(2)137,
66(1)113,
66(2)157,
66(3)233,
66(3)341
- continuous,
35(2)345,
38(1)17,
43(1)59,
43(2)293,
48(2)229,
51(3)309,
63(2)185,
68(3)277,
68(3)303
- definability,
61(2)289
- functional,
39(2)239,
39(2)309,
41(2)271,
43(2)123,
46(1)13,
48(1)75,
54(1)103,
56(1)17,
59(1)3,
59(1)85,
59(1)157,
62(1)67,
63(3)253,
64(3)221,
66(1)27,
66(3)289,
68(1)105
- induction,
44(2)127,
51(1)129,
54(1)29,
59(3)317
- necessary,
36(1)27,
40(2)301,
43(1)11,
48(1)1,
48(2)297,
53(2)169,
56(2)223,
61(1)17,
66(1)113,
66(3)233,
66(3)341
- Scott,
41(1)95
- Statman, R.,
48(1)95,
66(1)99
- sufficient,
35(2)215,
36(1)27,
40(2)301,
41(2)223,
43(1)11,
48(1)1,
48(2)297,
53(2)169,
56(2)223,
57(2)303