Related papers: Full Definability in a Profunctorial Model
Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…
We initiate the study of profinite rigidity for modules over a Noetherian domain: to what extent are these objects determined by their finite images? We establish foundational statements in analogy to classical results in the category of…
Discriminative classifiers have become a foundational tool in deep learning for medical imaging, excelling at learning separable features of complex data distributions. However, these models often need careful design, augmentation, and…
A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…
We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
Formal deductive systems are very common in computer science. They are used to represent logics, programming languages, and security systems. Moreover, writing programs that manipulate them and that reason about them is important and…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
Stable Model Semantics and Well Founded Semantics have been shown to be very useful in several applications of non-monotonic reasoning. However, Stable Models presents a high computational complexity, whereas Well Founded Semantics is easy…
Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…
Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…
We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) ->…
A stable model category is a setting for homotopy theory where the suspension functor is invertible. The prototypical examples are the category of spectra in the sense of stable homotopy theory and the category of unbounded chain complexes…
We develop a denotational semantics of muLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional muMALL with exponentials. Our general categorical setting is based on the…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…