A Chain of Inclusion Relations in Computable Analysis

&
Journal of Symbolic Logic 40 (1):84 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272278

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

Analysis in the Computable Number Field.Brian H. Mayoh & Oliver Aberth - 1975 - Journal of Symbolic Logic 40 (1):84.
The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations.Brian H. Mayoh & Oliver Aberth - 1975 - Journal of Symbolic Logic 40 (1):85.
Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
Aberth Oliver. The failure in computable analysis of a classical existence theorem for differential equations. Proceedings of the American Mathematical Society, vol. 30 , pp. 151–156. [REVIEW]Brian H. Mayoh - 1975 - Journal of Symbolic Logic 40 (1):85-85.
Chains and antichains in partial orderings.Valentina S. Harizanov, Carl G. Jockusch & Julia F. Knight - 2009 - Archive for Mathematical Logic 48 (1):39-53.
Infinite chains and antichains in computable partial orderings.E. Herrmann - 2001 - Journal of Symbolic Logic 66 (2):923-934.
Stability and Posets.Carl G. Jockusch, Bart Kastermans, Steffen Lempp, Manuel Lerman & Reed Solomon - 2009 - Journal of Symbolic Logic 74 (2):693-711.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
Constructive equivalence relations on computable probability measures.Laurent Bienvenu & Wolfgang Merkle - 2009 - Annals of Pure and Applied Logic 160 (3):238-254.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.Walker M. White & Denis R. Hirschfeldt - 2002 - Notre Dame Journal of Formal Logic 43 (1):51-64.
Computable Analysis.Oliver Aberth - 1984 - Journal of Symbolic Logic 49 (3):988-989.
Computability of Minimizers and Separating Hyperplanes.Kam-Chau Wong - 1996 - Mathematical Logic Quarterly 42 (1):564-568.
Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
Degree spectra of relations on structures of finite computable dimension.Denis R. Hirschfeldt - 2002 - Annals of Pure and Applied Logic 115 (1-3):233-277.

Analytics

Added to PP
2013-11-22

Downloads
15 (#929,240)

6 months
1 (#1,506,218)

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