Second Order Definability Via enumerations

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (2-4):45-54 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19910370206

Links

PhilArchive



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

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

Second Order Definability Via enumerations.Ivan N. Soskov - 1991 - Mathematical Logic Quarterly 37 (2‐4):45-54.
Definability via enumerations.Ivan N. Soskov - 1989 - Journal of Symbolic Logic 54 (2):428-440.
Computability by means of effectively definable schemes and definability via enumerations.Ivan N. Soskov - 1990 - Archive for Mathematical Logic 29 (3):187-200.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Intrinsically II 11 Relations.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):109-126.
Regular enumerations.I. N. Soskov & V. Baleva - 2002 - Journal of Symbolic Logic 67 (4):1323-1343.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
Some effectively infinite classes of enumerations.Sergey Goncharov, Alexander Yakhnis & Vladimir Yakhnis - 1993 - Annals of Pure and Applied Logic 60 (3):207-235.
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.
Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2004 - Dissertation,
Arithmetical definability over finite structures.Troy Lee - 2003 - Mathematical Logic Quarterly 49 (4):385.
Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Modal languages for topology: Expressivity and definability.Balder ten Cate, David Gabelaia & Dmitry Sustretov - 2009 - Annals of Pure and Applied Logic 159 (1-2):146-170.
Review: Yuri L. Ershov, Definability and Computability. [REVIEW]Ivan Soskov - 1998 - Journal of Symbolic Logic 63 (2):747-748.
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (1):1-21.

Analytics

Added to PP
2016-02-04

Downloads
21 (#733,828)

6 months
4 (#776,943)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references