Related papers: Affine logic with the integration operator
We present a proof-theoretical study of the interpretability logic IL, providing a wellfounded and a non-wellfounded sequent calculus for IL. The non-wellfounded calculus is used to establish a cut elimination argument for both calculi. In…
We prove new optimality results for adaptive mesh refinement algorithms for non-symmetric, indefinite, and time-dependent problems by proposing a generalization of quasi-orthogonality which follows directly from the inf-sup stability of the…
A consistent set of six integrable discrete and continuous dynamical systems are suggested corresponding to arbitrary affine Lie algebra. The set contains a system of partial differential equations which can be treated as a version of…
Harvey Friedman shows that, over Peano Arithmetic, the consistency statement for a finitely axiomatised theory $A$ can be characterised as the weakest statement $C$ over Peano Arithmetic such that ${\sf PA}+C$ interprets $A$. We study which…
We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…
We develop the first two heap logics that have implicit heaplets and that admit FO-complete program verification. The notion of FO-completeness is a theoretical guarantee that all theorems that are valid when recursive definitions are…
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
The Feigin--Frenkel theorem states that, over the complex numbers, the centre of the universal affine vertex algebra at the critical level is an infinite rank polynomial algebra. The first author and W.~Wang observed that in positive…
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…
A quandle will be called quasi-affine, if it embeds into an affine quandle. Our main result is a characterization of quasi-affine quandles, by group-theoretic properties of their displacement group, by a universal algebraic condition coming…
Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.
We prove the Riemann Hypothesis via an analytically regulated surface integral over the critical strip of the Riemann zeta function. The key idea is that the convergence of this normalized integral is equivalent to the condition that all…
We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…
In this paper, we develop new affine-invariant algorithms for solving composite convex minimization problems with bounded domain. We present a general framework of Contracting-Point methods, which solve at each iteration an auxiliary…
Covering Algebras of extended affine Lie algebras(EALA's) relative to finite order automorphisms are studied. Conditions are given for when the resulting algebra is again an EALA. This paper deals with affinizations of EALA's relative to…
We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We…
We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic notions only. Firstly, given that C contains a strong negation,…
In this paper some proof theory for propositional Lax Logic is developed. A cut free terminating sequent calculus is introduced for the logic, and based on that calculus it is shown that the logic has uniform interpolation. Furthermore, a…
This paper deals with certain fundamental results about affine hulls and simplices in a real normed linear space. The framework of the paper is Bishop's constructive mathematics, which, with its characteristic interpretation of existence as…