☆ 3.9 Article

On the complexity of the theory of a computably presented metric structure

ARCHIVE FOR MATHEMATICAL LOGIC (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Computer Science, Theory & Methods

Operator algebras with hyperarithmetic theory

Isaac Goldbring et al.

Summary: The study demonstrates that various operator algebras have hyperarithmetic theory, including hyperfinite II1 factor, C* for finitely generated groups with solvable word problems, and C-lambda* for finitely generated groups with solvable word problems. It also shows that Cuntz algebra O-2 has hyperarithmetic theory under the condition that the Kirchberg embedding problems have affirmative answers. Lastly, it proves that if there exist existentially closed II1 factors or C*-algebras without hyperarithmetic theory, there are continuum many theories of existentially closed II1 factors or C*-algebras.

JOURNAL OF LOGIC AND COMPUTATION (2021)

添加到收藏夹

Article Mathematics

COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM

Matthew Harrison-Trainor et al.

JOURNAL OF SYMBOLIC LOGIC (2020)

添加到收藏夹

Article Logic

Degrees of and lowness for isometric isomorphism

Johanna N. Y. Franklin et al.

JOURNAL OF LOGIC AND ANALYSIS (2020)

添加到收藏夹

Article Mathematics

UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES

Noam Greenberg et al.

JOURNAL OF SYMBOLIC LOGIC (2018)

添加到收藏夹

Article Mathematics

Index Sets for n-Decidable Structures Categorical Relative to m-Decidable Presentations

E. B. Fokina et al.

ALGEBRA AND LOGIC (2015)

添加到收藏夹

Article Mathematics, Applied

CAN YOU COMPUTE THE OPERATOR NORM?

Tobias Fritz et al.

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY (2014)

添加到收藏夹

Article Mathematics

COMPUTABLY ISOMETRIC SPACES

Alexander G. Melnikov

JOURNAL OF SYMBOLIC LOGIC (2013)

添加到收藏夹

Article Mathematics, Applied

Model theoretic forcing in analysis

Itai Ben Yaacov et al.

ANNALS OF PURE AND APPLIED LOGIC (2009)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.