1. Banachowski, L.: Investigations of properties of programs by means of the extended algorithmic logic. I (Ann. Soc. Math. Pol. Ser. IV) Fundam. Inform.I.1, 93–119 (1977)
2. Bibel, W.: Automated theorem proving, 2 revised edn. Braunschweig, Wiesbaden, Vieweg 1987. (Artificial intelligence) 17SBN 3-528-18520-1
3. Biela, A.: Program-substitution and admissibility of rules in algorithmic logic. Acta Inf.25, 439–473 (1988)
4. Biela, A.: Retrieval system and dynamic algorithm looking for axioms of notions defined by programs. Fundam. Informat. Ser. IV,19, (3–4) 275–301 (1993)
5. Blasius, K., Eisinger, N., Siekmann, J., Smolka, G., Herold, A., Walther, C.: The Markgraf Karl refutation procedure. Proc. IJCAI-81, pp. 511–518 (1981)