Related papers: Enriched positive logic
Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…
A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…
Counting propositional logic was recently introduced in relation to randomized computation and shown able to logically characterize the full counting hierarchy. In this paper we aim to clarify the intuitive meaning and expressive power of…
The complete enriched Lie algebras constitue the natural extension of graded Lie algebras for connected spaces. Each complete enriched Lie algebra is the rational homotopy Lie algebra of a connected space. This text is the first part of a…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…
This expository article brings together two subjects: generalised metrics based on enriched categories, on the one hand, and Lorentz manifolds, on the other, at the price of dealing with details that are well known either in category theory…
Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…
We develop a theory of weighted colimits in the framework of weakly bienriched $\infty$-categories, an extension of Lurie's notion of enriched $\infty$-categories. We prove an existence result for weighted colimits, study weighted colimits…
We consider the one-variable fragment of first-order logic extended with Presburger constraints. The logic is designed in such a way that it subsumes the previously-known fragments extended with counting, modulo counting or cardinality…
We prove that an enriched $\infty$-category is completely determined by its enriched presheaf category together with a `marking' by the representable presheaves. More precisely, for any presentably monoidal $\infty$-category $\mathcal{V}$…
The performance of relation extraction models has increased considerably with the rise of neural networks. However, a key issue of neural relation extraction is robustness: the models do not scale well to long sentences with multiple…
Real-valued logics have seen a renewed interest in verification for probabilistic and quantitative systems, in particular machine learning models, where they can be used to directly integrate specifications in the training objective. To do…
This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…
The Logic of Approximate Entailment (LAE) is a graded counterpart of classical propositional calculus, where conclusions that are only approximately correct can be drawn. This is achieved by equipping the underlying set of possible worlds…
We establish the feasibility of investigating the theory of $R\text{-}\mathrm{Mod}$-enriched categories, for any commutative and unitary ring $R$, through the framework of $\mathbb{A}\mathrm{b}$-enriched category theory. In particular, we…
This paper provides a comprehensive overview of some of the foundational properties of categories enriched over quantaloids, along with several new results. We demonstrate that the category whose objects are quantaloid-enriched categories…
A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…
We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…