- 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
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
This paper is concerned with notions of consequence. On the one hand, we study admissible consequence, specifically for substitutions of Σ 1 0 -sentences over Heyting arithmetic . On the other hand, we study preservativity relations. The notion of preservativity of sentences over a given theory is a dual of the notion of conservativity of formulas over a given theory. We show that admissible consequence for Σ 1 0 -substitutions over HA coincides with NNIL -preservativity over intuitionistic propositional logic . (...) |
|
|
|
|
|
There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) |
|
|
There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) |
|
|
Effective inseparability of pairs of sets is an important notion in logic and computer science. We study the effective inseparability of sets which appear as index sets of subsets of an effectively given topological T0-space and discuss its consequences. It is shown that for two disjoint subsets X and Y of the space one can effectively find a witness that the index set of X cannot be separated from the index set of Y by a recursively enumerable set, if X (...) |
|
|
Ishiharaʼs boundedness principleBD-N was introduced in Ishihara [5] and has turned out to be most useful for constructive analysis, see e.g. Ishihara [6]. It is equivalent to the statement that every sequentially continuous function from NN to N is continuous w.r.t. the usual metric topology on NN. We construct models for higher order arithmetic and intuitionistic set theory in which both every function from NN to N is sequentially continuous and in which the axiom of choice from NN to N (...) |
|
|
No categories |
|
|
Uniform sequential continuity, a property classically equivalent to sequential continuity on compact sets, is shown, constructively, to be a consequence of strong continuity on a metric space. It is then shown that in the case of a separable metric space, uniform sequential continuity implies strong continuity if and only if one adopts a certain boundedness principle that, although valid in the classical, recursive and intuitionistic setting, is independent of Heyting arithmetic. |
|
|
|
|
|
|
|
|
|
|
|
There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) |
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-7c76586df8-l2pxr uwo