Intrinsically Hyperarithmetical Sets

Mathematical Logic Quarterly 42 (1):469-480 (1996)
  Copy   BIBTEX

Abstract

The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtained

Categories

Keywords

Reprint years

DOI

10.1002/malq.19960420139

Links

PhilArchive



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

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 II 11 Relations.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):109-126.
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Review: C. Spector, Hyperarithmetical Quantifiers; Shih-Chao Liu, Recursive Linear Orderings and Hyperarithmetical Functions. [REVIEW]Gustav Hensel - 1966 - Journal of Symbolic Logic 31 (1):137-137.
Definability via enumerations.Ivan N. Soskov - 1989 - Journal of Symbolic Logic 54 (2):428-440.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Second Order Definability Via enumerations.Ivan N. Soskov - 1991 - Mathematical Logic Quarterly 37 (2‐4):45-54.
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, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
On external Scott algebras in nonstandard models of peano arithmetic.Vladimir Kanovei - 1996 - Journal of Symbolic Logic 61 (2):586-607.
On uniform definability of types over finite sets.Vincent Guingona - 2012 - Journal of Symbolic Logic 77 (2):499-514.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
Review: Kenneth McAloon, On the Sequence of Models $operatorname{HOD}_n$; Thomas J. Jech, Forcing with Trees and Ordinal Definability; Wlodzimierz Zadrozny, Iterating Ordinal Definability. [REVIEW]Rene David - 1987 - Journal of Symbolic Logic 52 (2):570-571.
Abstract Beth Definability in Institutions.Marius Petria & Răzvan Diaconescu - 2006 - Journal of Symbolic Logic 71 (3):1002 - 1028.

Analytics

Added to PP
2013-12-01

Downloads
13 (#978,482)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.

View all 9 citations / Add more citations

References found in this work

Mathematical logic.Joseph R. Shoenfield - 1967 - Reading, Mass.,: Addison-Wesley.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.

View all 6 references / Add more references