Complete intersections and rational equivalence.
R. Barlow (1996)
Manuscripta mathematica
Similarity:
R. Barlow (1996)
Manuscripta mathematica
Similarity:
Masahiro Yasumoto (1994)
Manuscripta mathematica
Similarity:
S. Iliadis (1988)
Fundamenta Mathematicae
Similarity:
Mrowka, S. (1970)
Portugaliae mathematica
Similarity:
J. Achari (1978)
Matematički Vesnik
Similarity:
Matusevich, Laura Felicia (2000)
Beiträge zur Algebra und Geometrie
Similarity:
J. Achari (1979)
Publications de l'Institut Mathématique
Similarity:
Samson Saneblidze (1992)
Manuscripta mathematica
Similarity:
Krystyna Ziętak (1974)
Applicationes Mathematicae
Similarity:
J. Siciak (1962)
Annales Polonici Mathematici
Similarity:
Vassiliki Farmaki, Andreas Koutsogiannis (2013)
Fundamenta Mathematicae
Similarity:
Ramsey theory for words over a finite alphabet was unified in the work of Carlson, who also presented a method to extend the theory to words over an infinite alphabet, but subject to a fixed dominating principle. In the present work we establish an extension of Carlson's approach to countable ordinals and Schreier-type families developing an extended Ramsey theory for dominated words over a doubly infinite alphabet (in fact for ω-ℤ*-located words), and we apply this theory, exploiting...
Jannis A. Antoniadis (1992)
Manuscripta mathematica
Similarity:
Hubert Flenner, Mikhail Zaidenberg (1996)
Manuscripta mathematica
Similarity:
J. C. Mayer, E. D. Tymchatyn
Similarity:
CONTENTS1. Introduction......................................................................52. Rim-type and decompositions..........................................83. Defining sequences and isomorphisms..........................184. Embedding theorem.......................................................265. Construction of universal and containing spaces...........326. References....................................................................39
Olivier Carton, Olivier Finkel, Pierre Simonnet (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we study the continuity of rational functions realized by Büchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function is continuous. We prove here that surprisingly, it cannot be decided whether such a function has at least one point of continuity and that its continuity set cannot be computed. In the case of a synchronous rational function, we show that its continuity set is rational and that it can be computed....