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 36985
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.
1
vote
Verification of Turing-equivalent automata
An often-cited example of a very basic program, for which termination is open, is one that generates the Collatz sequence. In pseudo-code:
collatz(int n)
while (n > 1)
if (n mod 2 == 0)
…
- 236
3
votes
Accepted
A variant of Kruskal's theorem
To reformulate your question, given a wqo $(A,\leq)$, here finite trees with the minor ordering, you ask whether $({\mathcal P}_\mathrm{fin}(A),\sqsubseteq)$ the set of finite subsets of $A$ with a `m …
- 236
5
votes
What ordinal corresponds to the T(3)?
If Player 1 moves first, Player 2 wins the game if and only if $\alpha\leq o(T(3))$, where $o$ denotes the maximal order type of the well-quasi-order $T(3)$. This ordinal was studied by Diana Schmidt …
- 236