Related papers: A circular proof system for the hybrid mu-calculus

In this paper we study homeomorphisms of the circle with several critical points and bounded type rotation number. We prove complex a priori bounds for these maps. As an application, we get that bi-cubic circle maps with same bounded type…

Teaching proofs is a crucial component of any undergraduate-level program that covers formal reasoning. We have developed a calculational reasoning format and refined it over several years of teaching a freshman-level course, "Logic and…

We describe a class of theories obtained by fibering a Landau-Ginburg orbifold over a compact Kaehler base. While such theories are often described as phases of some GLSM, our description is independent of such an embedding. We provide a…

In this paper we consider moduli spaces of coherent systems on an elliptic curve. We compute their Hodge polynomials and determine their birational types in some cases. Moreover we prove that certain moduli spaces of coherent systems are…

We relate Hilbert schemes of points and Fulton-MacPherson compactifications by an interpolating stability condition. We then derive wall-crossings formulas and some applications for the enumerative geometry of Hilbert schemes.

Cyclic proof theory studies proofs where cycles are allowed. This is useful for developing proof theory for logics with fixpoint operators: cycles can be used to represent the unfolding of a fixpoint. However, this cyclic character is not…

In this article we are interested in morphisms without slope for mixed Hodge modules. We first show the commutativity of iterated nearby cycles and vanishing cycles applied to a mixed Hodge module in the case of a morphism without slope.…

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…

In this paper, we establish the foundations of a novel logical framework for the {\pi}-calculus, based on the deduction-as-computation paradigm. Following the standard proof-theoretic interpretation of logic programming, we represent…

Let X be a smooth irreducible projective surface. The aim of this paper is to establish a version of Clifford's theorem for coherent systems on X.

Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the…

Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

We define a general V-fold cross-validation type method based on robust tests, which is an extension of the hold-out defined by Birg{\'e} [7, Section 9]. We give some theoretical results showing that, under some weak assumptions on the…

A methodology for handling block-to-block coupling of nonconforming, multiblock summation-by-parts finite difference methods is proposed. The coupling is based on the construction of projection operators that move a finite difference grid…

This work develops new ideas and tools to establish wall-crossing in Calabi-Yau four categories as originally conjectured by Gross-Joyce-Tanaka. In the process, I set up some necessary new language, including a natural refinement of Joyce's…

A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…

Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…

This paper discusses a method for pipelining the calculation of CRC's, such as ITU/CCITT CRC32, into a mostly feed-forward architecture. This method allows several benefits such as independent scaling of circuit frequency and data…

We study the charged chiral matter spectrum of four-dimensional F-theory compactifications on elliptically fibered Calabi-Yau fourfolds by using the dual M-theory description. A chiral spectrum can be induced by M-theory four-form flux on…