kw.\*:("LANGAGE ORDRE 1")
Results 1 to 25 of 129
Selection :
THE UNWIND PROPERTY IN CERTAIN ALGEBRASURZYCZYN P.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 50; NO 2; PP. 91-109; BIBL. 11 REF.Article
A SEQUENT CALCULUS FOR KROEGER LOGICSZABO ME.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 295-303; BIBL. 9 REF.Conference Paper
DATA BASES: A LOGICAL PERSPECTIVEREITER R.1981; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1981; VOL. 16; NO 1; PP. 174-176; BIBL. 7 REF.Conference Paper
DEFINABILITY BY PROGRAMS IN FIRST-ORDER STRUCTURESKFOURY AJ.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 25; NO 1; PP. 1-66; BIBL. 23 REF.Article
Learning relational Clichés with Contextual LGGMORIN, Johanne; MATWIN, Stan.Lecture notes in computer science. 2000, pp 274-282, issn 0302-9743, isbn 3-540-41094-5Conference Paper
Two models that show the interpolation theorem fails in all L1(Qα), and L1,1(Qα), α=0, 1, 2,..TALEBI, N.Bulletin of the London Mathematical Society. 1992, Vol 24, pp 305-308, issn 0024-6093, 4Article
Subtyping can have a simple semanticsBALSTERS, H; FOKKINGA, M. M.Theoretical computer science. 1991, Vol 87, Num 1, pp 81-96, issn 0304-3975Article
A normal form for restricted exponental functionsDEGANO, P; GIANNI, P.Informatique théorique et applications (Imprimé). 1989, Vol 23, Num 2, pp 217-231, issn 0988-3754Article
VAlloy: Virtual functions meet a relational languageMARINOV, Darko; KHURSHID, Sarfraz.Lecture notes in computer science. 2002, pp 234-251, issn 0302-9743, isbn 3-540-43928-5, 18 p.Conference Paper
On NFUCRABBÉ, M.Notre Dame journal of formal logic. 1992, Vol 33, Num 1, pp 112-119, issn 0029-4527Article
Theories of modules closed under direct productsVILLEMAIRE, R.The Journal of symbolic logic. 1992, Vol 57, Num 2, pp 515-521, issn 0022-4812Article
Expressing infinity without foundationPARLAMENTO, F; POLICRITI, A.The Journal of symbolic logic. 1991, Vol 56, Num 4, pp 1230-1235, issn 0022-4812Article
A model and its subsetNEWELSKI, L.The Journal of symbolic logic. 1992, Vol 57, Num 2, pp 644-658, issn 0022-4812Article
Images de spectres binaires par des polynômes = Ranges of binary spectra under some polynomialsMORE, M.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1992, Vol 315, Num 3, pp 343-348, issn 0764-4442Article
A generalization of Specker's theorem on typical ambiguityKAYE, R.The Journal of symbolic logic. 1991, Vol 56, Num 2, pp 458-466, issn 0022-4812Article
Convergency of learning processDONGMO ZHANG; NORMAN FOO.Lecture notes in computer science. 2002, pp 547-556, issn 0302-9743, isbn 3-540-00197-2, 10 p.Conference Paper
Inexhaustible homogeneous structuresBÖRÖCZKY, K; SAUER, N; ZHU, X et al.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 57-63, issn 0012-365XArticle
A proof of Morley's conjectureHART, B.The Journal of symbolic logic. 1989, Vol 54, Num 4, pp 1346-1358, issn 0022-4812Article
Generating function versions with rational strictness patternsHALL, C. V; WISE, D. S; SINTZOFF, M et al.Science of computer programming. 1989, Vol 12, Num 1, pp 39-74, issn 0167-6423Article
First-order approximation of algorithmic theoriesDANKO, W.Theoretical computer science. 1986, Vol 48, Num 2-3, pp 257-272, issn 0304-3975Article
The analogue of Buchi's problem for polynomialsPHEIDAS, Thanases; VIDAUX, Xavier.Lecture notes in computer science. 2005, pp 408-417, issn 0302-9743, isbn 3-540-26179-6, 10 p.Conference Paper
A functional scenario for bytecode verification of resource boundsAMADIO, Roberto M; COUPET-GRIMAL, Solange; DAL ZILIO, Silvano et al.Lecture notes in computer science. 2004, pp 265-279, issn 0302-9743, isbn 3-540-23024-6, 15 p.Conference Paper
Continuous first-order constraint satisfaction with equality and disequality constraintsRATSCHAN, Stefan.Lecture notes in computer science. 2002, pp 680-685, issn 0302-9743, isbn 3-540-44120-4, 6 p.Conference Paper
First-order logic : The unity of fuzziness and randomnessZHEN, Z; YUNJUAN, C.Fuzzy sets and systems. 1998, Vol 93, Num 2, pp 185-195, issn 0165-0114Article
Approximate reasoning about combined knowledgeKORICHE, F.Lecture notes in computer science. 1998, pp 259-273, issn 0302-9743, isbn 3-540-64162-9Conference Paper
