Computability by means of effectively definable schemes and definability via enumerations

Archive for Mathematical Logic 29 (3):187-200 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf01621094

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

Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Definability via enumerations.Ivan N. Soskov - 1989 - Journal of Symbolic Logic 54 (2):428-440.
Second Order Definability Via enumerations.Ivan N. Soskov - 1991 - Mathematical Logic Quarterly 37 (2‐4):45-54.
Intrinsically II 11 Relations.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):109-126.
Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Review: Yuri L. Ershov, Definability and Computability. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.
Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Regular enumerations.I. N. Soskov & V. Baleva - 2002 - Journal of Symbolic Logic 67 (4):1323-1343.
Definability of Initial Segments.Akito Tsuboi & Saharon Shelah - 2002 - Notre Dame Journal of Formal Logic 43 (2):65-73.
Definability of groups in ℵ₀-stable metric structures.Itaï Ben Yaacov - 2010 - Journal of Symbolic Logic 75 (3):817-840.
Characterizations of negative definability in modal logic.Marco Hollenberg - 1998 - Studia Logica 60 (3):357-386.
Taming the Indefinitely Extensible Definable Universe.L. Luna & W. Taylor - 2014 - Philosophia Mathematica 22 (2):198-208.
A version of p-adic minimality.Raf Cluckers & Eva Leenknegt - 2012 - Journal of Symbolic Logic 77 (2):621-630.
Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.

Analytics

Added to PP
2013-11-23

Downloads
29 (#518,760)

6 months
2 (#1,136,865)

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

Abstract computability and invariant definability.Yiannis N. Moschovakis - 1969 - Journal of Symbolic Logic 34 (4):605-633.
Definability via enumerations.Ivan N. Soskov - 1989 - Journal of Symbolic Logic 54 (2):428-440.

Add more references