Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Completeness")

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

Origin

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

Results 1 to 25 of 20213

  • Page / 809
Export

Selection :

  • and

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

THE PSPACE-COMPLETENESS OF BLACK-WHITE PEBBLING : Foundations of Computer ScienceHERTEL, Philipp; PITASSI, Toniann.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2622-2682, issn 0097-5397, 61 p.Article

Complete and directed complete Ω-categoriesHONGLIANG LAI; DEXUE ZHANG.Theoretical computer science. 2007, Vol 388, Num 1-3, pp 1-25, issn 0304-3975, 25 p.Article

An assertion concerning functionally complete algebras and NP-completenessHORVATH, Gabor; NEHANIV, Chrystopher L; SZABO, Csaba et al.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 591-595, issn 0304-3975, 5 p.Article

A generic complete dynamic logic for reasoning about purity and effectsMOSSAKOWSKI, Till; SCHRÖDER, Lutz; GONCHAROV, Sergey et al.Formal aspects of computing. 2010, Vol 22, Num 3-4, pp 363-384, issn 0934-5043, 22 p.Article

On certain Riesz families in vector-valued de Branges-Rovnyak spacesCHEVROT, Nicolas; FRICAIN, Emmanuel; TIMOTIN, Dan et al.Journal of mathematical analysis and applications. 2009, Vol 355, Num 1, pp 110-125, issn 0022-247X, 16 p.Article

On the completeness of modular proof systemsRAMESH, S.Information processing letters. 1990, Vol 36, Num 4, pp 195-201, issn 0020-0190, 7 p.Article

A new complete language for DSPACE(log n)JIAN-ER CHEN.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 19-26, issn 0166-218X, 8 p.Article

Capture-avoiding substitution as a nominal algebraGABBAY, Murdoch J; MATHIJSSEN, Aad.Formal aspects of computing. 2008, Vol 20, Num 4-5, pp 451-479, issn 0934-5043, 29 p.Article

Seismicity assessment using earthquake catalogues with uncertain and incomplete data: probabilistic formulationALAMILLA, Jorge Luis; VAI, Rossana; ESTEVA, Luis et al.Journal of seismology. 2014, Vol 18, Num 4, pp 715-729, issn 1383-4649, 15 p.Article

Completitud y continuidad en Fundamentos de la geometría de Hilbert: acerca del Vollständigkeitsaxiom = Completeness and Continuity in Hilbert's Foundations of Geometry: on the VollständigkeitsaxiomGIOVANNINI, Eduardo N.Theoria (Madrid). 2013, Vol 28, Num 76, pp 139-163, issn 0495-4548, 25 p.Article

Equivalence of completeness and contraction propertyXIANG, Shu-Wen.Proceedings of the American Mathematical Society. 2007, Vol 135, Num 4, pp 1051-1058, issn 0002-9939, 8 p.Article

On instance-completeness for database query languages involving object creationANDRIES, M; PAREDAENS, J.Journal of computer and system sciences (Print). 1996, Vol 52, Num 2, pp 357-373, issn 0022-0000Article

The simultaneous consecutive ones problemOSWALD, Marcus; REINELT, Gerhard.Theoretical computer science. 2009, Vol 410, Num 21-23, pp 1986-1992, issn 0304-3975, 7 p.Article

Fixed point theorems for a broad class of multimapsNAIDU, S. V. R.Nonlinear analysis. 2003, Vol 52, Num 3, pp 961-969, issn 0362-546X, 9 p.Article

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

Predication and Deduction in Aristotle : Aspirations to CompletenessSMITH, R.Topoi. 1991, Vol 10, Num 1, pp 43-52, issn 0167-7411Article

Preemptive multiprocessor task scheduling to minimize the sum of completion timesMALAFIEJSKI, Michal; KUSZNER, Lukasz; PIWAKOWSKI, Konrad et al.ACS'2002 : advanced computer systems. International multi conference. 2002, isbn 83-87362-46-8, 2Vol, Part 1, 189-196Conference Paper

Circumscription : completeness reviewedJAEGER, M.Artificial intelligence. 1993, Vol 60, Num 2, pp 293-301, issn 0004-3702Article

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

Complete proof rules for strong fairness and strong extreme fairnessMAIN, M. G.Theoretical computer science. 1993, Vol 111, Num 1-2, pp 125-143, issn 0304-3975Conference Paper

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

Certain NP-complete matching problemsLOIZOU, G.Information sciences. 1984, Vol 32, Num 2, pp 117-121, issn 0020-0255Article

On the completeness of the Papkovich-Neuber solutionTON TRAN-CONG.Quarterly of applied mathematics. 1989, Vol 47, Num 4, pp 645-659, issn 0033-569X, 15 p.Article

On Permutation in Simplified SemanticsRESTALL, Greg; ROY, Tony.Journal of philosophical logic. 2009, Vol 38, Num 3, pp 333-341, issn 0022-3611, 9 p.Article

  • Page / 809