Positive predicate structures for continuous data
From MaRDI portal
Publication:5740676
DOI10.1017/S0960129513000315zbMath1361.68069OpenAlexW2012253765MaRDI QIDQ5740676
Oleg V. Kudinov, Margarita Korovina
Publication date: 27 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129513000315
Data structures (68P05) Theory of numerations, effectively presented structures (03D45) Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75)
Related Items
Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Nonlinear Schrödinger equation and the hyperbolization method ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Computable Model Theory over the Reals
Cites Work
- Unnamed Item
- Unnamed Item
- First-order definability on finite structures
- Computability on subsets of metric spaces.
- Computability on computable metric spaces
- On Σ‐definability without equality over the real numbers
- Towards Computability over Effectively Enumerable Topological Spaces
- The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
This page was built for publication: Positive predicate structures for continuous data
