The Uniformity Principle for -definability

DOI10.1093/logcom/exn033zbMath1157.03013OpenAlexW2144780933MaRDI QIDQ3611727

Oleg V. Kudinov, Margarita Korovina

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn033

zbMATH Keywords

computable analysisuniformity principle\({\Sigma}\)-definabilitycontinuous data typeseffective reasoning about continuous data

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computable structure theory, computable model theory (03C57) Higher-type and set recursion theory (03D65)

Related Items (2)

On the Lattices of Effectively Open Sets ⋮ Computable elements and functions in effectively enumerable topological spaces

This page was built for publication: The Uniformity Principle for  -definability