APPROXIMATION PROPERTIES OF CONTINUOUS MACHINESKONIKOWSKA B.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 10; PP. 879-886; ABS. RUSSE; BIBL. 2 REF.Serial Issue

CONSTRAINED CONTINUOUS INFORMATION SYSTEMS.KONIKOWSKA B.1978; PRACE I.P.I.N. P.A.N.; POLSKA; DA. 1978; NO 316; PP. 1-36; ABS. RUSSE POL.; BIBL. 2 REF.Serial Issue

CONTINUOUS INFORMATION SYSTEMS.KONIKOWSKA B.1977; PRACE C.O. P.A.N.; POLSKA; DA. 1977; NO 273; PP. 1-35; ABS. RUSSE POL.; BIBL. 3 REF.Serial Issue

FORMALIZATION OF THE NOTION OF AN ANALOG COMPUTER DESCRIBED BY A LINEAR DIFFERENTIAL EQUATION WITH CONSTANT COEFFICIENTSKONIKOWSKA B.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTRO. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 12; PP. 1015-1020; ABS. RUSSE; BIBL. 2 REF.Serial Issue

A query language allowing conditions of relational type in queriesKONIKOWSKA, B.Information systems (Oxford). 1985, Vol 10, Num 1, pp 113-125, issn 0306-4379Article

Rasiowa-Sikorski deduction systems : A handy tool for computer science logicsKONIKOWSKA, B.Lecture notes in computer science. 1999, pp 183-197, issn 0302-9743, isbn 3-540-66246-4Conference Paper

Relative similarity logics are decidable : Reduction to FO²with equalityDEMRI, S; KONIKOWSKA, B.Lecture notes in computer science. 1998, pp 279-293, issn 0302-9743, isbn 3-540-65141-1Conference Paper