Related papers: The problem of Pi_2-cut-introduction

Constraint Logic Programming (CLP) and Hereditary Harrop formulas (HH) are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the…

In this paper, we propose a dictionary screening method for embedding compression in text classification tasks. The key purpose of this method is to evaluate the importance of each keyword in the dictionary. To this end, we first train a…

In this paper we propose a product space reformulation to transform monotone inclusions described by finitely many operators on a Hilbert space into equivalent two-operator problems. Our approach relies on Pierra's classical reformulation…

This paper is a prelude and elaboration on Proofs that Modify Proofs. Here we present an ordinal analysis of a fragment of the $\mu$-calculus around the strength of parameter-free $\Pi^1_2$-comprehension using the same approach as that…

The word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly…

We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of specified elements. Our approach gives a simple FPT algorithm for the problem, matching the $O^*(2^{|K|})$…

Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…

Cody & Waite argument reduction technique works perfectly for reasonably large arguments but as the input grows there are no bit left to approximate the constant with enough accuracy. Under mild assumptions, we show that the result computed…

Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and…

Let $G$ be a split reductive group over a local field $\bK$, and let $G((t))$ be the corresponding loop group. In \cite{GK} we have introduced the notion of a representation of (the group of $\bK$-points) of $G((t))$ on a pro-vector space.…

Recently, it has been shown how to perform the quantum hamiltonian reduction in the case of general $sl(2)$ embeddings into Lie (super)algebras, and in the case of general $osp(1|2)$ embeddings into Lie superalgebras. In another development…

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

In this paper we propose a semantics in which the truth value of a formula is a pair of elements in a complete Boolean algebra. Through the semantics we can unify largely two proofs of cut-eliminability (Hauptsatz) in classical second order…

For a countable group G = <A | R> presented by its generators A and defining relations R we discuss a simple method to embed G into such a 2-generator group T that the images of generators from A are explicitly given in T, and the defining…

We consider a compression method for boundary element matrices arising in the context of the computation of electrostatic fields. Green cross approximation combines an analytic approximation of the kernel function based on Green's…

In this paper, a fully implicit Crank-Nicolson discontinuous Galerkin method is proposed for solving the Ginzburg-Landau equation. By leveraging a novel analytical technique, we rigorously establish the unique solvability of the constructed…

Assigning one of K options to each of N groups under a total cost budget is a recurring problem in efficient AI, including mixed-precision quantization, non-uniform pruning, and expert selection. The objective, typically model loss, depends…

This report defines (plain) Dag-like derivations in the purely implicational fragment of minimal logic $M_{\supset}$. Introduce the horizontal collapsing set of rules and the algorithm {\bf HC}. Explain why {\bf HC} can transform any…

Inspired by the efficient proof procedures discussed in {\em Computability logic} \cite{Jap03,Japic,Japfin}, we describe a heuristic proof procedure for first-order logic. This is a variant of Gentzen sequent system and has the following…

Recently CKY-based models show great potential in unsupervised grammar induction thanks to their human-like encoding paradigm, which runs recursively and hierarchically, but requires $O(n^3)$ time-complexity. Recursive Transformer based on…