Combinational functors on co-r.e. structures

Annals of Mathematical Logic 10 (3-4):261-287 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Interdefinability of Lambekian functors.Wojciech Zielonka & W. Zielonka - 1992 - Mathematical Logic Quarterly 38 (1):501-507.
Structured meanings and reflexive domains.Serge Lapierre - 1992 - Studia Logica 51 (2):215 - 239.
Selection from A Combinational Theory of Possibility.D. M. Armstrong - 2004 - In Tim Crane & Katalin Farkas (eds.), Metaphysics: a guide and anthology. Oxford University Press UK.
Universality for Orders and Graphs Which Omit Large Substructures.Katherine Thompson - 2006 - Notre Dame Journal of Formal Logic 47 (2):233-248.

Analytics

Added to PP
2014-01-17

Downloads
9 (#1,254,017)

6 months
1 (#1,471,540)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Σ 1 0 and Π 1 0 equivalence structures.Douglas Cenzer, Valentina Harizanov & Jeffrey B. Remmel - 2011 - Annals of Pure and Applied Logic 162 (7):490-503.

Add more citations

References found in this work

Countable vector spaces with recursive operations Part I1.J. C. E. Dekker - 1969 - Journal of Symbolic Logic 34 (3):363-387.
Post's Problem and His Hypersimple Set.Carl G. Jockusch & Robert I. Soare - 1973 - Journal of Symbolic Logic 38 (3):446 - 452.
Combinatorial Series and Recursive Equivalence Types.A. B. Manaster - 1968 - Journal of Symbolic Logic 33 (4):620-621.
The Co-simple isols.Louise Hay - 1972 - Journal of Symbolic Logic 37 (2):407-408.

Add more references