English
Related papers

Related papers: Normalization of IZF with Replacement

200 papers

In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…

Logic in Computer Science · Computer Science 2021-10-22 Davide Castelnovo , Marino Miculan

We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…

Logic in Computer Science · Computer Science 2020-04-22 Federico Aschieri , Agata Ciabattoni , Francesco A. Genco

In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…

Logic in Computer Science · Computer Science 2021-07-30 José Espírito Santo , Ralph Matthes , Luís Pinto

In this paper we investigate the Curry-Howard correspondence for constructive modal logic in light of the gap between the proof equivalences enforced by the lambda calculi from the literature and by the recently defined winning strategies…

Logic in Computer Science · Computer Science 2023-08-01 Matteo Acclavio , Davide Catta , Federico Olimpieri

A new approach to the semantics of identity types in intensional Martin-L\"of type theory is proposed, assuming only a category with finite limits and an interval. The specification of \emph{extensional} identity types in the original…

Category Theory · Mathematics 2026-01-13 Steve Awodey , Joseph Hua

We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening and contraction. These structural rules introduce explicit erasure and…

Logic in Computer Science · Computer Science 2012-03-23 Silvia Ghilezan , Pierre Lescanne , Dragisa Zunic

A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…

Logic · Mathematics 2009-09-25 Paul C. Eklof , Saharon Shelah

We develop a general assumption-lean framework for constructing uniformly valid confidence sets for functionals defined by moment equalities, referred to as $Z$-functionals. Our approach combines self-normalized statistics with a test…

Statistics Theory · Mathematics 2025-07-11 Woonyoung Chang , Arun Kumar Kuchibhotla

We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize…

Logic in Computer Science · Computer Science 2010-02-16 F. Bueno , J. Navas , M. Hermenegildo

We study the family of Fourier-Laplace transforms $$ F_{\alpha,\beta}(z)= \operatorname*{F.p.} \int_{0}^{\infty} t^{\beta}\exp(\mathrm{i} t^{\alpha}-\mathrm{i} z t)\:\mathrm{d} t, \quad \operatorname*{Im} z<0, $$ for $\alpha>1$ and…

Complex Variables · Mathematics 2020-10-16 Frederik Broucke , Gregory Debruyne , Jasson Vindas

System F, the polymorphic lambda calculus, features the principle of impredicativity: polymorphic types may be (explicitly) instantiated at other types, enabling many powerful idioms such as Church encoding and data abstraction.…

Programming Languages · Computer Science 2022-03-04 Henry Mercer , Cameron Ramsay , Neel Krishnaswami

Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…

Logic in Computer Science · Computer Science 2018-08-13 Beniamino Accattoli

This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic --- which involves both commutative and non commutative connectives. This calculus first introduced by de…

Logic in Computer Science · Computer Science 2014-02-04 Maxime Amblard , Christian Retoré

According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal $\lambda$ and non-trivial elementary embedding $j:V_{\lambda+2}\to V_{\lambda+2}$. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone has been…

Logic · Mathematics 2024-03-19 Farmer Schlutzenberg

For integral representations of associated Legendre functions in terms of modified Bessel functions, we establish justification for differentiation under the integral sign with respect to parameters. With this justification, derivatives for…

Classical Analysis and ODEs · Mathematics 2015-03-17 Howard S. Cohl

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

The purpose of this paper is to provide a new account of multiplicity for finite morphisms between smooth projective varieties. Traditionally, this has been defined using commutative algebra in terms of the length of integral ring…

Algebraic Geometry · Mathematics 2007-05-23 Tristram de Piro

We say that a mapping $f: X \rightarrow Y$ between two real normed spaces is a phase-isometry if it satisfies the functional equation \begin{eqnarray*} \{\|f(x)+f(y)\|, \|f(x)-f(y)\|\}=\{\|x+y\|, \|x-y\|\} \quad (x,y\in X).\end{eqnarray*} A…

Functional Analysis · Mathematics 2019-05-07 Xujian Huang , Dongni Tan

The first step in the formulation and study of the Riemann Hypothesis is the analytic continuation of the Riemann Zeta Function (RZF) in the full Complex Plane with a pole at $s=1$. In the current work, we study the analytic continuation of…

Probability · Mathematics 2024-10-07 Vlad Margarint , Stanislav Molchanov

A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…

Logic in Computer Science · Computer Science 2022-07-26 Ciarán Dunne , J. B. Wells