Related papers: Linear Hyperdoctrines and Comodules
Representations over diagrams of abelian categories unify quite a few notions appearing widely in literature such as representations of categories, presheaves of modules over categories, representations of species, etc. In this series of…
Computational studies of basic models of strongly-correlated electron systems can provide guidance in the search for new materials as well as insight into the physical mechanisms responsible for their properties. Here, we illustrate this by…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
Higher-order constructs extend the expressiveness of first-order (Constraint) Logic Programming ((C)LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C)LP systems helping programmers…
Following analogous constructions for Lie algebras, we define Whittaker modules and Whittaker categories for finite-dimensional simple Lie superalgebras. Results include a decomposition of Whittaker categories for a Lie superalgebra…
Linear Logic refines Intuitionnistic Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various frameworks. The most famous are indexed linear logics which…
Ontologies are a popular way of representing domain knowledge, in particular, knowledge in domains related to life sciences. (Semi-)automating the process of building an ontology has attracted researchers from different communities into a…
In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…
Application domains that require considering relationships among objects which have real-valued attributes are becoming even more important. In this paper we propose NeuralLog, a first-order logic language that is compiled to a neural…
Combining higher-order abstract syntax and (co)induction in a logical framework is well known to be problematic. Previous work described the implementation of a tool called Hybrid, within Isabelle HOL, which aims to address many of these…
We give a presentation theorem for continuous first-order logic and Metric Abstract Elementary classes in terms of $L_{\omega_1, \omega}$ and Abstract Elementary Classes, respectively. This presentation is accomplished by analyzing dense…
Higher-order network analysis uses the ideas of hypergraphs, simplicial complexes, multilinear and tensor algebra, and more, to study complex systems. These are by now well established mathematical abstractions. What's new is that the ideas…
First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus. In addition to the fragment of MILL1 which corresponds to the Lambek calculus (of Moot & Piazza 2001), I will show fragments…
We describe a conjecture on the algebra of higher cohomology operations which leads to the computations of the differentials in the Adams spectral sequence. For this we introduce the notion of an n-th order track category which is suitable…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a new theory required for each variation of the language or of…
Graded bundles are a class of graded manifolds which represent a natural generalisation of vector bundles and include the higher order tangent bundles as canonical examples. We present and study the concept of the linearisation of graded…
We develop a purely combinatorial theory of limit linear series on metric graphs. This will be based on the formalisms of hypercube rank functions and slope structures. We provide a full classification of combinatorial limit linear series…
This is the first paper in a series that studies smooth relative Lie algebra homologies and cohomologies based on the theory of formal manifolds and formal Lie groups. In this paper, we lay the foundations for this study by introducing the…
We define a family of structures called "opetopic algebras", which are algebraic structures with an underlying opetopic set. Examples of such are categories, planar operads, and Loday's combinads over planar trees. Opetopic algebras can be…