ESTIMATIONS DE LA COMPLEXITE DES PROBLEMES ALGORITHMIQUES D'ANALYSE CONSTRUCTIVESHURYGIN VA.1977; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1977; VOL. 233; NO 6; PP. 1064-1067; BIBL. 10 REF.Article

COMPLETENESS IN CLASSICAL LOGIC OF COMPLEX ALGORITHMSRASIOWA H.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 488-503; BIBL. 14 REF.Conference Paper

AXIOMS OF ALGORITHMIC LOGIC UNIVOCALLY DETERMINE SEMANTICS OF PROGRAMSSALWICKI A.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 552-561; BIBL. 25 REF.Conference Paper

ALGORITHMIC LOGIC WITH NON-DETERMINISTIC PROGRAMSMIRKOWSKA SALWICKA G.1979; PRACE I.P.I. P.A.N.; POL; DA. 1979; NO 343; 18 P.; ABS. RUS/POL; BIBL. 13 REF.Serial Issue

THE REPRESENTATION THEOREM FOR ALGORITHMIC ALGEBRASMIRKOWSKA G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 300-310; BIBL. 10 REF.Conference Paper

DYNAMIC ALGEBRAS WHICH ARE NOT KRIPKE STRUCTURESREITERMAN J; TRNKOVA V.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 528-538; BIBL. 15 REF.Conference Paper

A CRITERION OF UNDECIDABILITY OF ALGORITHMIC THEORIESDANKO W.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 205-218; BIBL. 14 REF.Conference Paper

ON AXIOMATIZATION OF DETERMINISTIC PROPOSITIONAL DYNAMIC LOGICVALIEV MK.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 482-491; BIBL. 15 REF.Conference Paper

ON RELAXATION RULES IN ALGORITHMIC LOGICTRAKHTENBROT BA.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 453-462; BIBL. 6 REF.Conference Paper

ISSLEDOVANIYA PO KONSTRUKTIVNOJ MATEMATIKE I MATEMATICHESKOJ LOGIKE. VIII = RECHERCHES SUR LA MATHEMATIQUE CONSTRUCTIVE ET LA LOGIQUE MATHEMATIQUE. VIIIMATIYASEVICHA YU V ED; SLISENKO AO ED.1979; ZAP. NAUCH. SEMINAR. L.O.M.I.; SUN; DA. 1979; VOL. 88; 251 P.; ABS. ENG; BIBL. DISSEM.Serial Issue

Extending models of second order predicate logic to models of second order dependent type theoryGEUVERS, H.Lecture notes in computer science. 1997, pp 167-181, issn 0302-9743, isbn 3-540-63172-0Conference Paper

An algorithm to determine, for any prime p, a polynomial-sized horn sentence which expresses the cardinality is not pTULIPANI, S.The Journal of symbolic logic. 1985, Vol 50, Num 4, pp 1062-1064, issn 0022-4812Article

A simple ordinal recursive normalization of Gödel's TVODA, P. J.Lecture notes in computer science. 1998, pp 491-509, issn 0302-9743, isbn 3-540-64570-5Conference Paper

Une Théorie des Constructions Inductives = A Theory of Inductive ConstructionsWerner, Benjamin; Paulin-Mohring, Christine.1994, 151 p.Thesis

Program-substitution and admissibility of rules in algorithmicBIELA, A.Acta informatica. 1988, Vol 25, Num 4, pp 439-473, issn 0001-5903Article

SUR LA COMPLETUDE DE LA LOGIQUE ALGORITHMIQUETRAKHTENBROT BA.1979; KIBERNETIKA; UKR; DA. 1979; NO 2; PP. 6-11; ABS. ENG; BIBL. 7 REF.Article

ALGORITHMIC LOGIC.RASIOWA H.1977; PRACE C.O.P.A.N.; POLSKA; DA. 1977; NO 281; PP. 1-205; ABS. RUSSE POL.; BIBL. 5 P.Serial Issue

A different approach to deontic logic: deontic logic viewed as a variant of dynamic logicMEYER, J.-J. C.Notre Dame journal of formal logic. 1988, Vol 29, Num 1, pp 109-136, issn 0029-4527Article

A NOTE ON EQUIVALENCES AMONG LOGICS OF PROGRAMSMEYER AR; TIURYN J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 282-299; BIBL. 27 REF.Conference Paper

COMPLETE AXIOMATIZATION OF ALGORITHMIC PROPERTIES OF PROGRAM SCHEMES WITH BOUNDED NONDETERMINISTIC INTERPRETATIONSMIRKOWSKA G.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 14-21; BIBL. 11 REF.Conference Paper

THE ROLE OF FINITE AUTOMATA IN THE DEVELOPMENT OF MODERN COMPUTING THEORYCONSTABLE RL.1980; STUD. LOGIC FOUND. MATH.; NLD; DA. 1980; VOL. 101; PP. 61-83; BIBL. 3 P.Conference Paper

A FORMAL SYSTEM FOR PARALLEL PROGRAMS IN DISCRETE TIME AND SPACEKAWAI H.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 4-5; PP. 204-210; BIBL. 11 REF.Article

CONSTRUCTIVE METHODS IN PROGRAM VERIFICATION.WEGBREIT B.1977; I.E.E.E. TRANS. SOFTWARE ENGNG; U.S.A.; DA. 1977; VOL. 3; NO 3; PP. 193-209; BIBL. 17 REF.Article

LAR: A LOGIC OF ALGORITHMIC REASONING.KROEGER F.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 3; PP. 243-266; BIBL. 17 REF.Article

ON THE PROPOSITIONAL ALGORITHMIC LOGICMIRKOWSKA G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 381-389; BIBL. 9 REF.Conference Paper