Definability and Computability

Studia Logica 61 (3):439-441 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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: Yuri L. Ershov, Definability and Computability. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Computability and λ-definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Computability and $lambda$-Definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
Abstract computability and invariant definability.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (4):605-633.
A. M. Turing. Computability and λ-definability. The journal of symbolic logic, Bd. 2 , S. 153–163. [REVIEW]Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.
Representation theorems for transfinite computability and definability.Dag Normann - 2002 - Archive for Mathematical Logic 41 (8):721-741.
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
On formalism freeness: Implementing gödel's 1946 princeton bicentennial lecture.Juliette Kennedy - 2013 - Association for Symbolic Logic: The Bulletin of Symbolic Logic 19 (3).
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.

Analytics

Added to PP
2015-02-06

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

The tree of tuples of a structure.Matthew Harrison-Trainor & Antonio Montalbán - 2022 - Journal of Symbolic Logic 87 (1):21-46.
Polish group actions and effectivity.Barbara Majcher-Iwanow - 2012 - Archive for Mathematical Logic 51 (5-6):563-573.
On the conservativity of the axiom of choice over set theory.Timothy J. Carlson - 2011 - Archive for Mathematical Logic 50 (7-8):777-790.

Add more citations

References found in this work

No references found.

Add more references