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)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2018.06.001

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

External links

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

Through your library

My notes

Similar books and articles

Uniformly defining p-henselian valuations.Franziska Jahnke & Jochen Koenigsmann - 2015 - Annals of Pure and Applied Logic 166 (7-8):741-754.
Separation logic and logics with team semantics.Darion Haase, Erich Grädel & Richard Wilke - 2022 - Annals of Pure and Applied Logic 173 (10):103063.
An exponential separation between the matching principles and the pigeonhole principle, forthcoming.Paul Beame & Toniann Pitassi - forthcoming - Annals of Pure and Applied Logic.
WKL0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
Counterexamples to countable-section Π 2 1 uniformization and Π 3 1 separation.Vladimir Kanovei & Vassily Lyubetsky - 2016 - Annals of Pure and Applied Logic 167 (3):262-283.
Annals of pure and applied logic.Ja Makowsky - forthcoming - Annals of Pure and Applied Logic.
CZF and second order arithmetic.Robert S. Lubarsky - 2006 - Annals of Pure and Applied Logic 141 (1):29-34.
Introducing article numbering to Annals of Pure and Applied Logic.Giovanni Raneri - 2019 - Annals of Pure and Applied Logic 170 (11):102728.
Bootstrapping, part I.Sedki Boughattas & J. -P. Ressayre - 2010 - Annals of Pure and Applied Logic 161 (4):511-533.
Erratum to “Definitional equivalence and algebraizability of generalized logical systems” Annals of Pure and Applied Logic 98 (1999) 1–68. [REVIEW]Alexej P. Pynko - 2000 - Annals of Pure and Applied Logic 102 (3):283-284.

Analytics

Added to PP
2018-07-15

Downloads
15 (#1,238,350)

6 months
6 (#873,397)

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