EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 14 / No 2 (1980) RAIRO. Inform. théor., 14 2 (1980) 131-141 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 14, Number 2, 1980
Page(s) 131 - 141
DOI https://doi.org/10.1051/ita/1980140201311
Published online 01 February 2017
  1. 1. B. COURCELLE, Frontiers of Infinite Trees, R.A.I.R.O., Informatique théorique, Vol. 12, 1978, pp. 319-337. [EuDML: 92084] [MR: 517634] [Zbl: 0411.68065] [Google Scholar]
  2. 2. A. FRAENKEL, Y. BAR-HILLEL, A. LEVY and VAN DALEN, Foundations of Set Theory, 2nd rev. edition, North-Holland Publ. Co., Amsterdam, 1973. [MR: 345816] [Zbl: 0248.02071] [Google Scholar]
  3. 3. F. HAUSDORFF, Grundzüge einer Theorie der geordneten Mengen, Math. Annalen, Vol. 65, 1908, pp. 435-505. [EuDML: 158357] [MR: 1511478] [JFM: 39.0099.01] [Google Scholar]
  4. 4. F. HAUSDORFF, Grundzüge der Mengenlehre, Leipzig, 1914. [JFM: 45.0123.01] [Google Scholar]
  5. 5. S. HEILBRUNNER, Gleichungssysterne für Zeichenreihen, Technische Universität München, Bericht, No. 7311, 1973. [Google Scholar]
  6. 6. S. HEILBRUNNER, Das Problem der »unendlichen Modi« in Algol 68, Lecture Notes in Computer Science, Vol. 26, 1975, pp. 131-139, Springer-Verlag. [MR: 386328] [Zbl: 0359.68035] [Google Scholar]
  7. 7. R. MCNAUGHTON,, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 521-530. [MR: 213241] [Zbl: 0212.33902] [Google Scholar]
  8. 8. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, Vol. 11, 1977, pp. 311-327. [EuDML: 92059] [MR: 468353] [Zbl: 0371.68025] [Google Scholar]
  9. 9. M. NIVAT, Sur les ensembles des mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, Vol. 12, 1978, pp. 259-278. [EuDML: 92080] [MR: 510641] [Zbl: 0387.68050] [Google Scholar]
  10. 10. W. SIERPINSKI, Cardinal and Ordinal Numbers, Warsaw, 1965. [MR: 194339] [Zbl: 0131.24801] [Google Scholar]
  11. 11. Th. SKOLEM, Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen, Skrifter utgit av Videnskapselskapet i Kristiania, 1. Mathematisk-Naturvidenskabelig Klasse, 1. Bind, No. 4, 1920, p. 4-36. [JFM: 48.1121.01] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.