Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Démonstration théorème")

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 2797

  • Page / 112

Export

Selection :

  • and

A theoretical analysis of hierarchical proofsCAIRNS, Paul; GOW, Jeremy.Lecture notes in computer science. 2003, pp 175-187, issn 0302-9743, isbn 3-540-00568-4, 13 p.Conference Paper

XBarnacle : Making theorem provers more accessibleLOWE, H; DUNCAN, D.Lecture notes in computer science. 1997, pp 404-407, issn 0302-9743, isbn 3-540-63104-6Conference Paper

Comparing mathematical proversWIEDIJK, Freek.Lecture notes in computer science. 2003, pp 188-202, issn 0302-9743, isbn 3-540-00568-4, 15 p.Conference Paper

Completeness results of inequality proversBLEDSOE, W. W; KUNEN, K; SHOSTAK, R et al.Artificial intelligence. 1985, Vol 27, Num 3, pp 255-288, issn 0004-3702Article

Persuader de son savoir sans le transmettre = To persuade one's knowledge without transmitting itDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2011, Num 399, pp 88-93, issn 0153-4092, 6 p.Article

Constrained hyper tableauxVAN EIJCK, Jan.Lecture notes in computer science. 2001, pp 232-246, issn 0302-9743, isbn 3-540-42554-3Conference Paper

Randomness-optimal characterization of two NP proof systemsDE SANTISL, Alfredo; DI CRESCENZO, Giovanni; PERSIANO, Giuseppe et al.Lecture notes in computer science. 2002, pp 179-193, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

View from the fringe of the fringe (Extended Summary)JOHNSON, Steven D.Lecture notes in computer science. 2001, pp 1-12, issn 0302-9743, isbn 3-540-42541-1Conference Paper

On a theorem of Carey and PincusHOWLAND, J. S.Journal of mathematical analysis and applications. 1990, Vol 145, Num 2, pp 562-565, issn 0022-247X, 4 p.Article

Generalization in type theory based proof assistantsPONS, Olivier.Lecture notes in computer science. 2002, pp 217-232, issn 0302-9743, isbn 3-540-43287-6Conference Paper

Focus windows: A new technique for proof presentationPIROI, Florina; BUCHBERGER, Bruno.Lecture notes in computer science. 2002, pp 337-341, issn 0302-9743, isbn 3-540-43865-3, 5 p.Conference Paper

Towards limit computable mathematicsHAYASHI, Susumu; NAKATA, Masahiro.Lecture notes in computer science. 2002, pp 125-144, issn 0302-9743, isbn 3-540-43287-6Conference Paper

Mizar light for HOL lightWIEDIJK, Freek.Lecture notes in computer science. 2001, pp 378-393, issn 0302-9743, isbn 3-540-42525-XConference Paper

On terminating Lemma speculationsWALTHER, Christoph; KOLBE, Thomas.Information and computation (Print). 2000, Vol 162, Num 1-2, pp 96-116, issn 0890-5401Article

An algorithm for testing Leopoldt's conjectureBUCHMANN, J; SANDS, J. W.Journal of number theory (Print). 1987, Vol 27, Num 1, pp 92-105, issn 0022-314XArticle

Le théorème de Quillen, d'adjonction des foncteurs dérivés, revisité = Quillen's adjunction theorem for derived functors revisitedMALTSINIOTIS, Georges.Comptes rendus. Mathématique. 2007, Vol 344, Num 9, pp 549-552, issn 1631-073X, 4 p.Article

The seventeen provers of the worldWiedijk, Freek.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-30704-4, 1Vol, XVI-157 p, isbn 3-540-30704-4Book

Verification of executable pipelined machines with bit-level interfacesMANOLIOS, Panagiotis; SRINIVASAN, Sudarshan K.IEEE/ACM International Conference on Computer-Aided Design. 2005, pp 855-862, isbn 0-7803-9254-X, 1Vol, 8 p.Conference Paper

TPHOLS 2004 : theorem proving in higher order logics (Park City UT, 14-17 September 2004)Slind, Konrad; Bunker, Annette; Gopalakrishnan, Ganesh et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23017-3, VIII, 336 p, isbn 3-540-23017-3Conference Proceedings

Local simplificationLYNCH, C.Information and computation (Print). 1998, Vol 142, Num 1, pp 102-126, issn 0890-5401Conference Paper

A new proof of a theorem of Green, Happel and ZachariaGAUVREAU, C.Annales des sciences mathématiques du Québec. 1997, Vol 21, Num 1, pp 83-89, issn 0707-9109Article

Paramodulation, superposition, and simplificationBACHMAIR, L.Lecture notes in computer science. 1997, pp 1-3, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Rough and modal algebrasVIGNERON, L; WASILEWSKA, A.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 1107-1112, isbn 2-9502908-5-X, 2VolConference Paper

Une preuve simple de résultats classiques en λ calcul = A simple proof of basic results in λ calculusDAVID, R.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 320, Num 11, pp 1401-1406, issn 0764-4442Article

The extension to root systems of a theorem on tournamentsCALDERBANK, A. R; HANLON, P.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 2, pp 228-245, issn 0097-3165Article

  • Page / 112