相关论文: A circular proof system for the hybrid mu-calculus
Cirquent calculus is a new proof-theoretic and semantic framework, whose main distinguishing feature is being based on circuits, as opposed to the more traditional approaches that deal with tree-like objects such as formulas or sequents.…
Normally hyperbolic invariant manifolds theory provides an efficient tool for proving diffusion in dynamical systems. In this paper we develop a methodology for computer assisted proofs of diffusion in a-priori chaotic systems based on this…
The fixed-point theory and its applications to various areas of science are well known. In this paper we present some existence and uniqueness theorems for fixed circles of self-mappings on metric spaces with geometric interpretation. We…
We prove that the Calabi invariant of a $C^1$ pseudo-rotation of the unit disk, that coincides with a rotation on the unit circle, is equal to its rotation number. This result has been shown some years ago by Michael Hutchings (under very…
We prove the uniform convergence of the geometric multigrid V-cycle for hybrid high-order (HHO) and other discontinuous skeletal methods. Our results generalize previously established results for HDG methods, and our multigrid method uses…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
We use the massless Thirring model to demonstrate a new approach to non-perturbative fermion calculations based on the spherical field formalism. The methods we present are free from the problems of fermion doubling and difficulties…
In this short paper we present a linear constraint solver for the UniCalc system, an environment for reliable solution of mathematical modeling problems.
The spi-calculus is a formal model for the design and analysis of cryptographic protocols: many security properties, such as authentication and strong confidentiality, can be reduced to the verification of behavioural equivalences between…
We establish syntactic cut-elimination for the one-variable fragment of the modal mu-calculus. Our method is based on a recent cut-elimination technique by Mints that makes use of Buchholz' Omega-rule.
The majority of model-based clustering techniques is based on multivariate Normal models and their variants. In this paper copulas are used for the construction of flexible families of models for clustering applications. The use of copulas…
The sequent calculus is a proof system which was designed as a more symmetric alternative to natural deduction. The {\lambda}{\mu}{\mu}-calculus is a term assignment system for the sequent calculus and a great foundation for compiler…
We study cyclic proof systems for $\mu\mathsf{PA}$, an extension of Peano arithmetic by positive inductive definitions that is arithmetically equivalent to the (impredicative) subsystem of second-order arithmetic $\Pi^1_2$-$\mathsf{CA}_0$…
A method is developed to construct the solutions of one and many variable, linear differential equations of arbitrary order. Using this, the $N$-particle Sutherland model, with pair-wise inverse sine-square interactions among the particles,…
A novel model of reversible computing, the $\aleph$-calculus, is introduced. It is declarative, reversible-Turing complete, and has a local term-rewriting semantics. Unlike previously demonstrated reversible term-rewriting systems, it does…
In this document, we deal with the stabilization problem of slow-fast systems (or singularly perturbed Ordinary Differential Equations) at a non-hyperbolic point. The class of systems studied here have the following properties: 1) they have…
We investigate the Hilbert scheme of points on curves with n-fold singularities, that is curves that look locally around their singular points as the axis in an affine space. We describe the structure and number of its irreducible…
This paper presents simple, syntactic strong normalization proofs for the simply-typed lambda-calculus and the polymorphic lambda-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The…
The ZX-calculus is an intuitive but also mathematically strict graphical language for quantum computing, which is especially powerful for the framework of quantum circuits. Completeness of the ZX-calculus means any equality of matrices with…
Cohen--Suciu proved that the cohomology ring of the boundary manifold of a complex projective line arrangement is isomorphic to the double of the cohomology ring of the complement. In this paper, we generalize this result to arbitrary…