Related papers: Fibered Universal Algebra for First-Order Logics
In various subjects including mathematics, one can hope to use mathematical thinking well when the right kinds of algebraic structure to consider can be discovered or spotted. Therefore, it would help to understand kinds of algebraic…
Principia Logico-Metaphysica contains a foundational logical theory for metaphysics, mathematics, and the sciences. It includes a canonical development of Abstract Object Theory [AOT], a metaphysical theory (inspired by ideas of Ernst…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
After reviewing the multiple roles of toposes - as generalized topological spaces, as universal invariants, as categorical analogues of the set-theoretic universe, and as semantic environments for first-order theories - we recall the notion…
We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security:…
The two pillars of rational conformal field theory and rational vertex operator algebras are modularity of characters on the one hand and its interpretation of modules as objects in a modular tensor category on the other one. Overarching…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
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,…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
We prove that a weak equivalence between cofibrant props induces a weak equivalence between the associated classifying spaces of algebras. This statement generalizes to the prop setting a homotopy invariance result which is well known in…
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem…
In every variety of algebras $\Theta$ we can consider its logic and its algebraic geometry. In the previous papers geometry in equational logic, i.e., equational geometry has been studied. Here we describe an extension of this theory…
This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…
We define the notion of rational closure in the context of Description Logics extended with a tipicality operator. We start from ALC+T, an extension of ALC with a typicality operator T: intuitively allowing to express concepts of the form…
We prove that the category of algebras over a cofibrant operad admits a closed model category structure. This leads to the notion of "virtual operad algebra" - the algebra over a cofibrant resolution of the given operad. In particular,…
In general, all constructions of algebraic topology are functorial; the notions of category, functor and natural transformation originated here. The arrow categories are more simple forms of the \emph{comma} categories and were introduced…
We design various logics for proving hyper properties of iterative programs by application of abstract interpretation principles. In part I, we design a generic, structural, fixpoint abstract interpreter parameterized by an algebraic…
Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik…