Publication:6077947

{{DISPLAYTITLE:On the complexity of the theory of a computably presented metric structure

DOI10.1007/s00153-023-00884-4arXiv2106.05372OpenAlexW3172934626MaRDI QIDQ6077947

No author found.

Publication date: 27 September 2023

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.05372

zbMATH Keywords

computable analysiscontinuous logicmetric structurescomputable structure theoryhyperarithmetical hierarchy

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Other infinitary logic (03C75) Computable structure theory, computable model theory (03C57) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
• Model theoretic forcing in analysis
• Generic copies of countable structures
• Effective choice for relations and reducibilities in classes of constructive and positive models
• Computable structures and the hyperarithmetical hierarchy
• Can you compute the operator norm?
• UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
• Degrees of and lowness for isometric isomorphism
• Expressive power of infinitary [0, 1-valued logics]
• Computably Isometric Spaces
• Effective model theory vs. recursive model theory
• Operator algebras with hyperarithmetic theory
• COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
• An undecidable linear order that is \(n\)-decidable for all \(n\)