Entry Oppen:1980:CCC from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Oppen:1980:CCC,
author = "D. C. Oppen",
title = "Complexity, convexity and combinations of theories",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "291--302",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinations; complexity; computability and
decidability; computational complexity; convexity;
decidable combinations; quantifier free theory;
satisfiability problem; theorem proving; theories",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- computability,
10(2)133,
11(3)331,
15(3)329,
16(1)5,
17(2)163,
17(2)193,
18(1)69,
18(3)279,
19(1)17,
19(1)29,
19(2)219,
19(3)231,
19(3)331,
21(2)119,
23(1)37,
23(1)49,
23(3)231,
23(3)333,
23(3)339,
24(3)301,
24(3)313,
25(2)171,
26(1)131,
26(1)233,
27(1)3,
27(1)39,
28(1)13,
31(1)101,
31(1)165,
32(1)173
- computational,
10(1)1,
10(1)53,
10(1)83,
10(2)171,
10(3)221,
11(1)1,
11(1)71,
11(1)93,
11(3)321,
12(1)97,
12(2)119,
12(2)161,
12(3)255,
13(3)271,
13(3)295,
14(1)1,
14(1)91,
14(3)227,
14(3)247,
14(3)289,
14(3)337,
15(1)77,
15(2)181,
15(2)201,
15(3)291,
15(3)321,
16(1)25,
16(1)99,
16(2)115,
16(3)279,
17(1)55,
17(2)213,
17(3)303,
18(1)95,
18(1)105,
18(3)259,
19(1)1,
19(1)17,
19(1)39,
19(2)161,
19(2)203,
19(3)337,
20(3)323,
21(1)1,
21(1)105,
21(2)179,
21(3)255,
22(1)19,
22(1)195,
22(3)285,
22(3)317,
23(2)171,
23(2)187,
23(3)333,
24(2)123,
24(3)221,
24(3)239,
24(3)279,
24(3)291,
25(2)95,
25(2)193,
26(1)197,
26(3)287,
26(3)327,
27(1)3,
27(3)241,
28(1)111,
28(1)135,
28(3)277,
29(1)123,
30(3)241,
30(3)319,
31(1)41,
31(1)101,
31(1)125,
31(1)175,
32(1)61,
32(1)77,
32(1)157,
32(1)173,
32(1)221,
32(3)227,
32(3)279,
33(1)117,
33(2)261,
33(2)305,
34(1)17,
34(1)83,
34(1)207,
34(3)337
- decidability,
10(2)133,
11(3)331,
15(3)329,
16(1)5,
17(1)99,
17(2)163,
17(2)193,
18(1)69,
18(3)279,
19(1)17,
19(1)29,
19(2)219,
19(3)231,
19(3)331,
21(2)119,
23(1)37,
23(1)49,
23(3)231,
23(3)333,
23(3)339,
24(3)301,
24(3)313,
25(2)171,
26(1)131,
26(1)233,
27(1)3,
27(1)39,
29(1)185,
31(1)165,
32(3)261,
32(3)297,
33(2)261,
34(3)255
- decidable,
15(3)329,
17(2)163,
17(2)193,
17(3)303,
18(1)69,
19(3)331,
21(2)119,
23(3)231,
24(3)301,
24(3)313,
26(1)233,
32(3)297
- free,
11(1)107,
11(2)123,
11(2)167,
12(2)127,
12(3)265,
12(3)325,
13(2)137,
16(1)25,
16(1)93,
17(3)343,
18(3)279,
23(1)83,
25(2)95,
28(3)329,
29(3)285,
30(1)133,
31(3)227,
32(1)61,
32(3)279
- proving,
12(1)61,
15(3)223,
18(3)227,
24(2)131,
30(1)1,
32(3)297,
33(2)175,
34(1)17
- quantifier,
11(2)123,
18(1)105,
21(3)269,
24(3)239,
30(3)319
- satisfiability,
21(2)179,
30(3)319
- theorem,
10(1)53,
10(3)317,
11(3)247,
11(3)277,
12(2)193,
15(2)159,
16(2)223,
17(3)279,
18(3)259,
18(3)333,
20(2)95,
20(3)265,
21(1)75,
22(1)1,
22(1)127,
23(1)1,
23(1)49,
23(1)91,
29(1)167,
31(1)41,
31(1)125,
32(1)47,
32(1)221,
32(3)297,
33(2)175,
34(1)3,
34(1)17