Related papers: Quick cut-elimination for strictly positive cuts
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…
In this letter we argue that instanton-dominated Green's functions in N=2 Super Yang-Mills theories can be equivalently computed either using the so-called constrained instanton method or making reference to the topological twisted version…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
We introduce the notion of the (instanton part of the) Seiberg-Witten prepotential for general Schrodinger operators with periodic potential. In the case when the operator in question is integrable we show how to compute the prepotential in…
Three variants of Kurt G\"odel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of G\"odel's argument the two…
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs with effects. In the system, dynamically generated values…
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs with effects. In the system, dynamically generated values…
We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…
Geometric theories based on classical logic are conservative over their intuitionistic counterparts for geometric implications. The latter result (sometimes referred to as Barr's theorem) is squarely a consequence of Gentzen's Hauptsatz.…
We extend a study by Lempp and Hirst of infinite versions of some problems from finite complexity theory, using an intuitionistic version of reverse mathematics and techniques of Weihrauch analysis.
We give an algorithm determining whether a hermiticity-preserving superoperator is positive. In our approach we apply techniques of quantifier elimination theory for real numbers. Furthermore, we argue that quantifier elimination theory…
Guided by the theory of graph limits, we investigate a variant of the cut metric for limit objects of sequences of discrete probability distributions. Apart from establishing basic results, we introduce a natural operation called {\em…
It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…
We consider the sequence of powers of a positive definite function on a discrete group. Taking inspiration from random walks on compact quantum groups, we give several examples of situations where a cut-off phenomenon occurs for this…
A canonical factorization is given for a quadratic pencil of accretive operators in a Hilbert space. Also, we establish some relationships between an m-accretive operator and its Moore-Penorse inverse. As an application, we study a result…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…
We propose an inertial forward-backward splitting algorithm to compute the zero of a sum of two monotone operators allowing for stochastic errors in the computation of the operators. More precisely, we establish almost sure convergence in…
This paper employs the linear nested sequent framework to design a new cut-free calculus LNIF for intuitionistic fuzzy logic--the first-order G\"odel logic characterized by linear relational frames with constant domains. Linear nested…