相关论文: Ultraproducts in abstract categorical logic

We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…

Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and…

The logic LAE discussed in this paper is based on an approximate entailment relation. LAE generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are…

We propose the design of novel categorical generative AI architectures (GAIAs) using topos theory, a type of category that is ``set-like": a topos has all (co)limits, is Cartesian closed, and has a subobject classifier. Previous theoretical…

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

We introduce an abstract topos-theoretic framework for building Galois-type theories in a variety of different mathematical contexts; such theories are obtained from representations of certain atomic two-valued toposes as toposes of…

This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC)…

We develop foundations for abstract homotopy theory based on Grothendieck's idea of a "derivator". The theory is model-independent, and does not depend on model categories, nor on simplicial sets. It is designed to accomodate all the usual…

We use Kan injectivity to axiomatise concepts in the 2-category of topoi. We showcase the expressivity of this language through many examples, and we establish some aspects of the formal theory of Kan extension in this 2-category (pointwise…

Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…

Human intelligence relies in part on our brains' ability to create abstract mental models that succinctly capture the hidden blueprint of our reality. Such abstract world models notably allow us to rapidly navigate novel situations by…

At its core, abstraction is the process of generalizing from specific instances to broader concepts or models, with the primary objective of reducing complexity while preserving properties essential to the intended purpose. It is…

The notion of concept has been studied for centuries, by philosophers, linguists, cognitive scientists, and researchers in artificial intelligence (Margolis & Laurence, 1999). There is a large literature on formal, mathematical models of…

We survey various attempts to transport the ultraproduct construction from the realm of model theory to that of general topology.

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

In the framework of superanalysis we get a functions theory close to complex analysis, under a suitable condition (A) on the real superalgebras in consideration. Under the condition (A), we get an integral representation formula for the…

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

A common technique to verify complex logic specifications for dynamical systems is the construction of symbolic abstractions: simpler, finite-state models whose behaviour mimics the one of the systems of interest. Typically, abstractions…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

We define an elementary $\infty$-topos that simultaneously generalizes an elementary topos and Grothendieck $\infty$-topos. We then prove it satisfies the expected topos theoretic properties, such as descent, local Cartesian closure,…