Projective bigraphs with recursive operations

Notre Dame Journal of Formal Logic 19 (2):193-199 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

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

Weak Presentations of Computable Fields.Carl G. Jockusch & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.
Countable vector spaces with recursive operations Part II.J. C. E. Dekker - 1971 - Journal of Symbolic Logic 36 (3):477-493.
Two notes on vector spaces with recursive operations.J. C. E. Dekker - 1971 - Notre Dame Journal of Formal Logic 12 (3):329-334.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Undecidable theories of Lyndon algebras.Vera Stebletsova & Yde Venema - 2001 - Journal of Symbolic Logic 66 (1):207-224.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.
Projective prewellorderings vs projective wellfounded relations.Xianghui Shi - 2009 - Journal of Symbolic Logic 74 (2):579-596.
Recursive functionals.Luis E. Sanchis - 1992 - New York: North-Holland.

Analytics

Added to PP
2010-08-24

Downloads
23 (#684,863)

6 months
4 (#796,773)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.

Add more citations

References found in this work

No references found.

Add more references