Computable explanations

Mathematical Logic Quarterly 21 (1):215-224 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19750210129

Links

PhilArchive



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

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

Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
On Computability Theoretic Properties of Structures and Their Cartesian Products.Bakhadyr Khoussainov - 2000 - Mathematical Logic Quarterly 46 (4):467-476.
A Banach–Mazur computable but not Markov computable function on the computable real numbers.Peter Hertling - 2005 - Annals of Pure and Applied Logic 132 (2-3):227-246.
The wave equation with computable initial data whose unique solution is nowhere computable.Marian B. Pour-El & Ning Zhong - 1997 - Mathematical Logic Quarterly 43 (4):499-509.
Monotonically Computable Real Numbers.Robert Rettinger, Xizhong Zheng, Romain Gengler & Burchard von Braunmühl - 2002 - Mathematical Logic Quarterly 48 (3):459-479.
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.
Embeddings of Computable Structures.Asher M. Kach, Oscar Levin & Reed Solomon - 2010 - Notre Dame Journal of Formal Logic 51 (1):55-68.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
$$\Pi^0_1$$ -Presentations of Algebras.Bakhadyr Khoussainov, Theodore Slaman & Pavel Semukhin - 2006 - Archive for Mathematical Logic 45 (6):769-781.

Analytics

Added to PP
2013-11-24

Downloads
19 (#750,145)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Cooperation in the Prisoni.J. V. Howard - 1988 - Theory and Decision 24 (3):203.

Add more citations

References found in this work

No references found.

Add more references