Related papers: Computable structures of rank omega_1^{CK}
In this paper we determine all the Hopf q-brace structures on rank one pointed Hopf algebras and compute the socle of each one of them. We also identify which among them are Hopf skew-braces. Then we determine when two Hopf q-brace…
If $\mathcal{N}$ is a proper Polish metric space and $\mathcal{M}$ is any countable dense submetric space of $\mathcal{N}$, then the Scott rank of $\mathcal{N}$ in the natural first order language of metric spaces is countable and in fact…
Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
We define a discrete closure operation for definably complete locally o-minimal structures $\mathcal M$. The pair of the underlying set of $\mathcal M$ and the discrete closure operation forms a pregeometry. We define the rank of a…
We consider different classes of combinatory structures related to Krivine realizability. We show, in the precise sense that they give rise to the same class of triposes, that they are equivalent for the purpose of modeling higher-order…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive types equipped with higher-order primitive…
We show that one can use model categories to construct rational orthogonal calculus. That is, given a continuous functor from vector spaces to based spaces one can construct a tower of approximations to this functor depending only on the…
We give an example of a unital C*-algebra $\mathbf{A}$ with a computable presentation and for which neither $K_0(\mathbf{A})$ nor $K_1(\mathbf{A})$ has a computable presentation.
Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…
Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
We introduce a concept of the bounded rank (with respect to a positive constant) for unital C*-algebras as a modification of the usual real rank and present a series of conditions insuring that bounded and real ranks coincide. These…
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We present a Representer Theorem result for a large class of weak formulation problems. We provide examples of applications of our formulation both in traditional machine learning and numerical methods as well as in new and emerging…
In article the basic principles put in a basis of algorithmicallysoftware of hypercomplex number calculations, structure of a software, structure of functional subsystems are considered. The most important procedures included in subsystems…
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based algorithm for satisfiability checking w.r.t. forest logic…