Erwin Engeler. Algorithmic approximations. Journal of computer and system sciences, vol. 5 , pp. 67–82

Journal of Symbolic Logic 39 (2):348 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Review: Erwin Engeler, Algorithmic Approximations. [REVIEW]R. M. Burstall - 1974 - Journal of Symbolic Logic 39 (2):348-348.
[Omnibus Review].Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):280-281.
Aquivalenzklassen von n-Tupeln.G. Fuhrken & Erwin Engeler - 1966 - Journal of Symbolic Logic 31 (3):504.
Formal Languages: Automata and Structures.Erwin Engeler - 1970 - Journal of Symbolic Logic 35 (4):594-595.
Zur Beweistheorie von Sprachen mit Unendlich Langen Formela.Erwin Engeler - 1971 - Journal of Symbolic Logic 36 (4):685-685.

Analytics

Added to PP
2016-06-30

Downloads
11 (#975,863)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references