Effective extensions of linear forms on a recursive vector space over a recursive field

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (13):193-200 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19850311302

Links

PhilArchive



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

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

A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Recursive analysis.R. L. Goodstein - 1961 - Mineola, N.Y.: Dover Publications.
Decidable subspaces and recursively enumerable subspaces.C. J. Ash & R. G. Downey - 1984 - Journal of Symbolic Logic 49 (4):1137-1145.
Weak Presentations of Computable Fields.Carl G. Jockusch & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.
Discontinuities of provably correct operators on the provably recursive real numbers.William J. Collins & Paul Young - 1983 - Journal of Symbolic Logic 48 (4):913-920.
Controlling the dependence degree of a recursive enumerable vector space.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (1):13-22.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Simple and hyperhypersimple vector spaces.Allen Retzlaff - 1978 - Journal of Symbolic Logic 43 (2):260-269.
Handbook of recursive mathematics.IUrii Leonidovich Ershov (ed.) - 1998 - New York: Elsevier.
Recursive functionals.Luis E. Sanchis - 1992 - New York: North-Holland.

Analytics

Added to PP
2013-10-31

Downloads
61 (#265,446)

6 months
1 (#1,478,456)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.

Add more citations

References found in this work

No references found.

Add more references