English
Related papers

Related papers: Normalization of IZF with Replacement

200 papers

We consider mainly the following version of set theory:"ZF + DC and for every $\lambda,\lambda^{\aleph_0}$ is well ordered", our thesis is that this is a reasonable set theory, e.g. much can be said. In particular, we prove that for a…

Logic · Mathematics 2021-09-24 Saharon Shelah

In recent years the question of whether adding the limited principle of omniscience, LPO, to constructive Zermelo-Fraenkel set theory, CZF, increases its strength has arisen several times. As the addition of excluded middle for atomic…

Logic · Mathematics 2013-02-14 Michael Rathjen

In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problems. In particular, we mention the Neighbourhood…

Combinatorics · Mathematics 2014-03-04 Josef Lauri , Russell Mizzi , Raffaele Scapellato

We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…

Logic · Mathematics 2020-03-19 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…

Logic in Computer Science · Computer Science 2019-07-23 Pablo Barenbaum , Gonzalo Ciruelos

We study a canonical quantization of the Wess--Zumino--Witten (WZW) model which depends on two integer parameters rather than one. The usual theory can be obtained as a contraction, in which our two parameters go to infinity keeping the…

High Energy Physics - Theory · Physics 2015-06-26 S. G. Rajeev , G. Sparano , P. Vitale

Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of proof terms for various constructive logics. This paper is the first to apply…

Logic in Computer Science · Computer Science 2013-09-06 Harley Eades , Aaron Stump

We investigate the lower bound of the consistency strength of $\mathsf{CZF}$ with Full Separation $\mathsf{Sep}$ and a Reinhardt set, a constructive analogue of Reinhardt cardinals. We show that $\mathsf{CZF+Sep}$ with a Reinhardt set…

Logic · Mathematics 2022-04-14 Hanul Jeon

Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. We consider factorizations $\Gamma\xrightarrow{f} M\xrightarrow{g} G$ of $\varphi$ such that either $g$ or $f$ are universal normal maps (namely, crossed modules). These two…

Group Theory · Mathematics 2014-11-04 Emmanuel D. Farjoun , Yoav Segev

Regularization of quantum field theories (QFT's) can be achieved by quantizing the underlying manifold (spacetime or spatial slice) thereby replacing it by a non-commutative matrix model or a ``fuzzy manifold'' . Such discretization by…

High Energy Physics - Theory · Physics 2007-05-23 Badis Ydri

ML is remarkable in providing statically typed polymorphism without the programmer ever having to write any type annotations. The cost of this parsimony is that the programmer is limited to a form of polymorphism in which quantifiers can…

Programming Languages · Computer Science 2020-04-02 Frank Emrich , Sam Lindley , Jan Stolarek , James Cheney , Jonathan Coates

Let $F$ be a finite field of order $q$ and characteristic $p$. Let $\mathbb{Z}_F=F[t]$, $\mathbb{Q}_F=F(t)$, $\mathbb{R}_F=F((1/t))$ equipped with the discrete valuation for which $1/t$ is a uniformizer, and let…

Number Theory · Mathematics 2022-06-06 Keira Gunn , Khoa D. Nguyen , J. C. Saunders

We review some relations occurring between the combinatorial intersection theory on the moduli spaces of stable curves and the asymptotic behavior of the 't Hooft-Kontsevich matrix integrals. In particular, we give an alternative proof of…

Algebraic Geometry · Mathematics 2013-09-30 Domenico Fiorenza , Riccardo Murri

We give an estimate of the general divided differences $[x_0,\dots,x_m;f]$, where some of the $x_i$'s are allowed to coalesce (in which case, $f$ is assumed to be sufficiently smooth). This estimate is then applied to significantly…

Classical Analysis and ODEs · Mathematics 2019-01-15 K. A. Kopotun , D. Leviatan , I. A. Shevchuk

In this paper, we define constructive analogues of second-order set theories, which we will call $\mathsf{IGB}$, $\mathsf{CGB}$, $\mathsf{IKM}$, and $\mathsf{CKM}$. Each of them can be viewed as $\mathsf{IZF}$- and $\mathsf{CZF}$-analogues…

Logic · Mathematics 2025-09-22 Hanul Jeon

We prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Saharon Shelah

We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even…

Dynamical Systems · Mathematics 2023-02-27 Christopher Cabezas

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

We are interested in investigating some definitions and assumptions stated in [4], in particular the notions of measurability and atomicity that the two authors used in order to give a representation for multiplicative linear functionals…

Logic · Mathematics 2024-03-27 Gabriele Gullà