QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
Morillon, M. Uniform Gâteaux differentiability yields Hahn-Banach to appear Quaestiones Mathematicae   article  
Mathias, A. R. D. Set forcing over models of Zermelo or Mac Lane 2010 One hundred years of axiomatic set theory   incollection  
Mathias, A. R. D. Unordered pairs in the set theory of Bourbaki 1949 2010 Archiv für Mathematik   article  
Morillon, M. Notions of Compactness for special subsets of IR^I and some Weak Forms of the Axiom of Choice 2010 Journal of Symbolic Logic   article  
Bagaria, J., Casacuberta, C. & Mathias, A. R. D. Epireflections and supercompact cardinals 2009 J. Pure Appl. Algebra   article URL  
Delhommé, C., Pouzet, M., Sági, G. & Sauer, N. Representation of ideals of relational structures 2009 Discrete Mathematics   article URL  
Morillon, M. Linear forms and axioms of choice 2009 Comment.Math.Univ.Carolinae   article  
Burckel, S. Inductions, Kernels and Graphs 2008 ROGIS   proceedings  
Burckel, S. Decomposition of mappings on finite sets 2008 SSAOS   proceedings  
Burckel, S. & Gioan, E. In Situ Design of Register Operations 2008 IEEE ISVLSI   proceedings  
Courcelle, B. & Delhommé, C. The modular decomposition of countable graphs. Definition and construction in monadic second-order logic 2008 Theoret. Comput. Sci.   article URL  
de Crisenoy, M. & Essouabri, D. Relations between values at $T$-tuples of negative integers of twisted multivariable zeta series associated to polynomials of several variables 2008 J. Math. Soc. Japan   article URL  
Delhommé, C., Laflamme, C., Pouzet, M. & Sauer, N. Indivisible ultrametric spaces 2008 Topology Appl.   article URL  
Frécon, O. Groupes géométriques de rang de Morley fini 2008 J. Inst. Math. Jussieu   article URL  
Frécon, O. & Jaligot, E. Conjugacy in groups of finite Morley rank 2008 Model theory with applications to algebra and analysis. Vol. 2   incollection URL  
Morillon, M. Countable choice and compactness 2008 Topology Appl.   article URL  
Abraham, U. & Schipperus, R. Infinite games on finite sets 2007 Israel J. Math.   article URL  
Burckel, S. Procédé et Système de Transmission de Données 2007   patent  
Burckel, S. Certifying H2-SAT with Modus Ponens 2007 MACIS   proceedings  
Burckel, S. & Gioan, E. Procédé d'Optimisation des Ressources Mémoires 2007   patent  
Delhommé, C., Laflamme, C., Pouzet, M. & Sauer, N. Divisibility of countable metric spaces 2007 European J. Combin.   article URL  
Mathias, A. R. D. A note on the schemes of replacement and collection 2007 Arch. Math. Logic   article URL  
de Crisenoy, M. Values at $T$-tuples of negative integers of twisted multivariable zeta series associated to polynomials of several variables 2006 Compos. Math.   article URL  
Delhommé, C. Height of a superposition 2006 Order   article URL  
Delhommé, C. & Morillon, M. Spanning graphs and the axiom of choice 2006 Rep. Math. Logic   article URL  
Frécon, O. Around unipotence in groups of finite Morley rank 2006 J. Group Theory   article URL  
Frécon, O. Carter subgroups in tame groups of finite Morley rank 2006 J. Group Theory   article URL  
Mathias, A. R. D. Weak systems of Gandy, Jensen and Devlin 2006 Set theory   incollection URL  
Frécon, O. & Jaligot, E. The existence of Carter subgroups in groups of finite Morley rank 2005 J. Group Theory   article URL  
Mathias, A. R. D. Analytic sets under attack 2005 Math. Proc. Cambridge Philos. Soc.   article URL  
Morillon, M. James sequences and dependent choices 2005 MLQ Math. Log. Q.   article URL  
Morillon, M. A new proof of James' sup theorem 2005 Extracta Math.   article URL  
Burckel, S. Elementary decompositions of arbitrary maps over finite sets 2004 J. Symbolic Comput.   article URL  
Burckel, S. & Morillon, M. Sequential computation of linear Boolean mappings 2004 Theoret. Comput. Sci.   article URL  
Burckel, S. & Morillon, M. Quadratic sequential computations of Boolean mappings 2004 Theory Comput. Syst.   article URL  
Delhommé, C. Automaticité des ordinaux et des graphes homogènes 2004 C. R. Math. Acad. Sci. Paris   article URL  
Frécon, O. Sous-groupes de Carter dans les groupes de rang de Morley fini 2004 J. Symbolic Logic   article URL  
Mathias, A. R. D. Choosing an attacker by a local derivation 2004 Acta Univ. Carolin. Math. Phys.   article URL  
Mathias, A. R. D. La Ignorancia de Bourbaki (The ignorance of Bourbaki) 2004 Gac. R. Soc. Mat. Esp.   article URL  
Mathias, A. R. D. A scenario for transferring high scores 2004 Acta Univ. Carolin. Math. Phys.   article URL  
Burckel, S. A result on braids via the investigation of a rewriting system 2003 J. Symbolic Comput.   article URL  
Delhommé, C., Knapik, T. & Thomas, D. G. Using transitive-closure logic for deciding linear properties of monoids 2003 Mathematical foundations of computer science 2003   incollection URL  
Poirier, S. New solution method for third-order equations. (Nouvelle méthode de résolution des équations du 3ème degré.) 2003 Gaz. Math., Soc. Math. Fr.   article URL  
Courcelle, B. & Knapik, T. The evaluation of first-order substitution is monadic second-order compatible 2002 Theoret. Comput. Sci.   article URL  
Delhommé, C. & Sauer, N. Homomorphisms of products of graphs into graphs without four cycles 2002 Combinatorica   article URL  
Knapik, T. Checking simple properties of transition systems defined by Thue specifications 2002 J. Automat. Reason.   article URL  
Knapik, T., Niwiński, D. & Urzyczyn, P. Higher-order pushdown trees are easy 2002 Foundations of software science and computation structures (Grenoble, 2002)   incollection URL  
Mathias, A. R. D. A term of length 4 523 659 424 929 2002 Synthese   article URL  
Albius, E. & Morillon, M. Uniform smoothness entails Hahn-Banach 2001 Quaest. Math.   article URL  
Burckel, S. Syntactical methods for braids of three strands 2001 J. Symbolic Comput.   article URL  
Caucal, D. & Knapik, T. An internal presentation of regular graphs by prefix-recognizable graphs 2001 Theory Comput. Syst.   article URL  
Knapik, T., Niwiński, D. & Urzyczyn, P. Deciding monadic theories of hyperalgebraic trees 2001 Typed lambda calculi and applications (Kraków, 2001)   incollection URL  
Mathias, A. R. D. The strength of Mac Lane set theory 2001 Ann. Pure Appl. Logic   article URL  
Mathias, A. R. D. Delays, recurrence and ordinals 2001 Proc. London Math. Soc. (3)   article URL  
Mathias, A. R. D. Slim models of Zermelo set theory 2001 J. Symbolic Logic   article URL  
Burckel, S. & Morillon, M. Three generators for minimal writing-space computations 2000 Theor. Inform. Appl.   article URL  
Burckel, S., Hoarau, S.. Mesnard, F.. & Neumerkel, U. CTI : Bottom-Up Termination Inference for Logic Programs, 2000   proceedings  
Delhommé, C., Pouzet, M. & Sauer, N. Jump-number of means on graphs 2000 European J. Combin.   article URL  
Frécon, O. Sous-groupes anormaux dans les groupes de rang de Morley fini résolubles 2000 J. Algebra   article URL  
Frécon, O. Sous-groupes de Hall généralisés dans les groupes résolubles de rang de Morley fini 2000 J. Algebra   article URL  
Mathias, A. R. D. Strong statements of analysis 2000 Bull. London Math. Soc.   article URL  
Burckel, S. Computation of the ordinal of braids 1999 Order   article URL  
Delhommé, C. Atomic compactness for reflexive graphs 1999 Fund. Math.   article URL  
Delhommé, C. Projection properties and reflexive binary relations 1999 Algebra Universalis   article URL  
Delhommé, C. & Morillon, M. Dependent choices and weak compactness 1999 Notre Dame J. Formal Logic   article URL  
Dodu, J. & Morillon, M. The Hahn-Banach property and the axiom of choice 1999 MLQ Math. Log. Q.   article URL  
Knapik, T. & Calbrix, H. The graphs of finite monadic semi-Thue systems have a decidable monadic second-order theory 1999 Combinatorics, computation & logic '99 (Auckland)   incollection URL  
Knapik, T. & Calbrix, H. Thue specifications and their monadic second-order properties 1999 Fund. Inform.   article URL  
Knapik, T. & Payet, É. Synchronized product of linear bounded machines 1999 Fundamentals of computation theory (Iasi, 1999)   incollection URL  
Calbrix, H. & Knapik, T. A string-rewriting characterization of Muller and Schupp's context-free graphs 1998 Foundations of software technology and theoretical computer science (Chennai, 1998)   incollection  
Delhommé, C. Infinite projection properties 1998 MLQ Math. Log. Q.   article URL  
Fossy, J. & Morillon, M. The Baire category property and some notions of compactness 1998 J. London Math. Soc. (2)   article URL  
Knapik, T. & Payet, É. The full quotient and its closure property for regular languages 1998 Inform. Process. Lett.   article URL  
Burckel, S. The wellordering on positive braids 1997 J. Pure Appl. Algebra   article URL  
Burckel, S. Closed iterative calculus 1996 Theoret. Comput. Sci.   article URL  
Bernot, G., Bidoit, M. & Knapik, T. Observational specifications and the indistinguishability assumption 1995 Theoret. Comput. Sci.   article URL  
Bernot, G., Bidoit, M. & Knapik, T. Behavioural approaches to algebraic specifications. A comparative study 1994 Acta Inform.   article URL  
Morillon, M. Les compacts extrêmement discontinus sont finis! 1994 Séminaire d'Analyse, 1993--1994 (Aubière)   incollection URL  
Morillon, M. Extreme choices on complete lexicographic orders 1991 Z. Math. Logik Grundlag. Math.   article URL  
Haddad, L. & Morillon, M. L'axiome de normalité pour les espaces totalement ordonnés 1990 J. Symbolic Logic   article URL  

Created by JabRef on 02/02/2010.