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

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

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

Stability and paradox in algorithmic logicAITKEN, Wayne; BARRETT, Jeffrey A.Journal of philosophical logic. 2007, Vol 36, Num 1, pp 61-95, issn 0022-3611, 35 p.Article

Hiérarchies de définissabilité logique au second ordre = Hierarchies for second-order logical definabilityDurand, Arnaud; Grandjean, E.1996, 101 p.Thesis

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

International Conference on Constraints in Computational LogicsJOUANNAUD, Jean-Pierre.Information and computation (Print). 1998, Vol 142, Num 1, issn 0890-5401, 126 p.Conference Proceedings

DEGREE OF RECURSIVE UNSOLVABILITY OF ALGORITHMIC LOGICKRECZMAR A.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 8; PP. 615-617; ABS. RUSSE; BIBL. 4 REF.Serial Issue

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGICCHLEBUS BS.1982; Z. MATH. LOGIK GRUNDL. MATH.; ISSN 0044-3050; DDR; DA. 1982; VOL. 28; NO 3; PP. 247-261; BIBL. 8 REF.Article

EXTENDED OMEGA ⁺-VALUED ALGORITHMIC LOGIC. A FORMALIZED THEORY OF PROGRAMS WITH RECURSIVE PROCEDURES.RASIOWA H.1974; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1974; VOL. 22; NO 6; PP. 605-610; BIBL. 15 REF.Article

THE SET OF ALL TAUTOLOGIES OF THE ZERO-ORDER ALGORITHMIC LOGIC IS DECIDABLEGRABOWSKI M.1972; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1972; VOL. 20; NO 7; PP. 575-581; ABS. RUSSE; BIBL. 4 REF.Serial Issue

Call-by-value solvabilityPAOLINI, L; RONCHI DELLA ROCCA, S.Informatique théorique et applications (Imprimé). 1999, Vol 33, Num 6, pp 507-534, issn 0988-3754Article

Some notes on the formal definition of streamsMALBASKI, D; IVETIC, D.Yugoslav journal of operations research. 1996, Vol 6, Num 2, pp 277-284, issn 0354-0243Conference Paper

Etude et implémentation d'un système de déduction pour logique algorithmique = Study and implementation of a deduction system for algorithmic logicGARCIA, F.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 1, pp 57-92, issn 0988-3754Article

Calcul de réécriture : fondements et applications = Rewriting calculus : foundations and applicationsCirstea, Horatiu; Kirchner, Claude.2000, 210 p.Thesis

Modular correctness proofs of behavioural implementationsBIDOIT, M; HENNICKER, R.Acta informatica. 1998, Vol 35, Num 11, pp 951-1005, issn 0001-5903Article

Recursive w-rule for proof systemsYOCCOZ, S.Information processing letters. 1989, Vol 31, Num 6, pp 291-294, issn 0020-0190Article

Langages reconnaissables de mots indexés par des ordinaux = Recognizable languages of words indexed by ordinalsBedon, Nicolas; Perrin, Dominique.1998, 157 p.Thesis

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

LICS 1996-Part 1Information and computation (Print). 2000, Vol 160, Num 1-2, issn 0890-5401, 189 p.Serial Issue

Modèles logiques pour le raisonnement sur les actions = Logical Models for Reasoning about ActionsCastilho, Marcos Alexandre; Farinas Del Cerro, Luis.1998, 127 p.Thesis

ON ALGORITHMIC LOGIC WITH PARTIAL OPERATIONSPETERMANN U.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 213-223; BIBL. 7 REF.Conference Paper

FORMALISMES LOGIQUES ET ALGORITHMIQUES POUR LE PROBLEME DE LA CONSTRUCTION DES PROGRAMMES REGULIERSNEPEJVODA NN.1981; PROGRAMMIROVANIE; SUN; DA. 1981; NO 6; PP. 3-14; BIBL. 10 REF.Article