Related papers: Trace definability I: preservation and characteriz…
In this paper we relate triangulated category structures to the cohomology of small categories and define initial obstructions to the existence of an algebraic or topological enhancement. We show that these obstructions do not vanish in an…
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…
We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
Trees -- i.e., the type of data structure known under this name -- are central to many aspects of knowledge organization. We investigate some central design choices concerning the ontological modeling of such trees. In particular, we…
We develop the theory of trace modules up to isomorphism and explore the relationship between preenveloping classes of modules and the property of being a trace module, guided by the question of whether a given module is trace in a given…
The first examples of formations which are arboreous (and therefore Hall) but not freely indexed (and therefore not locally extensible) are found. Likewise, the first examples of solvable formations which are freely indexed and arboreous…
The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for example, ontology versioning, ontology modularization,…
We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…
We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…
We provides some new equivalent forms of collection principle over some very weak set theories after reviewing the existing ones.
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal languages without labels on transitions or atomic propositions on…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and…
In this paper, we give a generalization for weakly primary submodules called $I$-primary submodule and we study some properties of it. We give some characterizations of $I$-primary submodules. Also we establish the situation of $I$-primary…
In this chapter we characterize Askey-Wilson polynomials including specific and limiting cases of them by some structure relations of the first type.
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
This paper deals with three tools to compare proof-theoretic strength of formal arithmetical theories: interpretability, $\Pi^0_1$-conservativity and proving restricted consistency. It is well known that under certain conditions these three…