Related papers: On the computability of cofinal Fra\"iss\'e limits
This is Part I of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. We prove that every Fraisse structure in a finite relational…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…
In this article we prove that stratified spaces and other geometric subfamilies satisfy categorical Fra\"iss\'e properties, a matter that might be of interest for both geometers and logicians. As a motivation we show a new example of a…
Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
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 construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…
A Hopf algebra is co-Frobenius when it has a nonzero integral. It is proved that the composition length of the indecomposable injective comodules over a co-Frobenius Hopf algebra is bounded. As a consequence, the coradical filtration of a…
The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
The standard reduced bar complex B(A) of a differential graded algebra A inherits a natural commutative algebra structure if A is a commutative algebra. We address an extension of this construction in the context of E-infinity algebras. We…
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…
We consider the significant class of holomorphically nondegenerate CR manifolds of finite type that are represented by some weighted homogeneous polynomials and we derive some useful features which enable us to set up a fast effective…
This article is intended to an introductory lecture in material physics, in which the modern computational group theory and the electronic structure calculation are in collaboration. The effort of mathematicians in field of the group…
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…
The notion of age of elements of complex linear groups was introduced by M. Reid and is of importance in algebraic geometry, in particular in the study of crepant resolutions and of quotients of Calabi-Yau varieties. In this paper, we solve…
The objects of study in this paper are Hopf algebras $H$ which are finitely generated algebras over an algebraically closed field and are extensions of a commutative Hopf algebra by a finite dimensional Hopf algebra. Basic structural and…
The \textit{age} of a relational structure $\mathfrak A$ of signature $\mu$ is the set $age(\mathfrak A)$ of its finite induced substructures, considered up to isomorphism. This is an ideal in the poset $\Omega_\mu$ consisting of finite…