ロード中...

[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...

詳細記述

保存先:
書誌詳細
出版年:Language and Automata Theory and Applications
主要な著者: Bès, Alexis, Choffrut, Christian
フォーマット: Artigo
言語:Inglês
出版事項: 2020
主題:
オンライン・アクセス:https://ncbi.nlm.nih.gov/pmc/articles/PMC7206654/
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-40608-0_8
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!