Second Order Definability Via enumerations

Mathematical Logic Quarterly 37 (2‐4):45-54 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Soskov, Ivan N. (1991) "Second Order Definability Via enumerations". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37(2-4):45-54

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

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

Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Definability via enumerations.Ivan N. Soskov - 1989 - Journal of Symbolic Logic 54 (2):428-440.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Universal First‐Order Definability in Modal Logic.R. E. Jennings, D. K. Johnston & P. K. Schotch - 1980 - Mathematical Logic Quarterly 26 (19-21):327-330.
Intrinsically II 11 Relations.Ivan Soskov - 1996 - Mathematical Logic Quarterly 42 (1):109-126.
Definability of second order generalized quantifiers.Juha Kontinen - 2010 - Archive for Mathematical Logic 49 (3):379-398.

Analytics

Added to PP
2013-12-01

Downloads
11 (#1,427,285)

6 months
6 (#888,477)

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

Add more references