SCT 1984:
Zaborów, Poland
Klaus Bothe:
An algorithmic interface structure for pascal compilers.
1-6
Lothar Budach,
Bernd Graw:
Nonuniform complexity classes, decision graphs and homological properties of posets.
7-13
Hans-Dieter Burkhard:
On the control of concurrent systems by restrictions of the state behaviour.
14-23
Ryszard Danecki:
Nondeterministic Propositional Dynamic Logic with intersection is decidable.
34-53
Albert G. Dragálin:
Correctness of inconsistent theories with notions of feasibility.
58-79
Marek Ejsmont:
On the log-space reducibility among array languages /preliminary version/.
80-90
Zdzislaw Habasinski:
Model theory of propositional logics of programs, some open problems.
98-110
Jerzy W. Jaromczyk:
Some results on decision trees with relations to computational trees.
111-117
Robert Knast:
Propositional calculi of term satisfiability and process logics.
118-126
Ewa Orlowska:
A logic of indiscernibility relations.
177-186
Slavian Radev:
Extension of PDL and consequence relations.
251-264
Cecylia Rauszer:
An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic.
298-317
data released under the ODC-BY 1.0 license
