相关论文: Explaining Gabriel-Zisman localization to the comp…
Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the…
This file proves the properties of the angle constraints and shows how to construct displacement constraints by various kinds of relative measurements.
Quillen's localization theorem is well known as a fundamental theorem in the study of algebraic K-theory. In this paper, we present its arithmetic analogue for the equivariant K-theory of arithmetic schemes, which are endowed with an action…
We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…
Throughout this paper $G$ is a fixed group, and $k$ is a fixed field. All categories are assumed to be $k$-linear. First we give a systematic way to induce $G$-precoverings by adjoint functors using a 2-categorical machinery, which unifies…
In this Letter, we introduce a notion of local fraction for experiments taking place against arbitrary static causal backgrounds -- greatly generalising previous results on no-signalling scenarios -- and we explicitly formulate a linear…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Verifying software correctness has always been an important and complicated task. Recently, formal proofs of critical properties of algorithms and even implementations are becoming practical. Currently, the most powerful automated proof…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
For the purposes of computational dialectology or other geographically bound text analysis tasks, texts must be annotated with their or their authors' location. Many texts are locatable through explicit labels but most have no explicit…
An algorithmic proof of General Neron Desingularization is given here for one dimensional local domains and it is implemented in \textsc{Singular}. Also a theorem recalling Greenberg' strong approximation theorem is presented for one…
The present article is devoted to the description of further investigations of the author of this article. These investigations (in terms of various representations of real numbers) include the generalized Salem functions and…
We present the proof assistant homotopy.io for working with finitely-presented semistrict higher categories. The tool runs in the browser with a point-and-click interface, allowing direct manipulation of proof objects via a graphical…
This is the introductory chapter to the volume. We review the main idea of the localization technique and its brief history both in geometry and in QFT. We discuss localization in diverse dimensions and give an overview of the major…
The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…
In the present paper we discuss some recent versions of localisation methods for calculations in the groups of points of algebraic-like and classical-like groups. Namely, we describe relative localisation, universal localisation, and…
We introduce a notion of representation for a class of generalised quivers known as Coxeter quivers. These representations are built using fusion categories associated to $U_q(\mathfrak{s}\mathfrak{l}_2)$ at roots of unity and we show that…
For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to…
The purpose of this paper is to establish the foundations of multi-microlocalization, in particular, to give the fiber formula for the multi-microlocalization functor and estimate of microsupport of a multi-microlocalized object. We also…
In group representations several inductions given by tensoring with appropriate bimodules may be reconstructed via homology of $G$-posets with $G$-equivariant coefficients. For this purpose, we need various local categories of a finite…