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: 93,590

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.
Second-order and Inductive Definability on Finite Structures.Michel De Rougemont - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):47-63.
Complete enumerations and double sequences.M. Adrian Carpentier - 1969 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (1-3):1-6.
Strong Reducibilities of Enumerations and Partial Enumerated Algebras.A. Orlicki - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (2):143-162.
Correction to “Strong Reducibilities of Enumerations and Partial Enumerated Algebras”.Andrzej Orlicki - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):95-95.
Effective Enumerations of Families of Finite Sets of Natural Numbers.Angel V. Ditchev - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):301-306.
Definability on Formulas With Single Quantifier.Shih-Ping Tung - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (2):105-108.
On Constructively Non-Morphisms of Enumerated Sets and Constructive Non-Reducibility of Enumerations.Andrzej Orlicki - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):485-496.
On definability of normal subgroups of a superstable group.Akito Tsuboi - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):101-106.
Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic.Bogdan Stanislaw Chlebus - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (34-35):529-536.

Analytics

Added to PP
2016-02-04

Downloads
21 (#173,985)

6 months
4 (#1,635,958)

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