Real‐Time Decidability, Computability, Countability and Generability

Mathematical Logic Quarterly 14 (18):283-288 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

A guarded fragment for abstract state machines.Antje Nowack - 2005 - Journal of Logic, Language and Information 14 (3):345-368.
Machines Over the Reals and Non‐Uniformity.Felipe Cucker - 1997 - Mathematical Logic Quarterly 43 (2):143-157.
Approximate decidability in euclidean spaces.Armin Hemmerling - 2003 - Mathematical Logic Quarterly 49 (1):34-56.
Real time II.David Hugh Mellor - 1998 - New York: Routledge.
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.
Axiomatisation and decidability off andp in cyclical time.Mark Reynolds - 1994 - Journal of Philosophical Logic 23 (2):197 - 224.
Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.

Analytics

Added to PP
2013-11-24

Downloads
14 (#1,014,919)

6 months
2 (#1,250,447)

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