The Dyck and the Preiss separation uniformly

Annals of Pure and Applied Logic 169 (10):1082-1116 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Remarks on Uniformly Finitely Precomplete Positive Equivalences.V. Shavrukov - 1996 - Mathematical Logic Quarterly 42 (1):67-82.
On the Π1 1 -separation principle.Antonio Montalbán - 2008 - Mathematical Logic Quarterly 54 (6):563-578.
Finite cupping sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.
Response to Maarten Van Dyck’s commentary.Paolo Palmieri - 2009 - Studies in History and Philosophy of Science Part A 40 (3):319-321.
Book Review. [REVIEW]Pavel Preiss - 2004 - Acta Comeniana 18:346-348.
A uniformly computable Implicit Function Theorem.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (3):272-279.
Life's worth: the case against assisted suicide.Arthur J. Dyck - 2002 - Grand Rapids, Mich.: William B. Eerdmans Pub. Co..
Théo Preiss.Pierre Bonnard - 1950 - Revue de Théologie Et de Philosophie 38 (57):301.

Analytics

Added to PP
2018-07-15

Downloads
8 (#1,334,002)

6 months
2 (#1,236,853)

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

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Computable operators on regular sets.Martin Ziegler - 2004 - Mathematical Logic Quarterly 50 (4-5):392-404.

Add more references