- Submit
-
Browse
- 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
- More
Switch to: References
Citations of:
The impredicativity of induction
In Michael Detlefsen (ed.), Proof, Logic and Formalization. London, England: Routledge. pp. 139--161 (1992)
Add citations
You must login to add citations.
|
|
|
Prominent constructive theories of sets as Martin-Löf type theory and Aczel and Myhill constructive set theory, feature a distinctive form of constructivity: predicativity. This may be phrased as a constructibility requirement for sets, which ought to be finitely specifiable in terms of some uncontroversial initial “objects” and simple operations over them. Predicativity emerged at the beginning of the 20th century as a fundamental component of an influential analysis of the paradoxes by Poincaré and Russell. According to this analysis the paradoxes (...) |
|
|
Predicativity is a notable example of fruitful interaction between philosophy and mathematical logic. It originated at the beginning of the 20th century from methodological and philosophical reflections on a changing concept of set. A clarification of this notion has prompted the development of fundamental new technical instruments, from Russell's type theory to an important chapter in proof theory, which saw the decisive involvement of Kreisel, Feferman and Schütte. The technical outcomes of predica-tivity have since taken a life of their own, (...) |
|
|
Frege's work was largely devoted to an attempt to argue that the'basic laws of arithmetic' are truths of logic. That attempt had both philosophical and formal aspects. The present note offers an introduction to both of these, so that readers will be able to appreciate contemporary discussions of the philosophical significance of 'Frege's Theorem'. |
|
|
According to the realist, the meaning of a declarative, non-indexical sentence is the condition under which it is true and the truth-condition of an undecidable sentence can obtain or fail to obtain independently of our capacity, even in principle, to recognize that it obtains or that fails to do so.1 In a series of papers, beginning with “Truth” in 1959, Michael Dummett challenged the position that the classical notion of truth-condition occupied as the central notion of a theory of meaning, (...) |
|
|
This book explores the interplay between logic and science, describing new trends, new issues and potential research developments. |
|
|
Does science justify any part of mathematics and, if so, what part? These questions are related to the so-called indispensability arguments propounded, among others, by Quine and Putnam; moreover, both were led to accept significant portions of set theory on that basis. However, set theory rests on a strong form of Platonic realism which has been variously criticized as a foundation of mathematics and is at odds with scientific realism. Recent logical results show that it is possible to directly formalize (...) |
|
|
Recently, Feferman and Hellman (and Aczel) showed how to establish the existence and categoricity of a natural number system by predicative means given the primitive notion of a finite set of individuals and given also a suitable pairing function operating on individuals. This short paper shows that this existence and categoricity result does not rely (even indirectly) on finite-set induction, thereby sustaining Feferman and Hellman's point in favor of the view that natural number induction can be derived from a very (...) |
|
|
|
|
|
|
|
|
In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) |
|
|
|
|
|
|
|
|
|
|
|
Wilfred Sieg. Relative Consistency and Accesible Domains. |
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-6f97f49787-kd5kv uwo