English
Related papers

Related papers: Arithmetical proofs of strong normalization result…

200 papers

Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…

Logic in Computer Science · Computer Science 2012-04-30 David Baelde , Gopalan Nadathur

In this paper we define intersection and union type assignment for Parigot's calculus lambda-mu. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under…

Logic in Computer Science · Computer Science 2011-01-25 Steffen van Bakel

Let $\Omega\subseteq \mathbb{R}^N$ a bounded open set, $N\geq 2$, and let $p>1$; we prove existence of a renormalized solution for parabolic problems whose model is $$ \begin{cases} u_{t}-\Delta_{p} u=\mu & \text{in}\…

Analysis of PDEs · Mathematics 2014-09-22 Francesco Petitta

We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda…

Logic in Computer Science · Computer Science 2008-01-08 Peter Selinger , Benoît Valiron

Consider the following Kirchhoff type problem $$ \left\{\aligned -\bigg(a+b\int_{\mathbb{B}_R}|\nabla u|^2dx\bigg)\Delta u&= \lambda u^{q-1} + \mu u^{p-1}, &\quad \text{in}\mathbb{B}_R, \\ u&>0,&\quad\text{in}\mathbb{B}_R,\\…

Analysis of PDEs · Mathematics 2015-07-21 Yisheng Huang , Zeng Liu , Yuanze Wu

Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms…

Logic in Computer Science · Computer Science 2007-05-23 Patrick Baillot , Virgile Mogbil

In the paper we consider elliptic equations of the form $-Au=u^{-\gamma}\cdot\mu$, where $A$ is the operator associated with a regular symmetric Dirichlet form, $\mu$ is a positive nontrivial measure and $\gamma>0$. We prove the existence…

Analysis of PDEs · Mathematics 2016-12-22 Tomasz Klimsiak

We study the slices of the parameter space of cubic polynomials where we fix the multiplier of a fixed point to some value $\lambda$. The main object of interest here is the radius of convergence of the linearizing parametrization. The…

Dynamical Systems · Mathematics 2020-03-31 Arnaud Chéritat

We give a brief introduction to the clocked lambda calculus, an extension of the classical lambda calculus with a unary symbol tau used to witness the beta-steps. In contrast to the classical lambda calculus, this extension is infinitary…

Logic in Computer Science · Computer Science 2015-10-21 Jörg Endrullis , Dimitri Hendriks , Jan Willem Klop , Andrew Polonsky

The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…

Logic in Computer Science · Computer Science 2025-10-22 Alexander Bentkamp , Jasmin Blanchette , Matthias Hetzenberger , Uwe Waldmann

We formulate the higher covariant derivative regularization for N=2 supersymmetric gauge theories in N=2 harmonic superspace. This regularization is constructed by adding the N=2 supersymmetric higher derivative term to the classical action…

High Energy Physics - Theory · Physics 2015-11-04 I. L. Buchbinder , N. G. Pletnev , K. V. Stepanyantz

Linear inverse problems are ubiquitous. Often the measurements do not follow a Gaussian distribution. Additionally, a model matrix with a large condition number can complicate the problem further by making it ill-posed. In this case, the…

The syntactic calculus of Lambek is a deductive system for the multiplicative fragment of intuitionistic non-commutative linear logic. As a fine-grained calculus of resources, it has many applications, mostly in formal computational…

Logic in Computer Science · Computer Science 2022-04-15 Niccolò Veltri

This paper presents a regularized Newton method (RNM) with generalized regularization terms for unconstrained convex optimization problems. The generalized regularization includes quadratic, cubic, and elastic net regularizations as special…

Optimization and Control · Mathematics 2024-07-11 Yuya Yamakawa , Nobuo Yamashita

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of…

Logic in Computer Science · Computer Science 2018-05-18 Patrick Bahr

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

Commutative Algebra · Mathematics 2017-07-28 Danny A. J. Gomez-Ramirez , Holger Brenner

In this paper a novel calculus system has been established based on the concept of 'werden'. The basis of logic self-contraction of the theories on current calculus was shown. Mistakes and defects in the structure and meaning of the…

General Mathematics · Mathematics 2012-01-13 Xiaoping Ding

The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…

In this paper, we present a formalization of Kozen's propositional modal $\mu$-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in…

Logic in Computer Science · Computer Science 2007-05-23 Marino Miculan

Nonclassical symmetries of a class of generalized Huxley equations of form $u_t=u_{xx}+k(x)u^2(1-u)$ are found. More precisely, for the class under consideration we completely classify reduction operators with $\tau=1$ and give a wide…

Analysis of PDEs · Mathematics 2010-10-13 Nataliya M. Ivanova , C. Sophocleous