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 7092
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.
18
votes
Accepted
Why don't Zeilberger and Gosper's algorithms contradict Richardson's theorem?
(Comment turned into an answer:)
It's as simple as "the composition of hypergeometric terms is not hypergeometric". $f(n)=2^n$ is a hypergeometric term because $\frac{f(n+1)}{f(n)}=2$ is a rational te …
- 157
0
votes
Can transfinite induction be defined as axiom scheme in FOL on bin-tree structures?
Assuming I understand your comment right, I don't know that binary trees are enough to get there, but arbitrary finite trees should certainly be. One natural induction-esque principle on trees would …
- 1,951