Entry Borger:1980:RPP 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{Borger:1980:RPP,
author = "E. Borger and H. {Kleine Buning}",
title = "The reachability problem for {Petri} nets and decision
problems for {Skolem} arithmetic",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "123--143",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Jul 20 12:57:21 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Lehrstuhl Informatik II, Univ. Dortmund, Dortmund,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary disjunctions; decision problems; formal logic;
graph theory; Horn formulae; monadic predicate symbols;
Petri nets; prenex conjunctive normal form; quantifier
free matrix; reachability problem; Skolem arithmetic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- arithmetic,
12(1)97,
18(1)105,
19(1)17,
22(3)265,
24(1)35,
29(1)49,
31(1)125
- binary,
10(1)63,
14(1)79,
16(2)187,
19(3)337,
22(3)253,
22(3)331,
23(3)333,
27(3)255,
29(1)49,
31(1)125,
32(1)121,
32(3)227,
33(2)327
- C1160,
11(1)39,
11(1)93,
11(2)117,
11(3)247,
12(1)83,
13(2)137,
13(3)315,
14(1)103,
15(1)1,
15(2)159,
15(3)321,
16(1)5,
17(1)29,
17(1)75,
17(1)91,
17(1)103,
17(2)151,
17(2)217,
18(1)89,
18(2)115,
18(3)259,
19(1)1,
19(1)17,
19(1)29,
19(1)69,
19(2)189,
21(1)55,
21(1)91,
21(1)99,
22(3)233,
22(3)253,
22(3)331,
23(1)37,
23(1)83,
23(2)129,
23(2)211,
23(3)231,
23(3)243,
23(3)273,
24(2)143,
24(2)161,
25(2)95,
25(3)311,
28(1)171,
29(1)49,
29(1)75,
29(3)251,
30(3)241,
31(1)31,
31(1)61,
31(1)73,
31(3)307,
32(1)1,
32(1)87,
32(1)121,
32(1)173,
32(1)185,
32(1)215,
32(3)227,
32(3)309,
33(2)239,
34(1)3,
34(1)17,
34(1)33,
34(1)83,
34(1)169,
34(3)275,
34(3)337,
34(3)343
- conjunctive,
26(3)287
- decision,
11(1)71,
17(2)213,
19(3)321,
23(1)49,
23(3)333,
24(3)301,
24(3)313,
26(1)83,
27(1)3,
27(3)333,
29(1)185,
31(1)1,
32(1)173,
32(3)279,
32(3)297,
33(2)305
- form,
12(2)135,
14(2)155,
14(3)267,
17(1)1,
17(1)29,
17(1)43,
17(1)103,
18(1)69,
19(1)39,
21(2)163,
26(3)243,
26(3)301,
28(3)299,
28(3)315,
29(1)41,
32(3)261,
33(1)13,
33(1)z,
33(2)175
- formulae,
21(3)269
- free,
11(1)107,
11(2)167,
12(2)127,
12(3)265,
12(3)291,
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
- Horn,
28(1)13,
34(1)227
- matrix,
11(3)341,
17(1)99,
19(1)39,
21(2)213,
22(1)95,
22(3)317,
23(1)95,
23(2)171,
28(3)287,
31(1)125,
31(3)227,
33(1)117
- monadic,
18(3)325,
19(3)231,
25(2)171,
27(1)3,
33(2)261
- net,
13(1)85,
13(1)109,
14(3)317,
15(1)51,
23(2)107,
23(3)243,
25(3)221,
25(3)311,
26(3)301,
27(1)85,
28(1)171,
29(1)87,
30(3)241,
31(3)307,
32(1)173
- normal,
14(2)155,
17(1)43,
26(3)243,
26(3)301,
28(3)299,
28(3)315,
31(3)307,
32(3)279,
33(2)175
- Petri,
13(1)85,
13(1)109,
14(3)317,
15(1)51,
21(3)315,
23(2)107,
23(3)243,
25(3)221,
25(3)311,
26(3)301,
27(1)85,
28(1)171,
30(3)241,
31(3)307,
32(1)173
- predicate,
13(3)239,
18(3)227,
21(3)255,
28(3)239,
30(3)319,
32(3)297
- prenex,
28(3)315
- quantifier,
12(3)291,
18(1)105,
21(3)269,
24(3)239,
30(3)319
- reachability,
18(3)227
- Skolem,
17(1)99,
28(3)239
- symbol,
14(3)267,
18(1)33,
20(1)3,
22(3)253,
23(1)103,
31(1)1,
32(1)121,
32(3)321