English
Related papers

Related papers: Normalization of IZF with Replacement

200 papers

Let ${\mathcal A}$ be the class of functions analytic in the unit disk ${\mathbb D} := \{ z\in {\mathbb C}:\, |z| < 1 \}$ and normalized such that $f(z)=z+a_2z^2+a_3z^3+\cdots$. In this paper we study the class $\mathcal{U}(\lambda)$,…

Complex Variables · Mathematics 2021-04-23 N. M. Alarifi , M. Obradovic , N. Tuneski

The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…

Algebraic Topology · Mathematics 2024-05-31 Brice Le Grignou , Victor Roca i Lucio

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

Logic in Computer Science · Computer Science 2015-07-01 Gyesik Lee , Benjamin Werner

The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…

Operator Algebras · Mathematics 2026-02-18 Bruce Blackadar , Ilijas Farah

A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof…

Logic in Computer Science · Computer Science 2007-08-17 Chuck Liang , Dale Miller

We introduce $\mathsf{LEM}$, a type-assignment system for the linear $ \lambda $-calculus that extends second-order $\mathsf{IMLL}_2$, i.e., intuitionistic multiplicative Linear Logic, by means of logical rules that weaken and contract…

Logic in Computer Science · Computer Science 2020-05-14 Gianluca Curzi , Luca Roversi

We prove that the theory of differentially closed fields of characteristic zero in $m\geq 1$ commuting derivations DCF$_{0,m}$ satisfies the expected form of the dichotomy. Namely, any minimal type is either locally modular or nonorthogonal…

Logic · Mathematics 2024-11-08 Omar Leon Sanchez

We derive compact formulae for modular transformations of WZ characters. We start with algebra A_1 at positive level k=n-2, for which we can easily provide some description of isometry group and genus formula in a special case. We also…

Mathematical Physics · Physics 2007-05-23 Antoine Coste

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

Logic · Mathematics 2024-04-09 Joel David Hamkins

An Isabelle/HOL formalisation of G\"odel's two incompleteness theorems is presented. The work follows \'Swierczkowski's detailed proof of the theorems using hereditarily finite (HF) set theory. Avoiding the usual arithmetical encodings of…

Logic in Computer Science · Computer Science 2021-04-29 Lawrence C. Paulson

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson , Krzysztof Grabczewski

This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…

Logic · Mathematics 2026-02-24 Valentyn Khokhlov

The polynomial Fre\u{\i}man--Ruzsa conjecture is a fundamental open question in additive combinatorics. However, over the integers (or more generally $\mathbb{R}^d$ or $\mathbb{Z}^d$) the optimal formulation has not been fully pinned down.…

Number Theory · Mathematics 2017-09-29 Freddie Manners

We present a full formalization in Martin-L\"of's Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using first-order syntax with one sort of names for both free and bound variables and Stoughton's multiple…

Logic in Computer Science · Computer Science 2018-07-06 Martín Copes , Nora Szasz , Álvaro Tasistro

We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…

Logic in Computer Science · Computer Science 2015-02-23 Andrew Polonsky

This article aims to review a selection of central topics and examples in logarithmic conformal field theory. It begins with a pure Virasoro example, critical percolation, then continues with a detailed exposition of symplectic fermions,…

High Energy Physics - Theory · Physics 2015-06-15 Thomas Creutzig , David Ridout

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

Set Matrix Theory (SMT) has been introduced in Log. Anal. 225: 59-82 (2014) as a generalization of ZF, in which matrices constructed from sets are treated as urelements, that is, as objects that are not sets but that can be elements of…

Logic · Mathematics 2024-12-16 Marcoen J. T. F. Cabbolet

I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…

History and Overview · Mathematics 2009-05-25 Michael Livshits

We establish Ecalle's mould calculus in an abstract Lie-theoretic setting and use it to solve a normalization problem, which covers several formal normal form problems in the theory of dynamical systems. The mould formalism allows us to…

Dynamical Systems · Mathematics 2018-01-17 Thierry Paul , David Sauzin
‹ Prev 1 4 5 6 7 8 10 Next ›