Equipping $L$-structures with topologies.
It seems like we can build interesting structures by equipping the domain of structures with topologies and requiring the interpretation of function symbols to be continuous with respect to the topology.
This seems like an obvious thing to do in order to limit how "wild" a structure can get.
- Does this construction have a name?
- What constraints are typically placed on the interpretation of predicate symbols in this setting and why?
My question is similar to this question but is explicitly about the interpretation of predicate symbols as well. Also, the linked question seems to be about examining particular theories in detail.
Consider $\mathbb{R}$ equipped with its standard topology $\tau$. Consider the language $L$ with symbols $\{+, -, *, 1, 0\}$ and the theory of commutative rings with identity.
We can build a trivial $L$-structure by taking the domain in our structure to be $\mathbb{R}$ and giving each of our function symbols their usual interpretation.
The unary function $-$ is continuous.
For $+$ and $*$, the inverse image of a closed set in $\mathbb{R}$ is closed in $\mathbb{R}\times \mathbb{R}$.
So, our trivial model (which is really just $\mathbb{R}$ thought of as a ring) respects the underlying topology associated with $\mathbb{R}$, which is nice.
The continuity restriction stops us from producing a new equivalent-but-technically-different model by relabeling every element of our domain.
I'm curious what happens if we have predicates as well.
We can do something very ad hoc and insist that predicates be continuous maps into the Sierpiński space $\{\varnothing, \{0\}, \{0, 1\}\}$ and insist that the inverse image of $\{1\}$ is closed in our topology.
If we do this, I think $\le$ would be allowable as a predicate but $<$ would not be, since I'm pretty sure that $(<)^{-1}(\mathrm{true})$ is open in $\mathbb{R} \times \mathbb{R}$.
Anyway, that feels extremely ad hoc, so I'm wondering what the real way of resolving this problem is.