Nombres algébriques et substitutions

Formalized algebraic numbers: construction and first-order theory. (Formalisation des nombres algébriques : construction et théorie du premier ordre)

ion layers and Coq proof Now is the time to decide at which abstraction level we start the formalization. The very first argument of the induction step of each proof above starts with an argument about the existence of a lifting for symmetric polynomials, so we have to formalize symmetric polynomials and the fundamental theorem of symmetric polynomials anyway. 88 pa st el -0 07 80 44 6, v er si...

Structures algébriques en logique et concurrence

In this work we shall synthesize the research activity we have accomplished since we received the PhD title at the University of Québec in Montréal. These researches have been developed at and made possible through several research institutions that we would like to thank : the BRICS at Aarhus University, the PIMS and the Department of Computer Science of Calgary University, the LaBRI at Bordea...

Langages Algébriques et Systèmes de Réécriture Rationells

— In this paper, a new methodfor generating languages is introduced. It consists of the définition ofafinite number ofrules ofthe type: fug may be replacedby fvg iffbelongs to a given regular language. It is proved that any de terminis tic language which is prefix can be generated starting from finite sets anditerating such rules. Conversely under suitable hypotheses on the R(u, v) the language...

1971, et Sém. Th. Nombres Paris 14.]

[2] A.-M. Bergé, Quelques résultats relatifs à l’ordre associé à une extension, Publi. Math. Bordeaux 5 (1972). [3] A.-M. Bergé, Arithmétique d’une extension galoisienne à groupe d’inertie cyclique, Ann. Inst. Fourier 28, 4 (1978), 17–44. [Voir aussi Comptes rendus Acad. Sc. Paris, 21 juillet 1975.] [4] A.-M. Bergé, Projectivité des anneaux d’entiers sur leurs ordres associés, Astérisque 61 (19...

Groupes de Galois et nombres automatiques