Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Completitud")

Filter

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

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 2026

  • Page / 82
Export

Selection :

  • and

The Power of Quantum Systems on a LineAHARONOV, Dorit; GOTTESMAN, Daniel; IRANI, Sandy et al.Communications in mathematical physics. 2009, Vol 287, Num 1, pp 41-65, issn 0010-3616, 25 p.Article

The natural topology of Matlis reflexive modulesBELSHOFF, R.Bulletin of the Australian Mathematical Society. 1993, Vol 47, Num 1, pp 149-154, issn 0004-9727Article

Loop formulas for disjunctive logic programsLEE, Joohyung; LIFSCHITZ, Vladimir.Lecture notes in computer science. 2003, pp 451-465, issn 0302-9743, isbn 3-540-20642-6, 15 p.Conference Paper

The first requirements elucidator demonstration (FRED) toolKASSER, Joseph E.Systems engineering. 2004, Vol 7, Num 3, pp 243-256, issn 1098-1241, 14 p.Article

A note on completeness of basic trigonometric system in L2SUSLOV, Sergei K.The Rocky Mountain journal of mathematics. 2003, Vol 33, Num 4, pp 1513-1524, issn 0035-7596, 12 p.Article

Some results on complete Lie superalgebrasLI YUN WANG; DAO JI MENG.Linear algebra and its applications. 2002, Vol 355, pp 1-14, issn 0024-3795Article

On rough sets under generalized equivalence relationsINUIGUCHI, Masahiro; TANINO, Tetsuzo.Lecture notes in computer science. 2001, pp 295-300, issn 0302-9743, isbn 3-540-43070-9Conference Paper

Un résultat de complétude pour les types ∀+ du système F = A completeness result for the ∀+ types of system FFARKH, S; NOUR, K.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 326, Num 3, pp 275-279, issn 0764-4442Article

Forward and backward simulations : II. Timing-based systemsLYNCH, N; VAANDRAGER, F.Information and computation (Print). 1996, Vol 128, Num 1, pp 1-25, issn 0890-5401Article

Weak completeness in E and E2JUEDES, D. W; LUTZ, J. H.Theoretical computer science. 1995, Vol 143, Num 1, pp 149-158, issn 0304-3975Article

Gentzen-type axiomatization for PALWALUKIEWICZ, I.Theoretical computer science. 1993, Vol 118, Num 1, pp 67-79, issn 0304-3975Conference Paper

A Study on Software Architecture EvaluationJEONG, Gu-Beom; KIM, Guk-Boh.Lecture notes in computer science. 2006, pp 1032-1041, issn 0302-9743, isbn 3-540-34070-X, 10 p.Conference Paper

Closing the gap between the stable semantics and extensions of WFSOSORIO, Mauricio; BORJA, Veronica; ARRAZOLA, Jose et al.Lecture notes in computer science. 2004, pp 202-211, issn 0302-9743, isbn 3-540-21459-3, 10 p.Conference Paper

Requirements completeness : Absolute or relative ?CARSON, Ronald S; SHELL, Tony.Systems engineering. 2001, Vol 4, Num 3, pp 230-231, issn 1098-1241Article

Partially additive categories and fully complete models of linear logicHAGHVERDI, Esfandiar.Lecture notes in computer science. 2001, pp 197-216, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Completeness of Lp spaces and Radon-Nikodym theorems for unbounded finitely additive measuresBELL, W. C; HAGOOD, J. W.Journal of mathematical analysis and applications. 1998, Vol 218, Num 1, pp 82-96, issn 0022-247XArticle

Complete codes in a sofic shiftBEAL, Marie-Pierre; PERRIN, Dominique.Lecture notes in computer science. 2006, pp 127-136, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 10 p.Conference Paper

Validation and reparation of knowledge basesDJELOUAH, R; DUVAL, B; LOISEAU, S et al.Lecture notes in computer science. 2002, pp 312-320, issn 0302-9743, isbn 3-540-43785-1, 9 p.Conference Paper

Fages' theorem for programs with nested expressionsERDEM, Esra; LIFSCHITZ, Vladimir.Lecture notes in computer science. 2001, pp 242-254, issn 0302-9743, isbn 3-540-42935-2Conference Paper

Some good dilutions of fuzzy compactnessBÜLBÜL, A; WARNER, M. W.Fuzzy sets and systems. 1992, Vol 51, Num 1, pp 111-115, issn 0165-0114Article

ACI-matrices all of whose completions have the same rankZEJUN HUANG; XINGZHI ZHAN.Linear algebra and its applications. 2011, Vol 434, Num 8, pp 1956-1967, issn 0024-3795, 12 p.Article

Completeness of temporal logics over infinite intervalsHANPIN WANG; QIWEN XU.Discrete applied mathematics. 2004, Vol 136, Num 1, pp 87-103, issn 0166-218X, 17 p.Article

Box constraint collections for adhoc constraintsCHI KAN CHENG; HO MAN LEE, Jimmy; STUCKEY, Peter J et al.Lecture notes in computer science. 2003, pp 214-228, issn 0302-9743, isbn 3-540-20202-1, 15 p.Conference Paper

From the necessity of film closure to inherent VR widenessZAGALO, Nelson; BRANCO, Vasco; BARKER, Anthony et al.Lecture notes in computer science. 2003, pp 74-77, issn 0302-9743, isbn 3-540-20535-7, 4 p.Conference Paper

Open mappings of probability measures and the skorokhod representation theoremBOGACHEV, V. I; KOLESNIKOV, A. V.Theory of probability and its applications. 2002, Vol 46, Num 1, pp 20-38, issn 0040-585XArticle

  • Page / 82