Effective Enumerations of Families of Finite Sets of Natural Numbers

Mathematical Logic Quarterly 37 (19‐22):301-306 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Ditchev, Angel V. (1991) "Effective Enumerations of Families of Finite Sets of Natural Numbers". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37(19-22):301-306

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

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

Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Why Numbers Are Sets.Eric Steinhart - 2002 - Synthese 133 (3):343-361.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Uniformly Precomplete Enumerations.M. Adrian Carpentier - 1970 - Mathematical Logic Quarterly 16 (8):463-468.
Large Finite Sets.Herman Ruge Jervell - 1985 - Mathematical Logic Quarterly 31 (35‐36):545-549.

Analytics

Added to PP
2013-12-01

Downloads
14 (#1,266,618)

6 months
3 (#1,469,629)

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