Related papers: Expansions of pseudofinite structures and circuit …
We construct infinitesimal deformations on an open domain of a smooth projective surface given by a complement of plumbings of disjoint linear chains of smooth rational curves. We show that the infinitesimal deformations are not small…
Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…
Several expansions of the solutions to the confluent Heun equation in terms of incomplete Beta functions are constructed. A new type of expansion involving certain combinations of the incomplete Beta functions as expansion functions is…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
In this article we introduce the notion of a 'good model' in order to study the higher obstructions of complex supermanifolds. We identify necessary and sufficient conditions for such models to exist. Illustrations over Riemann surfaces are…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We present a general procedure for constructing triangulated categories, linear over a field, with distinct enhancements. Some of our examples can be equipped with a (non-degenerate) t-structure, thereby showing that the existence of a…
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in…
Prolongations of a group extension can be studied in a more general situation that we call group extensions of the co-type of a crossed module. Cohomology classification of such extensions is obtained by applying the obstruction theory of…
We consider a class of systems over finite alphabets, namely discrete-time systems with linear dynamics and a finite input alphabet. We formulate a notion of finite uniform bisimulation, and motivate and propose a notion of regular finite…
In this paper, we analyze the complexity of functional programs written in the interaction-net computation model, an asynchronous, parallel and confluent model that generalizes linear-logic proof nets. Employing user-defined sized and…
We study the systems of ordinary differential equations which are implicit with respect to the higher derivatives, appearing in the linear form, and their solutions near the singular points. The invertibility of the higher derivatives…
For cross-diffusion systems possessing an entropy (i.e. a Lyapunov functional)we study nonlocal versions and exhibit sufficient conditions to ensure that thenonlocal version inherits the entropy structure. These nonlocal systems can…
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…
This paper presents a novel possible worlds semantics, designed to elucidate the underpinnings of ultrafinitism. By constructing a careful modification of the well-known Kripke models for inuitionistic logic, we seek to extend our…
In this paper, we first get a criterion formula for whether a differential form is holomorphic with respect to the generalized complex structure induced by $\epsilon$. Next, we get the local extensions of $\overline\partial$-closed forms on…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for…
We present a framework for constructing congruence closure modulo permutation equations, which extends the abstract congruence closure framework for handling permutation function symbols. Our framework also handles certain interpreted…
We propose a new definition of actual causes, using structural equations to model counterfactuals.We show that the definitions yield a plausible and elegant account ofcausation that handles well examples which have caused problems forother…