相关论文: The complexity of the Structure and Classification…
We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic…
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
We prove that it is not possible to classify separable von Neumann factors of types $\II_1$, $\II_\infty$ or $\III_\lambda$, $0\leq \lambda\leq1$, up to isomorphism by a Borel measurable assignment of "countable structures" as invariants.…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may "compute the hard or even the…
We announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for…
Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…
We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…
We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…
We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…