Related papers: On partitioning Kripke frames of finite height
A theorem of Lurie and Pridham establishes a correspondence between formal moduli problems and differential graded Lie algebras in characteristic zero, thereby formalising a well-known principle in deformation theory. We introduce a variant…
For deploying foundation models, practitioners increasingly need prescriptive scaling laws: given a pre training compute budget, what downstream accuracy is attainable with contemporary post training practice, and how stable is that mapping…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…
Let $\mathcal{R}$ be a free Lie conformal algebra of rank $2$ with $\mathbb{C}[\partial]$-basis $\{L,I\}$ and relations \begin{eqnarray*} \left[L_{\lambda} L\right]=(\partial+2 \lambda) (L+I),\ \left[L_{\lambda} I\right]=(\partial+\lambda)…
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
In this article, the projectivity of finitely generated flat modules of a commutative ring are studied from a topological point of view. Then various interesting results are obtained. For instance, it is shown that if a ring has either a…
We investigate lifted inference on ordered domains with predecessor relations, where the elements of the domain respect a total (cyclic) order, and every element has a distinct (clockwise) predecessor. Previous work has explored this…
As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…
Let $k$ be a commutative Noetherian ring and $\underline{\mathscr{C}}$ be a locally finite $k$-linear category equipped with a self-embedding functor of degree 1. We show under a moderate condition that finitely generated torsion…
We consider certain quotient algebras of tensor algebras of bimodules $M$ over a finite-dimensional algebra $R$, and we investigate Frobenius type properties of such algebras. Our main interest is in the case where $M=R^*$, the linear dual…
We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…
Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…
We analyze the computational complexity of admissibility and unifiability with parameters in transitive modal logics. The class of cluster-extensible (clx) logics was introduced in the first part of this series of papers. We completely…
Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…