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 |
first-order and higher-order logic, model theory, set theory, proof theory, computability theory, formal languages, definability, interplay of syntax and semantics, constructive logic, intuitionism, philosophical logic, modal logic, completeness, Gödel incompleteness, decidability, undecidability, theories of truth, truth revision, consistency.
11
votes
What can be preserved in mathematics if all constructions are carried out in ZF?
One of the standard texts which presents functional analysis only based on ZF+DC is the monograph (consisting of 3 volumes) Henry G. Garnir, Marc de Wilde, and Jean Schmets, Analyse Fonctionnelle.
Als …
4
votes
Simpler proofs using the axiom of choice
For an orthomorphism $A$ in a (real or complex) Banach lattice $X$ the formula $\lvert A\rvert x=\lvert Ax\rvert$ for $x\ge0$ can be obtained relatively quickly if one uses the fact that $X$ is order …
2
votes
Standard models of N and R: An Alice/Bob approach
This is way too long for a remark, therefore I post it as an answer.
Although I agree with the previous answers that there is probably no clear “intended” model of set theory, there are perhaps two pr …
1
vote
The Tarski-Lindenbaum theorem of the middle value
Not a very satisfactory answer, but some considerations to the proof of the MV theorem:
One might think that analogously to the proof of CBS (see e.g. Joel David Hamkins answer how to use KT for that …