Related papers: Naturality and Definability III
Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…
We draw the connection between the model theoretic notions of internality and the binding group on one hand, and the Tannakian formalism on the other. More precisely, we deduce the fundamental results of the Tannakian formalism by…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Let $(1)$ be an automorphism on an additive category $\mathcal{B}$, and let $\eta\colon (1)\to {\rm Id}_{\mathcal{B}}$ be a natural transformation satisfying $\eta_{X(1)}=\eta_X(1)$ for any object $X$ in $\mathcal{B}$. We construct a new…
It is well-known that biological phenomena are emergent. Emergent phenomena are quite interesting and amazing. However, they are difficult to be understood. Due to this difficulty, we propose a theory to describe emergence based on a…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
Nuclear effective field theories (EFTs) have been developed over the last quarter-century with considerable impact on the description of light and even medium-mass nuclei. At the core of any EFT is a systematic expansion of observables,…
We introduce and discuss the notion of naturally full functor. The definition is similar to the definition of separable functor: a naturally full functor is a functorial version of a full functor, while a separable functor is a functorial…
The notion of semifunctor between categories, due to S. Hayashi (1985), is defined as a functor that does not necessarily preserve identities. In this paper we study how several properties of functors, such as fullness, full faithfulness,…
We use a semantic interpretation to investigate the problem of defining an expressive but decidable type system with bounded quantification. Typechecking in the widely studied System Fsub is undecidable thanks to an undecidable subtyping…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
Uncertainty may be taken to characterize inferences, their conclusions, their premises or all three. Under some treatments of uncertainty, the inferences itself is never characterized by uncertainty. We explore both the significance of…
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…
Promoting a theory with a finite number of terms into an effective field theory with an infinite number of terms worsens simplicity, predictability, falsifiability, and other attributes often favored in theory choice. However, the…
Fairness in machine learning is of considerable interest in recent years owing to the propensity of algorithms trained on historical data to amplify and perpetuate historical biases. In this paper, we argue for a formal reconstruction of…
The question of when the derived category of a ring satisfies Brown--Adams representability is revisited via studying the transfer of pure homological dimension along definable functors: it is shown that, for any ring, the pure global…
We prove the (2,1)-categorical analogue of the small object argument and give a (2,1)-model structure on the category of small coherent categories, coherent functors and natural isomorphisms. It is induced by a higher dimensional example of…
We characterize $t$-structures in stable $\infty$-categories as suitable quasicategorical factorization systems. More precisely we show that a $t$-structure $\mathfrak{t}$ on a stable $\infty$-category $\mathbf{C}$ is equivalent to a normal…
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…