- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Recursiveness
Studia Logica 33 (2):220-224 (1974)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Samuel Eilenberg and Calvin C. Elgot, recursiveness. [REVIEW]R. Murawski - 1974 - Studia Logica 33:220.
Note on definition of recursiveness.Jiří Hořejš - 1964 - Mathematical Logic Quarterly 10 (8):119-120.
SCC-recursiveness: a general schema for argumentation semantics.Pietro Baroni, Massimiliano Giacomin & Giovanni Guida - 2005 - Artificial Intelligence 168 (1-2):162-210.
Recursiveness of ω‐Operations.Victor L. Selivanov - 1994 - Mathematical Logic Quarterly 40 (2):204-206.
Review of Kleene, λ-Definability and Recursiveness. [REVIEW]Rózsa Péter - 1937 - Journal of Symbolic Logic 2 (1):38-39.
Analytics
Added to PP
2015-02-06
Downloads
0
6 months
0
2015-02-06
Downloads
0
6 months
0
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
Citations of this work
On a theorem of Günter Asser.Cristian S. Calude & Lila Sântean - 1990 - Mathematical Logic Quarterly 36 (2):143-147.
Untersuchungen über Mengentheoretische Gleichungen.Horst Müller - 1973 - Mathematical Logic Quarterly 19 (14‐18):249-264.
Characterization of recursively enumerable sets.Jesse B. Wright - 1972 - Journal of Symbolic Logic 37 (3):507-511.
Comparing Hierarchies of Primitive Recursive Sequence Functions.E. Fachini & A. Maggiolo-Schettini - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (27-32):431-445.
Iterative Characterizations of Computable Unary Functions: A General Method.Stefano Mazzanti - 1997 - Mathematical Logic Quarterly 43 (1):29-38.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-wmc4m dc2