Abstract First Order Computability

Journal of Symbolic Logic 37 (4):758-758 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272441

Links

PhilArchive



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

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

Review: Yiannis N. Moschovakis, Abstract First Order Computability. [REVIEW]Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (4):758-758.
Review: Dimiter G. Skordev, Computability in Combinatory Spaces. An Algebraic Generalization of Abstract First Order Computability. [REVIEW]Dag Normann - 1995 - Journal of Symbolic Logic 60 (2):695-696.
Abstract computability and invariant definability.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (4):605-633.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
A guarded fragment for abstract state machines.Antje Nowack - 2005 - Journal of Logic, Language and Information 14 (3):345-368.
Soundness and completeness of the Cirquent calculus system CL6 for computability logic.Wenyan Xu & Sanyang Liu - 2012 - Logic Journal of the IGPL 20 (1):317-330.
Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.
Lattice representations for computability theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I.Klaus Weihrauch & Ning Zhong - 2007 - Mathematical Logic Quarterly 53 (4‐5):511-531.
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
Introduction to Computability Theory.D. Normann - 2010

Analytics

Added to PP
2015-02-05

Downloads
11 (#1,136,567)

6 months
4 (#787,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Definedness.Solomon Feferman - 1995 - Erkenntnis 43 (3):295 - 320.

Add more citations

References found in this work

No references found.

Add more references