Factors of Functions, AC and Recursive Analogues

Mathematical Logic Quarterly 48 (1):73-86 (2002)
  Copy   BIBTEX

Abstract

We investigate certain statements about factors of unary functions which have connections with weak forms of the axiom of choice. We discuss more extensively the fine structure of Howard and Rubin's Form 314 from [4]. Some of our set-theoretic results have also interesting recursive versions

Categories

Keywords

Reprint years

DOI

10.1002/1521-3870(200201)48:1

Links

PhilArchive



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

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

Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM.Osamu Takaki - 2005 - Archive for Mathematical Logic 44 (6):689-709.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Polynomial-time analogues of isolatedness.Leon Harkleroad - 1992 - Annals of Pure and Applied Logic 56 (1-3):173-182.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions.Robert A. di Paola - 1981 - Journal of Symbolic Logic 46 (2):216-232.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Formal systems and recursive functions.John N. Crossley & Michael Dummett (eds.) - 1965 - Amsterdam,: North-Holland Pub. Co..
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Rational separability over a global field.Alexandra Shlapentokh - 1996 - Annals of Pure and Applied Logic 79 (1):93-108.
Recursive and nonextendible functions over the reals; filter foundation for recursive analysis.II.Iraj Kalantari & Lawrence Welch - 1999 - Annals of Pure and Applied Logic 98 (1-3):87-110.

Analytics

Added to PP
2013-12-01

Downloads
9 (#1,278,126)

6 months
1 (#1,511,647)

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

Some Aspects and Examples of Infinity Notions.J. W. Degen - 1994 - Mathematical Logic Quarterly 40 (1):111-124.
There Can Be a Permutation Which Is Not The Product of Two Reflections.J. W. Degen - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):65-66.

Add more references