Related papers: Decidability of All Minimal Models (Revised Versio…

In this paper, an original result in terms of a sufficient condition to test identifiability of nonlinear delayed-differential models with constant delays and multi-inputs is given. The identifiability is studied for the linearized system…

Dependent Object Types (DOT) is a calculus with path dependent types, intersection types, and object self-references, which serves as the core calculus of Scala 3. Although the calculus has been proven sound, it remains open whether type…

The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…

In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…

We present a diagram surveying equivalence or strict implication for properties of different nature (algebraic, model theoretic, topological, etc.) about groups definable in o-minimal structures. All results are well-known and an extensive…

We show that in a locally lambda-presentable category, every lambda(m)-injectivity class (i.e., the class of all the objects injective with respect to some class of lambda-presentable morphisms) is a weakly reflective subcategory determined…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

The purpose of this short note is to present a simplified proof of Serre's modularity conjecture using the strong modularity lifting results currently available. This second version includes extra details on definitions and proofs than the…

Observability is a modelling property that describes the possibility of inferring the internal state of a system from observations of its output. A related property, structural identifiability, refers to the theoretical possibility of…

We study properties of relative modular categories and derive sufficient conditions for their existence. In particular, we derive sufficient conditions for relative pre-modular categories to be non-degenerate and relative modular, and for…

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

We show how the language of Krivine's classical realizability may be used to specify various forms of nondeterminism and relate them with properties of realizability models. More specifically, we introduce an abstract notion of…

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…

We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…

Probabilistic classifiers output a probability distribution on target classes rather than just a class prediction. Besides providing a clear separation of prediction and decision making, the main advantage of probabilistic models is their…

We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for \cas to be number-conserving is proved. Using this condition, we give a linear-time algorithm to…

In this paper we introduce a novel family of decision lists consisting of highly interpretable models which can be learned efficiently in a greedy manner. The defining property is that all rules are oriented in the same direction.…

We prove a constructive existence theorem for abelian envelopes of non-abelian monoidal categories. This establishes a new tool for the construction of tensor categories. As an example we obtain new proofs for the existence of several…

In this review, we examine the problem of designing interpretable and explainable machine learning models. Interpretability and explainability lie at the core of many machine learning and statistical applications in medicine, economics,…

Suppose $M$ is a transitive class size model of $AD_{\mathbb{R}}+``\Theta$ is regular". $M$ is a minimal model of $AD_{\mathbb{R}}+``\Theta$ is measurable" if (i) $\mathbb{R}, Ord\subseteq M$ (ii) there is $\mu\in M$ such that $M\models…