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 | |
Results tagged with lo.logic
Search options not deleted
user 28104
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.
12
votes
Taking a theorem as a definition and proving the original definition as a theorem
A very basic example is the field $\mathbb{C}$ of complex numbers. -- It can be defined as the field one obtains when adjoining the square root of -1 to $\mathbb{R}$, in which case it needs to be prov …
- 19.6k
12
votes
About the proof of the proposition "there exists irrational numbers a, b such that a^b is ra...
The proposition can also be proved without explicitly knowing any particular irrational number:
Fix a positive rational number $c$. Then for any positive irrational real number number $a$,
the equati …
- 19.6k