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 |
Questions of the kind "What's the name for a X that satisfies property Y?"
6
votes
Accepted
Do you need to say what left-unique and right-unique means?
Injective and functional are completely standard in this case. This is what you should use. The term "functional" is not overloaded, when you are using it to say that something is a function. Being fu …
11
votes
Is there a name for this property of a topology?
In spaces where singleton points are closed, your property is equivalent to saying that the space has no isolated points. Or in other words, that it is perfect.
Clearly, no space with an isolated po …
3
votes
Accepted
What to call substructures in universal algebra in which we restrict the signature?
Having needed this concept in a recent article, I used the term reduct substructure in exactly this situation, but I haven't seen this terminology elsewhere and I don't think there is an established terminology …
61
votes
Naming in math: from red herrings to very long names
Let me mention as a counterpoint that there is less need for
new terminology than one might expect. … Mathematical exposition
is often more successful and clearer without new terminology, and
one should consider whether one needs any new terminology at all. …
6
votes
Accepted
Terminology for posets.
A partial order with no infinite descending chains is said to be well-founded. Every well-founded partial order admits an ordinal ranking function, an assignment of nodes in the order to ordinals, suc …
21
votes
Accepted
What is Gödel's pairing function on ordinals?
Define an order on pairs of ordinals $(\alpha,\beta)$ by ordering first by maximum, then by first coordinate, then by second coordinate. That is, one pair preceeds another if the maximum is smaller, o …
4
votes
Accepted
Terminology for generalized relations
This is called an $L$-valued relation, when $L$ is the target of the function, which can be viewed as the collection of possible truth values.
Thus, a $2$-valued relation is just an ordinary relatio …
9
votes
Subscript 0 in Reverse Mathematics
The subscript $0$ is meant to indicate the amount of induction that the theory has.
The wikipedia entry on Reverse mathematics says of the big five theories of reverse mathematics that
The …
5
votes
Is there a name for this equivalence relation?
The elements of this partition are precisely the atoms of the complete Boolean algebra generated by the family.
6
votes
Accepted
Effectively closed computable functions
I like your concept a lot, and have been able to find a characterization.
Suppose that $f:N\to N$ is effectively closed in your sense.
First, as you mentioned, it is easy to see that $\text{ran}(f)$ …
16
votes
Accepted
What gets to be called a "proper class?"
The term "class" is not a technical term with a universally definite meaning, but there are various established meanings in various contexts.
In ZFC the established usage as Wojowu mentions in the com …
3
votes
Accepted
Does this axiom (a weak form of class valued choice) has a name?
In weak set theories, using classical logic and interpreting
"small subclass" as "set", this principle amounts to an
alternative formulation of the collection axiom. For example, in
Zermelo set theory …
6
votes
Accepted
Does this property of a first-order structure imply categoricity?
The answer is no for uncountable cardinals $\kappa$. Let $\mathfrak{A}=\langle A,U\rangle$ be a set $A$ of size $\kappa$ with a unary predicate $U\subset A$, where $U$ and $A-U$ both have size $\kappa …
4
votes
Accepted
Strings and "co-subsequences"
Since you are taking the complement of a substring, and it appears that there may be no firmly established terminology, I propose:
a substring complement is what remains after deleting a substring, … I would prefer this natural language terminology over the alternative co-substring and co-subsequence, which sound unnecessarily technical to my ear, but this difference may be slight. …
11
votes
Terminology about trees
In that terminology, trees of your first kind are known as the well-founded trees, since they are trees where the tree order is well-founded (and well-founded linear orders are the same as well-orders) … I think that the situation is that because set theorists are mainly interested in the well-founded case, the terminology evolved to drop the adjective from well-founded trees. …