Lanean...
[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...
Gorde:
| Argitaratua izan da: | Language and Automata Theory and Applications |
|---|---|
| Egile Nagusiak: | , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
2020
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7206654/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-40608-0_8 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|