Entry Valiev:1993:USP 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{Valiev:1993:USP,
author = "M. K. Valiev",
title = "{$P^1_1$}-universality of some propositional logics of
concurrent programs",
journal = j-THEOR-COMP-SCI,
volume = "119",
number = "1",
pages = "223--232",
day = "11",
month = oct,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:36 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=119&issue=1;
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=119&issue=1&aid=1451",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6110P (Parallel
programming)",
conflocation = "Grenoble, France; Oct. 1991",
conftitle = "5th Soviet-French Symposium on Theoretical Computer
Science, Methods and Tools for Compilation, and Program
Development (Informatika'91)",
corpsource = "Inst. of Syst. Anal., Moscow, Russia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous programming constructs shuffle;
concurrent programs; formal logic; iterated shuffle;
parallel programming; partial commutativity; Pi /sub
1//sup 1/-universal; propositional dynamic logic;
propositional logics; validity problems",
pubcountry = "Netherlands",
treatment = "P Practical",
}
Related entries
- /sub,
80(1)35,
87(2)229,
123(2)315
- asynchronous,
74(2)121,
81(2)237,
85(1)155,
109(1)257,
128(1)3,
132(1)179,
135(2)289
- C6110P,
91(2)129,
91(2)181,
94(2)311,
96(1)73,
105(1)85,
112(1)5,
119(1)z,
120(1)123,
122(1)137,
124(1)41,
128(1)3,
131(1)139
- commutativity,
98(1)27,
101(2)337,
104(1)29,
112(1)53,
125(2)361
- concurrent,
72(2)265,
75(1)3,
75(1)15,
75(1)45,
75(1)67,
75(1)z,
76(2)179,
77(1)97,
79(2)275,
80(1)77,
80(2)263,
81(1)147,
85(2)333,
86(1)3,
86(1)z,
88(1)15,
90(1)127,
90(1)151,
90(1)171,
93(2)245,
94(2)311,
95(1)159,
96(1)73,
96(1)175,
96(2)285,
98(2)263,
101(2)223,
102(1)165,
105(1)85,
106(1)3,
109(1)225,
109(1)z,
111(1)3,
114(1)63,
114(1)119,
119(1)z,
122(1)137,
122(1)165,
123(2)415,
124(1)41,
124(2)195,
125(2)167,
135(1)5,
135(2)289
- construct,
99(1)105,
124(1)1,
136(1)57,
136(1)109
- dynamic,
72(2)97,
72(2)147,
72(2)z,
74(1)95,
76(1)115,
79(1)151,
79(2)341,
84(1)127,
87(1)43,
87(1)189,
89(1)161,
90(1)95,
90(2)355,
91(2)181,
92(1)49,
92(1)z,
92(2)291,
93(2)201,
94(1)141,
94(2)223,
94(2)335,
95(1)1,
97(1)1,
106(2)361,
110(1)215,
116(2)359,
119(1)63,
119(2)331,
124(1)127,
127(2)387,
128(1)179,
129(2)279,
129(2)397,
130(1)49,
130(1)203,
131(2)295,
133(2)205,
134(1)79,
136(1)217
- iterated,
101(1)143,
127(1)149,
132(1)113
- partial,
70(1)35,
70(1)65,
70(1)73,
70(2)193,
71(2)209,
71(3)281,
71(3)413,
74(1)37,
74(2)249,
75(1)45,
75(1)z,
75(3)223,
75(3)289,
77(1)27,
78(2)363,
79(2)295,
82(1)151,
83(1)29,
83(2)287,
87(1)81,
87(1)97,
87(1)115,
87(1)163,
87(2)347,
88(1)15,
88(1)151,
90(1)47,
90(1)61,
90(1)95,
92(2)227,
94(1)141,
97(1)67,
98(1)53,
98(2)347,
99(1)141,
101(2)265,
103(2)311,
105(2)217,
109(1)123,
109(1)181,
109(1)225,
112(1)5,
114(1)63,
114(2)201,
114(2)317,
115(1)77,
115(1)131,
116(1)151,
118(2)99,
119(2)267,
121(1)169,
121(1)351,
122(1)97,
124(1)1,
124(1)93,
124(1)127,
124(2)195,
126(2)143,
134(1)87,
135(2)405,
136(1)3,
136(1)109
- Pi,
114(2)231,
123(2)315
- propositional,
85(2)213,
87(1)189,
90(1)185,
90(1)235,
91(2)181,
93(1)159,
102(1)207,
114(2)231,
116(2)405,
118(1)67,
118(2)315,
119(1)z,
120(1)157,
129(1)95,
129(1)167,
131(1)197
- shuffle,
79(1)257,
96(2)405,
115(2)359
- universality,
126(2)183,
129(2)419
- validity,
83(1)97