English
Related papers

Related papers: Extending the Extensional Lambda Calculus with Sur…

200 papers

We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed lambda-mu-calculus. We also extend Mendler's result on…

Logic · Mathematics 2009-05-19 René David , Karim Nour

In sequent calculi, cut elimination is a property that guarantees that any provable formula can be proven analytically. For example, Gentzen's classical and intuitionistic calculi LK and LJ enjoy cut elimination. The property is less…

Logic in Computer Science · Computer Science 2020-08-11 Ekaterina Komendantskaya , Dmitry Rozplokhas , Henning Basold

We consider linear operators defined on a subspace of a complex Banach space into its topological antidual acting positively in a natural sense. The goal of this paper is to investigate of this kind of operators. The main theorem is a…

Functional Analysis · Mathematics 2014-09-12 Zoltán Sebestyén , Zsolt Szűcs , Zsigmond Tarcsay

We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

Let $(\mathcal{B},\mathcal{A}, i, e, l)$ be a cleft extension of abelian categories. We prove that the functor $l$ preserves and reflects (Wakamatsu) tilting pairs of subcategories under certain conditions, unifying an abundance of known…

Representation Theory · Mathematics 2026-05-21 Guoqiang Zhao , Juxiang Sun

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

For nonsmooth Euler-Lagrange extremals, Noether's conservation laws cease to be valid. We show that Emmy Noether's theorem of the calculus of variations is still valid in the wider class of Lipschitz functions, as long as one restrict the…

Optimization and Control · Mathematics 2007-05-23 Delfim F. M. Torres

Let $K$ be a field and $\Gamma$ a finite quiver without oriented cycles. Let $\Lambda$ be the path algebra $K(\Gamma, \rho)$ and let $\mathscr{D}(\Lambda)$ be the dual extension of $\Lambda$. In this paper, we prove that each Lie derivation…

Rings and Algebras · Mathematics 2013-03-06 Yanbo Li , Feng Wei

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

Logic in Computer Science · Computer Science 2016-01-06 Katarzyna Grygiel , Pierre Lescanne

Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…

Algebraic Topology · Mathematics 2024-10-22 Fedor Manin

We obtain a power saving in the error term for a semigroup congruence lattice point count related to continued fractions. This is done by adapting arguments from recent work of Oh and Winter (2014) that give uniform bounds for certain…

Number Theory · Mathematics 2015-02-10 Michael Magee , Hee Oh , Dale Winter

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri

If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.

Logic in Computer Science · Computer Science 2023-05-18 Gilles Dowek , Benjamin Werner

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Logic in Computer Science · Computer Science 2013-12-11 M. Cialdea Mayer

We present the type system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Logic in Computer Science · Computer Science 2024-12-17 Matthias Weber

Let S be a dense sub-semigroup of the positive real numbers, and let X be a separable, reflexive Banach space. This note contains a proof that every weakly continuous contractive semigroup of operators on X over S can be extended to a…

Functional Analysis · Mathematics 2009-03-21 Eliahu Levy , Orr Shalit

This paper deals with the study of parameter dependence of extensions of Lipschitz mappings from the point of view of continuity. We show that if assuming appropriate curvature bounds for the spaces, the multivalued extension operators that…

Metric Geometry · Mathematics 2015-02-25 Rafa Espínola , Adriana Nicolae

There is constructed and considered the extension of classical Diriclet operator corresponding to uniformly log-concave measure in the space of symmetric differential forms. Sufficient conditions for its essential self-adjointness in…

funct-an · Mathematics 2008-02-03 A. G. Us

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

Logic in Computer Science · Computer Science 2014-01-03 Katarzyna Grygiel , Pierre Lescanne