On the Recursivity of Finite Sets

Mathematical Logic Quarterly 7 (7-10):136-140 (1961)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19610070708

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

On the Recursivity of Finite Sets.Ronald Harrop - 1968 - Journal of Symbolic Logic 33 (1):115-115.
Harrop Ronald. On the recursivity of finite sets. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 136–140.Hořejš Jiří. Note on definition of recursiveness. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 119–120. [REVIEW]Charles Parsons - 1968 - Journal of Symbolic Logic 33 (1):115-115.
Review: Ronald Harrop, The Finite Model Property and Subsystems of Classical Propositional Calculus. [REVIEW]H. Arnold Schmidt - 1960 - Journal of Symbolic Logic 25 (2):181-181.
R. Harrop. Some forms of models of propositional calculi. Contributions to mathematical logic, Proceedings of the Logic Colloquium, Hannover 1966, edited by H. Arnold Schmidt, K. Schutte, and H.-J. Thiele, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1968, pp. 163–174. - Ronald Harrop. On the equivalence for non-derivability testing of finite Smiley models and finite modified Smiley models. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 17 , pp. 137–143. [REVIEW]Dolph Ulrich - 1975 - Journal of Symbolic Logic 40 (2):251.
Large Finite Sets.Herman Ruge Jervell - 1985 - Mathematical Logic Quarterly 31 (35-36):545-549.
Almost Recursivity and Partial Degrees.Vladeta Vuckovic - 1974 - Mathematical Logic Quarterly 20 (25‐27):419-426.
Constructively Complete Finite Sets.Mark Mandelkern - 1988 - Mathematical Logic Quarterly 34 (2):97-103.
Ideals of Generalized Finite Sets in Lattices of α‐Recursively Enumerable Sets.Manuel Lerman - 1976 - Mathematical Logic Quarterly 22 (1):347-352.
Some theorems on the axioms of choice for finite sets.Martin M. Zuckerman - 1969 - Mathematical Logic Quarterly 15 (25):385-399.
Effective Enumerations of Families of Finite Sets of Natural Numbers.Angel V. Ditchev - 1991 - Mathematical Logic Quarterly 37 (19‐22):301-306.

Analytics

Added to PP
2013-11-24

Downloads
46 (#482,869)

6 months
15 (#209,898)

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