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 120914
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.
4
votes
Accepted
Computable change in minimum word length of subgroup elements
I'll put my comment here, so that the question has an answer.
The function $\operatorname{len}_H$ is what is called an actual distortion function (for $H$ in $G$) by Margolis, Meakin & Šuniḱ (see [1]) …
10
votes
Appearance of proof relevance in "ordinary mathematics?"
Proof mining (which even has a short Wikipedia article!), and area in large part developed by Kohlenbach, is mentioned briefly in the comments, and I thought it deserves a bigger mention. Roughly spea …
4
votes
A “mother of all groups”? What kind of structures have "mother of all"s?
For finitely presented simple groups, there are the existentially closed groups. These groups are groups $M$ for which any equation or inequality definable over $M$ has a solution in $M$. These have m …