- 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
Provable computable selection functions on abstract structures
In Peter Aczel, Harold Simmons & Stanley S. Wainer (eds.), Proof theory: a selection of papers from the Leeds Proof Theory Programme, 1990. New York: Cambridge University Press. pp. 275 (1992)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Proof theory: a selection of papers from the Leeds Proof Theory Programme, 1990.Peter Aczel, Harold Simmons & Stanley S. Wainer (eds.) - 1992 - New York: Cambridge University Press.
General Proof Theory: Introduction.Thomas Piecha & Peter Schroeder-Heister - 2019 - Studia Logica 107 (1):1-5.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
A proof‐theoretic metatheorem for tracial von Neumann algebras.Liviu Păunescu & Andrei Sipoş - 2023 - Mathematical Logic Quarterly 69 (1):63-76.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
Uniformly reflexive structures: towards an abstract theory of computability.Eric Gerhardt Wagner - 1963 - [New York: [S.N.].
The elementary computable functions over the real numbers: applying two new techniques. [REVIEW]Manuel L. Campagnolo & Kerry Ojakian - 2008 - Archive for Mathematical Logic 46 (7-8):593-627.
Intuitionistic completeness of first-order logic.Robert Constable & Mark Bickford - 2014 - Annals of Pure and Applied Logic 165 (1):164-198.
Propositions in Prepositional Logic Provable Only by Indirect Proofs.Jan Ekman - 1998 - Mathematical Logic Quarterly 44 (1):69-91.
Analytics
Added to PP
2014-01-31
Downloads
14 (#1,287,610)
6 months
1 (#1,892,942)
2014-01-31
Downloads
14 (#1,287,610)
6 months
1 (#1,892,942)
Historical graph of downloads
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-648784bb4d-ls7fw uwo