Uniformly Precomplete Enumerations

Mathematical Logic Quarterly 16 (8):463-468 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

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

Complete enumerations and double sequences.M. Adrian Carpentier - 1969 - Mathematical Logic Quarterly 15 (1‐3):1-6.
Regular enumerations.I. N. Soskov & V. Baleva - 2002 - Journal of Symbolic Logic 67 (4):1323-1343.
Finite cupping sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.
Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
Definability via enumerations.Ivan N. Soskov - 1989 - Journal of Symbolic Logic 54 (2):428-440.
Second Order Definability Via enumerations.Ivan N. Soskov - 1991 - Mathematical Logic Quarterly 37 (2‐4):45-54.
Uniform Continuity Properties of Preference Relations.Douglas S. Bridges - 2008 - Notre Dame Journal of Formal Logic 49 (1):97-106.
Strong Reducibilities of Enumerations and Partial Enumerated Algebras.A. Orlicki - 1988 - Mathematical Logic Quarterly 34 (2):143-162.

Analytics

Added to PP
2013-11-24

Downloads
10 (#1,218,872)

6 months
3 (#1,042,169)

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