Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Lógica algorítmica")

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

Author Country

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

Results 1 to 25 of 46

  • Page / 2
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

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

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

Logic of computation (Marktoberdorf, July 25 - August 6, 1995)Schwichtenberg, Helmut.NATO ASI series. Series F : computer and system sciences. 1997, issn 0258-1248, isbn 3-540-62963-7, VI, 394 p, isbn 3-540-62963-7Conference Proceedings

Verification in predicate logic with time : Algorithmic questionsSLISSENKO, Anatol.Lecture notes in computer science. 2005, pp 3-17, issn 0302-9743, isbn 3-540-28231-9, 15 p.Conference Paper

A labelled tableau calculus for nonmonotonic (cumulative) consequence relationsARTOSI, A; GOVERNATORI, G; ROTOLO, A et al.Lecture notes in computer science. 2000, pp 82-97, issn 0302-9743, isbn 3-540-67697-XConference Paper

Towards tableau-based decision procedures for non-well-founded fragments of Set TheoryPIAZZA, C; POLICRITI, A.Lecture notes in computer science. 2000, pp 368-382, issn 0302-9743, isbn 3-540-67697-XConference Paper

Proceedings/1st. Workshop on computer science logic, Karlsruhe, october 12-16, 1987BÖRGER, E; KLEINE BÜNING, H; RICHTER, M. M et al.Lecture notes in computer science. 1988, Num 329, issn 0302-9743, VI-346 pConference Proceedings

Games and full abstraction for FPCMCCUSKER, G.Information and computation (Print). 2000, Vol 160, Num 1-2, pp 1-61, issn 0890-5401Article

A finite equational axiomatization of the functional algebras for the lambda calculusSALIBRA, A; GOLDBLATT, R.Information and computation (Print). 1999, Vol 148, Num 1, pp 71-130, issn 0890-5401Article

A transformation system for concurrent processesDE FRANCESCO, N; SANTONE, A.Acta informatica. 1998, Vol 35, Num 12, pp 1037-1073, issn 0001-5903Article

Modeling adversaries in a logic for security protocol analysisHALPEM, Joseph Y; PUCELLA, Riccardo.Lecture notes in computer science. 2003, pp 115-132, issn 0302-9743, isbn 3-540-20693-0, 18 p.Conference Paper

  • Page / 2