Theorem Provers for Substructural Logics
Théorème de Church-Rosser et structuration des langues naturelles
Théorèmes de consistance en théorie de la mesure de R. Solovay
Theorem-proving systems [Book]
Theorems on groups of finite Morley rank analogous to theorems on finite groups.
Theorems on sets not belonging to algebras.
Théorie de la classification
Théorie des modèles et conjecture de Manin-Mumford
Théorie des modèles pour des anneaux de fonctions entières et des corps de fonctions méromorphes
Théorie des modèles sans identité
Theorien abelscher Gruppen mit einem einstelligen Prädikat
Théories de Galois différentielles et transcendance
On décrit des preuves galoisiennes des versions logarithmique et exponentielle de la conjecture de Schanuel, pour les variétés abéliennes sur un corps de fonctions.
Théories des bornes
Théories des types de graphes
Theories of orders on the set of words
It is shown that small fragments of the first-order theory of the subword order, the (partial) lexicographic path ordering on words, the homomorphism preorder, and the infix order are undecidable. This is in contrast to the decidability of the monadic second-order theory of the prefix order [M.O. Rabin, Trans. Amer. Math. Soc., 1969] and of the theory of the total lexicographic path ordering [P. Narendran and M. Rusinowitch, Lect. Notes Artificial Intelligence, 2000] and, in case of the subword...
Theories of orders on the set of words
It is shown that small fragments of the first-order theory of the subword order, the (partial) lexicographic path ordering on words, the homomorphism preorder, and the infix order are undecidable. This is in contrast to the decidability of the monadic second-order theory of the prefix order [M.O. Rabin, Trans. Amer. Math. Soc., 1969] and of the theory of the total lexicographic path ordering [P. Narendran and M. Rusinowitch, Lect. Notes Artificial Intelligence, 2000] and, in case of the ...
Théories pré-inductives et pré-modèle-complètes. Une approche naturelle du forcing infini
Theory of computing systems
Theory of types and data description
There are absolute ultrafilters on N which are not minimal