English
Related papers

Related papers: Quick cut-elimination for strictly positive cuts

200 papers

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

Logic · Mathematics 2017-03-17 Jafar S. Eivazloo

We give a quantitative analysis of a theorem due to Fenghui Wang and Huanhuan Cui concerning the convergence of a multi-parametric version of the proximal point algorithm. Wang and Cui's result ensures the convergence of the algorithm to a…

Functional Analysis · Mathematics 2019-12-24 Bruno Dinis , Pedro Pinto

Let $\mathcal{M}$ be a semifinite von Neumann algebra on a Hilbert space $\mathcal{H}$ equipped with a faithful normal semifinite trace $\tau$, $S(\mathcal{M},\tau)$ be the ${}^*$-algebra of all $\tau$-measurable operators. Let…

Operator Algebras · Mathematics 2022-05-31 Airat M. Bikchentaev

In this paper, we study cut sets of attractors of iteration function systems (IFS) in $\mathbb{R}^d$. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a…

General Topology · Mathematics 2014-12-08 Benoît Loridant , Jun Luo , Tarek Sellami , Jörg Thuswaldner

In this paper, we study a special type of cutoff regularization in the coordinate representation. We show how this approach unites such concepts and properties as an explicit cut, a spectral representation, a homogenization, and a…

High Energy Physics - Theory · Physics 2022-12-20 A. V. Ivanov

We use G\"odel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable…

Logic in Computer Science · Computer Science 2012-10-12 Thomas Powell

A mass-conservative high-order unfitted finite element method for convection-diffusion equations in evolving domains is proposed. The space-time method presented in [P. Hansbo, M. G. Larson, S. Zahedi, Comput. Methods Appl. Mech. Engrg. 307…

Numerical Analysis · Mathematics 2024-05-01 Sebastian Myrbäck , Sara Zahedi

We prove a functional central limit theorem for partial sums of symmetric stationary long range dependent heavy tailed infinitely divisible processes with a certain type of negative dependence. Previously only positive dependence could be…

Probability · Mathematics 2015-04-07 Paul Jung , Takashi Owada , Gennady Samorodnitsky

The main goal of this paper is to formulate a constructive analogue of Ackermann's observation about finite set theory and arithmetic. We will see that Heyting arithmetic is bi-interpretable with $\mathsf{CZF^{fin}}$, the finitary version…

Logic · Mathematics 2022-01-13 Hanul Jeon

We study multiple simultaneous cut events for k-out-of-n:F and linear consecutive k-out-of-n:F systems in which each component has a constant failure probability. We list the multicuts of these systems and describe the structural…

Probability · Mathematics 2017-12-22 Fatemeh Mohammadi , Eduardo Saenz-de-Cabezon , Henry P. Wynn

We revisit the power counting of the Higgs Effective Field Theory (HEFT) from first principles, by requiring that predictions for physical observables follow a series expansion in small, dimensionless quantities. Depending on whether HEFT…

High Energy Physics - Phenomenology · Physics 2026-04-30 Ilaria Brivio , Ramona Gröber , Konstantin Schmid

Methods exploiting sparsity have been popular in imaging and signal processing applications including compression, denoising, and imaging inverse problems. Data-driven approaches such as dictionary learning and transform learning enable one…

Machine Learning · Computer Science 2018-02-05 Saiprasad Ravishankar , Anna Ma , Deanna Needell

We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends the previously claimed result by the first and third authors…

Logic in Computer Science · Computer Science 2025-11-05 Bahareh Afshari , Giacomo Barlucchi , Graham E. Leigh

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using…

Logic · Mathematics 2016-06-22 Sandro Skansi

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

We develop an Effective Field Theory (EFT) formalism to solve for the conservative dynamics of binary systems in gravity via Post-Minkowskian (PM) scattering data. Our framework combines a systematic EFT approach to compute the deflection…

High Energy Physics - Theory · Physics 2020-12-30 Gregor Kälin , Rafael A. Porto

A new approach is introduced to study QCD amplitudes at high energy and comparatively small momentum transfer. Novel cut diagrams, representing resummation of Feynman diagrams, are used to simplify calculation and to avoid delicate…

High Energy Physics - Phenomenology · Physics 2014-11-17 Y. J. Feng , O. Hamidi-Ravari , C. S. Lam

The Functional Machine Calculus (FMC, Heijltjes 2022) extends the lambda-calculus with the computational effects of global mutable store, input/output, and probabilistic choice while maintaining confluent reduction and simply-typed strong…

Logic in Computer Science · Computer Science 2025-05-16 Willem Heijltjes