Related papers: A Finitely Supported Frame for the Turing Schmerl …
We prove a Torelli theorem for the moduli space of semistable parabolic Higgs bundles over a smooth complex projective algebraic curve under the assumption that the parabolic weight system is generic. When the genus is at least two, using…
As a generalization of the ring spectrum of topological modular forms, we construct a graded ring spectrum of topological Jacobi forms, $\operatorname{TJF}_*$. This is constructed as the global sections of a sheaf of $E_\infty$-ring spectra…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
TMs are a pattern recognition approach that uses finite state machines for learning and propositional logic to represent patterns. In addition to being natively interpretable, they have provided competitive accuracy for various tasks. In…
This paper studies the modal logical aspects of provability predicates and consistency statements for theories of arithmetic. First, we provide an overview of previous works on the correspondence between various derivability conditions for…
In semantic segmentation, generalizing a visual system to both seen categories and novel categories at inference time has always been practically valuable yet challenging. To enable such functionality, existing methods mainly rely on either…
We present a new uniform method for studying modal companions of superintuitionistic rule systems and related notions, based on the machinery of stable canonical rules. Using this method, we obtain alternative proofs of the Blok-Esakia…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
We develop the operational semantics of an untyped probabilistic lambda-calculus with continuous distributions, as a foundation for universal probabilistic programming languages such as Church, Anglican, and Venture. Our first contribution…
We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…
The aim of this paper is to extend the structure theory for infinitely generated modules over tame hereditary algebras to the more general case of modules over concealed canonical algebras. Using tilting, we may assume that we deal with…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
We study the computational power of the Full-Tilt model of motion planning, where slidable polyominos are moved maximally around a board by way of a sequence of directional ``tilts.'' We focus on the deterministic scenario in which the…
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…
Given a field $K$ and an ample (not necessarily Hausdorff) groupoid $G$, we define the concept of a line bundle over $G$ inspired by the well known concept from the theory of C*-algebras. If $E$ is such a line bundle, we construct the…
We introduce a new moduli stack, called the Serre stable moduli stack, which corresponds to studying families of point objects in an abelian category with a Serre functor. This allows us in particular, to re-interpret the classical derived…
The aim of the paper is to study the topological modal logic of $T_0$ spaces, with the difference modality (for $T_n$, where $n\geq1 $ the corresponding logics were known). We consider propositional modal logic with two modal operators…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
Distributed systems are critical to reliable and scalable computing; however, they are complicated in nature and prone to bugs. To modularly manage this complexity, network middleware has been traditionally built in layered stacks of…