Related papers: The problem of Pi_2-cut-introduction
In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of {\Pi} 2 cuts (a recursive proof encapsulating the infinitary pigeonhole principle) [5]. However the derived…
A contraction-free and cut-free sequent calculus $\msf{G3SDM}$ for semi-De Morgan algebras, and a structural-rule-free and single-succedent sequent calculus $\msf{G3DM}$ for De Morgan algebras are developed. The cut rule is admissible in…
The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic…
We investigate the possibility to extract Seiberg-Witten curves from the formal series for the prepotential, which was obtained by the Nekrasov approach. A method for models whose Seiberg-Witten curves are not hyperelliptic is proposed. It…
We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…
Given a finitely presented group $G$, Hopf's formula expresses the second integral homology of $G$ in terms of generators and relators. We give an algorithm that exploits Hopf's formula to estimate $H_2(G;k)$, with coefficients in a finite…
Full first order linear logic can be presented as an abstract logic programming language in Miller's system Forum, which yields a sensible operational interpretation in the 'proof search as computation' paradigm. However, Forum still has to…
Program reductions are used widely to simplify reasoning about the correctness of concurrent and distributed programs. In this paper, we propose a general approach to proof simplification of concurrent programs based on exploring generic…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
Compression aims to reduce the size of an input, while maintaining its relevant properties. For multi-parameter persistent homology, compression is a necessary step in any computational pipeline, since standard constructions lead to large…
We define a reduction covariant for the representations a la Vinberg associated to stably graded Lie algebras. We then give an analogue of the LLL algorithm for the odd split special orthogonal group and show how this can be combined with…
In this paper, we develop a quantified propositional proof systems that corresponds to logarithmic-space reasoning. We begin by defining a class SigmaCNF(2) of quantified formulas that can be evaluated in log space. Then our new proof…
Reasoning about implied relationships (e.g., paraphrastic, common sense, encyclopedic) between pairs of words is crucial for many cross-sentence inference problems. This paper proposes new methods for learning and using embeddings of word…
The $\epsilon$-substitution method is a technique for giving consistency proofs for theories of arithmetic. We use this technique to give a proof of the consistency of the impredicative theory $ID_1$ using a variant of the cut-elimination…
We consider the problem of {\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string $T$ produced by any grammar-based compression…
The k-defensive domination problem is a powerful modeling tool for strategic decision-making in network security and disaster/emergency management, where multiple nodes may be simultaneously under attack. Despite its practical relevance,…
We present a proof system for the provability logic GLP in the formalism of nested sequents and prove the cut elimination theorem for it. As an application, we obtain the reduction of GLP to its important fragment called J syntactically.
Let $G=NH$ be a Lie group where $N,H$ are closed connected subgroups of $G,$ and $N$ is an exponential solvable Lie group which is normal in $G.$ Suppose furthermore that $N$ admits a unitary character $\chi_{\lambda}$ corresponding to a…