Related papers: Transport of finiteness structures and application…

We address the task of deriving fixpoint equations from modal logics characterizing behavioural equivalences and metrics (summarized under the term conformances). We rely on earlier work that obtains Hennessy-Milner theorems as corollaries…

Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.

One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…

Interconnected dynamic systems are a pervasive component of our modern infrastructures. The complexity of such systems can be staggering, which motivates simplified representations for their manipulation and analysis. This work introduces…

An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…

We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…

We review three examples of functors from Lorentzian categories and their applications in finiteness results, singularity theorems and boundary constructions. The third example is a novel functor from the category of ordered measure spaces…

Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

This article is an introduction to the basic generalized category theory used in recent work on an extension of the theory of categories and categorical logic, including parts of topos theory. We discuss functors, equivalences, natural…

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…

We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings,…

We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of…

The present work re-enacts the classical theory of t-structures reducing the classical definition given in *Faisceaux Pervers* to a rather primitive categorical gadget: suitable reflective factorization systems. This translation is only…

We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…

In logic programming, negation can be interpreted in various ways. Probably best known is the concept of "negation as failure", where "$\mathit{not}\, p$" is true if we have no evidence for $p$. On the other hand, strong negation requires…