- 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
A logic of abstraction related to finite constructive number classes
Archive for Mathematical Logic 31 (1):69-83 (1991)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Analytics
Added to PP
2013-11-23
Downloads
28 (#589,033)
6 months
3 (#1,046,015)
2013-11-23
Downloads
28 (#589,033)
6 months
3 (#1,046,015)
Historical graph of downloads
Author's Profile
Citations of this work
References found in this work
Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
Elementary induction on abstract structures.Yiannis Nicholas Moschovakis - 1974 - Mineola, N.Y.: Dover Publications.
The lambda calculus: its syntax and semantics.Hendrik Pieter Barendregt - 1981 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Toward useful type-free theories. I.Solomon Feferman - 1984 - Journal of Symbolic Logic 49 (1):75-111.
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-68866f4b87-sz9d2 uwo