Entry Andreka:1982:CLRa 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{Andreka:1982:CLRa,
author = "H. Andreka and I. Nemeti and I. Sain",
title = "A complete logic for reasoning about programs via
nonstandard model theory. {I}",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "193--212",
month = feb,
year = "1982",
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 = "Math. Inst., Acad. of Sci., Budapest, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete logic; computability and decidability;
decidability; decidable proof concepts; dynamic logic;
formal logic; nonstandard model theory; programming
theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Andreka, H.,
17(3)259
- complete,
11(3)337,
12(1)19,
12(1)83,
12(3)325,
17(1)75,
17(3)259,
21(1)105,
21(3)281,
22(1)127,
24(3)291,
26(1)25,
26(1)105,
26(1)131,
27(1)127,
28(3)239,
32(3)249,
33(2)139,
33(2)305,
34(1)33,
34(3)343
- computability,
10(2)133,
11(3)331,
12(3)291,
15(3)329,
16(1)5,
17(2)163,
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
- concept,
18(1)41
- decidability,
10(2)133,
11(3)331,
12(3)291,
15(3)329,
16(1)5,
17(1)99,
17(2)163,
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,
12(3)291,
15(3)329,
17(2)163,
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
- dynamic,
12(1)61,
13(3)331,
14(1)113,
16(3)321,
17(3)259,
17(3)343,
18(3)301,
21(2)145,
21(2)179,
27(1)127,
27(1)197,
27(3)333
- model,
11(2)117,
16(2)199,
17(3)259,
20(1)3,
24(1)73,
24(2)123,
26(1)105,
26(1)149,
27(3)297,
27(3)333,
28(1)45,
28(1)171,
28(3)263,
29(3)309,
30(3)241,
32(1)121,
32(1)157,
33(1)3,
33(2)139,
33(2)195,
34(1)83,
34(3)343
- Nemeti, I.,
17(3)259,
17(3)343
- nonstandard,
17(3)259,
34(1)3
- program,
11(2)181,
12(1)1,
12(1)61,
13(1)3,
13(1)45,
13(2)175,
13(2)193,
13(3)239,
13(3)315,
15(1)1,
15(2)159,
15(3)223,
15(3)291,
16(2)149,
16(2)199,
16(2)223,
16(3)321,
17(1)55,
17(2)113,
17(2)163,
17(3)235,
17(3)259,
18(1)41,
18(2)149,
18(3)301,
19(2)203,
20(1)3,
20(2)95,
21(2)179,
21(2)231,
21(3)341,
22(1)135,
23(2)187,
24(1)35,
24(2)131,
24(3)221,
25(1)1,
25(2)193,
26(1)121,
27(1)127,
27(1)225,
27(3)297,
28(1)83,
28(1)111,
29(1)185,
30(1)1,
30(1)49,
30(2)139,
30(3)241,
31(1)13,
31(1)175,
33(1)65,
34(1)227
- proof,
11(3)341,
12(3)265,
14(1)113,
16(1)43,
17(3)259,
17(3)279,
22(1)135,
22(3)265,
24(2)131,
24(3)337,
29(3)309,
30(1)1,
31(1)13,
34(1)17,
34(1)33,
34(1)83
- reasoning,
17(3)259,
24(1)73
- Sain, I.,
17(3)259