A uniform version of non-low2-ness

Annals of Pure and Applied Logic 168 (3):738-748 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2016.10.013

Other Versions

No versions found

Links

PhilArchive



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

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

Aligning the weak König lemma, the uniform continuity theorem, and Brouwer’s fan theorem.Josef Berger - 2012 - Annals of Pure and Applied Logic 163 (8):981-985.
Uniform interpolation and coherence.Tomasz Kowalski & George Metcalfe - 2019 - Annals of Pure and Applied Logic 170 (7):825-841.
A predicative completion of a uniform space.Josef Berger, Hajime Ishihara, Erik Palmgren & Peter Schuster - 2012 - Annals of Pure and Applied Logic 163 (8):975-980.
Uniform interpolation and compact congruences.Samuel J. van Gool, George Metcalfe & Constantine Tsinakis - 2017 - Annals of Pure and Applied Logic 168 (10):1927-1948.
Uniform interpolation and the existence of sequent calculi.Rosalie Iemhoff - 2019 - Annals of Pure and Applied Logic 170 (11):102711.
Apartness spaces and uniform neighbourhood structures.Douglas S. Bridges - 2016 - Annals of Pure and Applied Logic 167 (9):850-864.
The uniform content of partial and linear orders.Eric P. Astor, Damir D. Dzhafarov, Reed Solomon & Jacob Suggs - 2017 - Annals of Pure and Applied Logic 168 (6):1153-1171.
The uniform boundedness theorem and a boundedness principle.Hajime Ishihara - 2012 - Annals of Pure and Applied Logic 163 (8):1057-1061.
Substructures and uniform elimination for p-adic fields.Luc Bélair - 1988 - Annals of Pure and Applied Logic 39 (1):1-17.
Closed choice and a uniform low basis theorem.Vasco Brattka, Matthew de Brecht & Arno Pauly - 2012 - Annals of Pure and Applied Logic 163 (8):986-1008.

Analytics

Added to PP
2016-10-20

Downloads
20 (#1,031,500)

6 months
7 (#684,641)

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

Computability theory and differential geometry.Robert I. Soare - 2004 - Bulletin of Symbolic Logic 10 (4):457-486.
There Is No SW-Complete C.E. Real.Liang Yu & Decheng Ding - 2004 - Journal of Symbolic Logic 69 (4):1163 - 1170.
A C.E. Real That Cannot Be SW-Computed by Any Ω Number.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (2):197-209.
Randomness and the linear degrees of computability.Andrew Em Lewis & George Barmpalias - 2007 - Annals of Pure and Applied Logic 145 (3):252-257.
Maximal pairs of c.e. reals in the computably Lipschitz degrees.Yun Fan & Liang Yu - 2011 - Annals of Pure and Applied Logic 162 (5):357-366.

Add more references