Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorithmic logic")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 69

  • Page / 3
Export

Selection :

  • and

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

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

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

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

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

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

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

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

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

  • Page / 3