Related papers: Log adjunction: moduli part
A notion of heaps of modules as an affine version of modules over a ring or, more generally, over a truss, is introduced and studied. Basic properties of heaps of modules are derived. Examples arising from geometry (connections, affine…
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…
Given an adjoint pair of functors $F,G$, the composite $GF$ naturally gets the structure of a monad. The same monad may arise from many such adjoint pairs of functors, however. Can one describe all of the adjunctions giving rise to a given…
The postulates of comprehension and extensionality in set theory are based on an inversion principle connecting set-theoretic abstraction and the property of having a member. An exactly analogous inversion principle connects functional…
For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…
The ability to compose code in a modular fashion is important to the construction of large programs. In the logic programming setting, it is desirable that such capabilities be realized through logic-based devices. We describe an approach…
This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of `maximal formula', `segment' and…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…
Let B be the Lie algebra with basis {L_{i,j},C|i,j\in Z} and relations [L_{i,j},L_{k,l}]=((j+1)k-i(l+1))L_{i+k,j+l}+i\delta_{i,-k}\delta_{j+l,-2}C, [C,L_{i,j}]=0. It is proved that an irreducible highest weight B-module is quasifinite if…
In this paper we present a result about analytic functions f defined on the open unit disc and with a finite number of exceptional values containedin the real interval (0, 1). We find an upper bound for the modulus of f' in 0. This bound is…
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…
A sceptical examination of the motivations for strong modal plural logics.
The notion of multiplier Hopf monoid in any braided monoidal category is introduced as a multiplier bimonoid whose constituent fusion morphisms are isomorphisms. In the category of vector spaces over the complex numbers, Van Daele's…
Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initial semantics of LPODs, although simple and quite intuitive,…
Let M(j) denote the moduli space of bundles on the blown-up plane which restrict to the exceptional divisor as O(j)+O(-j). We show that there is a topological embedding of M(j) into M(j+1).
We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…
A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…
Answering complex questions that require multi-step multi-type reasoning over raw text is challenging, especially when conducting numerical reasoning. Neural Module Networks(NMNs), follow the programmer-interpreter framework and design…
Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…