Related papers: Generic partiality for $\frac{3}{2}$-institutions
We discuss two different systems of number representations that both can be called 'base 3/2'. We explain how they are connected. Unlike classical fractional extension, these two systems provide a finite representation for integers. We also…
It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
The symbol is used to describe the Springer correspondence for the classical groups. We propose equivalent definitions of symbols for rigid partitions in the $B_n$, $C_n$, and $D_n$ theories uniformly. Analysing the new definition of symbol…
Metamorphism is a recently introduced integral transform, which is useful in solving partial differential equations. Basic properties of metamorphism can be verified by direct calculations. In this paper we present metamorphism as a sort of…
We consider two relations on a $\cap$-semigroup of partial functions of a given set: the inclusion of domains and the semiadjacencity (i.e., the inclusion of the image of the first function into the domain of the second), which…
We formulate a division problem for a class of overdetermined systems introduced by L. H{\"o}rmander, and establish an effective divisibility criterion. In addition, we prove a coherence theorem which extends Nadel's coherence theorem from…
Recently, J.~T.~Denniston, A.~Melton, and S.~E.~Rodabaugh introduced a lattice-valued analogue of the concept of institution of J.~A.~Goguen and R.~M.~Burstall, comparing it, moreover, with the (lattice-valued version of the) notion of…
Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…
Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…
Computer programs are often factored into pure components -- simple, total functions from inputs to outputs -- and components that may have side effects -- errors, changes to memory, parallel threads, abortion of the current loop, etc. We…
Symbol is used to describe the Springer correspondence for the classical groups. We prove two structure theorems of symbol. We propose a construction of the symbol of the rigid partitions in the $B_n$, $C_n$, and $D_n$ theories. This…
The article $-$ part of a larger thesis which aims to give a detailed description of the generalisation to the category of groups with operators of the classical theory of semisimplicity for modules $-$ presents a straightforward…
We present a formula for the regular part of a sectorial form that represents a general linear second-order differential expression that may include lower-order terms. The formula is given in terms of the original coefficients. It shows…
Man-made 3D shapes are naturally organized in parts and hierarchies; such structures provide important constraints for shape reconstruction and generation. Modeling shape structures is difficult, because there can be multiple hierarchies…
Probabilistic programming is considered as a framework, in which basic components of cognitive architectures can be represented in unified and elegant fashion. At the same time, necessity of adopting some component of cognitive…
We apply an integral formula obtained by the author for a general $G$--structure to the case of $G=G_2$. We derive an integral formula relating curvatures and some quadratic invariants of the endomorphism induced by the intrinsic torsion.…
The paper develops an abstract (over-approximating) semantics for double-pushout rewriting of graphs and graph-like objects. The focus is on the so-called materialization of left-hand sides from abstract graphs, a central concept in…
Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…
Inferring 3D structure of a generic object from a 2D image is a long-standing objective of computer vision. Conventional approaches either learn completely from CAD-generated synthetic data, which have difficulty in inference from real…