Lataa...
[Formula: see text] Is Decidable in [Formula: see text]
We show that it is decidable whether or not a relation on the reals definable in the structure [Formula: see text] can be defined in the structure [Formula: see text]. This result is achieved by obtaining a topological characterization of [Formula: see text]-definable relations in the family of [For...
Tallennettuna:
| Julkaisussa: | Language and Automata Theory and Applications |
|---|---|
| Päätekijät: | , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
2020
|
| Aiheet: | |
| Linkit: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7206654/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-40608-0_8 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|