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 noncommutative-algebra
Search options not deleted
user 3206
Non-commutative rings and algebras, non-associative algebras. Can be used in combination with ra.rings-and-algebras
0
votes
An "Elementary" Math Question Generalized (Ring Theory Perhaps)
Let me suggest the following for the metacognition part of your post, even though that part did not receive the main emphasis.
Plant 10 trees in 5 rows with 4 trees in each row.
I use this example …
- 3,209
4
votes
What do you do if you believe a problem is undecidable?
Joel David Hamkins has given a good answer in the case of (2), where a certain notion when expressed formally in the language of a theory $T$ (and also the negation of this notion) may not be provable …
- 3,209