Computational inductive definability

Annals of Pure and Applied Logic 126 (1-3):139-148 (2004)
  Copy   BIBTEX

Abstract

It is shown that over any countable first-order structure, IND programs with dictionaries accept exactly the Π 1 1 relations. This extends a result of Harel and Kozen 118) relating IND and Π 1 1 over countable structures with some coding power, and provides a computational analog of a result of Barwise et al. 108) relating the Π 1 1 relations on a countable structure to a certain family of inductively definable relations on the hereditarily finite sets over that structure

Links

PhilArchive



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

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

Global inductive definability.Jon Barwise & Yiannis N. Moschovakis - 1978 - Journal of Symbolic Logic 43 (3):521-534.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
Uniform inductive definability and infinitary languages.Anders M. Nyberg - 1976 - Journal of Symbolic Logic 41 (1):109-120.
Game-theoretic inductive definability.Juha Oikkonen & Jouko Väänänen - 1993 - Annals of Pure and Applied Logic 65 (3):265-306.
Intrinsically II 11 Relations.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):109-126.
Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.

Analytics

Added to PP
2014-01-16

Downloads
15 (#953,911)

6 months
7 (#441,920)

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

The next admissible set.K. J. Barwise, R. O. Gandy & Y. N. Moschovakis - 1971 - Journal of Symbolic Logic 36 (1):108-120.

Add more references