Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
History and philosophy of mathematics, biographies of mathematicians, mathematics education, recreational mathematics, communication of mathematics.
8
votes
Hilbert's and Gödel's expanded definition of "Recursive Function"
In Recursive predicates and quantifiers (Trans. Amer. Math. Soc. 53 (1943), 41-73) Kleene gives a description of general recursive functions acording to Herbrand and Gödel, as understood before the pa …
18
votes
What's the earliest result (outside of logic) that cannot be proven constructively?
According to Wikipedia, in 5th century BCE, Bryson of Heraclea spoke of a special case of the intermediate value theorem. If we're very generous, that would be an early occurrence of a constructively …
3
votes
Accepted
Nonconstructive reasoning in Skolem's proof of the Löwenheim-Skolem Theorem
If I understand the proof correctly, it uses the following fact:
Statement: A monotone sequence $b : \mathbb{N} \to \{0,1\}$ stabilizes, i.e., there is $d \in \{0, 1\}$ and $n$ such that $b_m = d$ …
11
votes
Accepted
What did the Intuitionists want to do with applied mathematics?
What did the logicians of the 20th century think? Perhaps this was best described by Michael Beeson in his book ("Foundations of constructive mathematics: metamathematical studies", 1985, Springer):
…
29
votes
Bishop quote stating that axiom of choice is constructively valid
According to the BHK interpretation of intuitionistic logic we have that:
A proof of $\exists x \in A . \phi(x)$ consists of a pair $(a, p)$ where $a \in A$ and $p$ is a proof of $\phi(a)$.
A proof …
9
votes
Accepted
Did Brouwer evade uncountability?
You are probably referring to Brouwer's considerations of the Creative Subject, which can be formulated mathematically as Kripke's schema. It implies that all subsets of $\mathbb{N}$ are countable, fo …
10
votes
Salvaging Leibnizian formalism?
You seem to think that synthetic differential geometry only handles squarenil infinitesimals, but this is not so. The generalized Kock-Lawvere axiom allows us to work with infinitesimals of any order, …
13
votes
Was the early calculus inconsistent?
I do not know whether the early calculus was consistent, but it surely can be made as consistent as modern mathematics, with practically no modifications of the basic setup. This goes under the name S …
23
votes
Mathematicians whose works were criticized by contemporaries but became widely accepted later
Brouwer's intuitionistic mathematics was heavily criticized by his contemporaries, most notably Hilbert. For almost a century it was casually ridiculed by mathematicians who had no clue whatsoever abo …
38
votes
Logic in mathematics and philosophy
It is easier to list the differences than similarities between the two kinds of logic.
Mathematical logic is the branch of mathematics that studies mathematical activity. It has all the usual propert …
25
votes
"Let $x \in A$", beginning a proof of "$\forall x \in A$ ...", if A were empty
Please print this and hang it on your office door for your colleagues to see.
The inference rule for $\forall x \in A . \phi(x)$ is as follows (in natural deduction style):
$$\frac{\begin{matrix}[x\i …