中文
相关论文

相关论文: The Axiom of Multiple Choice and Models for Constr…

200 篇论文

We show how one may establish proof-theoretic results for constructive Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and the Bar Induction rule for Baire space, by constructing sheaf models and using their…

逻辑 · 数学 2011-11-17 Benno van den Berg , Ieke Moerdijk

In "Extensional realizability for intuitionistic set theory", we introduced an extensional variant of generic realizability, where realizers act extensionally on realizers, and showed that this form of realizability provides "inner" models…

逻辑 · 数学 2024-12-10 Emanuele Frittaion

The axiom of choice ensures precisely that, in ZFC, every set is projective: that is, a projective object in the category of sets. In constructive ZF (CZF) the existence of enough projective sets has been discussed as an additional axiom…

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

逻辑 · 数学 2011-02-23 Daniel Méhkeri

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…

逻辑 · 数学 2018-01-08 Michael Rathjen

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

逻辑 · 数学 2020-12-22 Emanuele Frittaion , Michael Rathjen

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

逻辑 · 数学 2024-12-02 Emanuele Frittaion , Takako Nemoto , Michael Rathjen

Rathjen proved that Aczel's constructive set theory $\mathbf{CZF}$ extended with inaccessible sets of all transfinite orders can be interpreted in Martin-L\"{o}f type theory $\mathbf{MLTT}$ extended with Setzer's Mahlo universe and another…

计算机科学中的逻辑 · 计算机科学 2025-11-05 Yuta Takahashi

In [G. Curi, "Exact approximations to Stone-Cech compactification'', Ann. Pure Appl. Logic, 146, 2-3, 2007, pp. 103-123] a characterization is obtained of the locales of which the Stone-Cech compactification can be defined in constructive…

逻辑 · 数学 2010-01-12 Giovanni Curi

A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative…

逻辑 · 数学 2020-07-08 Håkon Robbestad Gylterud

In this paper we consider the problem of building rich categories of setoids, in standard intensional Martin-L\"of type theory (MLTT), and in particular how to handle the problem of equality on objects in this context. Any…

逻辑 · 数学 2015-07-01 Erik Palmgren , Olov Wilander

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…

逻辑 · 数学 2026-02-24 Valentyn Khokhlov

We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…

泛函分析 · 数学 2008-12-18 Marianne Morillon

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

计算机科学中的逻辑 · 计算机科学 2016-08-31 Lawrence C. Paulson

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

逻辑 · 数学 2019-11-20 Takako Nemoto , Michael Rathjen

Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…

逻辑 · 数学 2022-03-28 Zachiri McKenzie , Ali Enayat

We present a Kleene realizability semantics for the intensional level of the Minimalist Foundation, for short mtt, extended with inductively generated formal topologies, Church's thesis and axiom of choice. This semantics is an extension of…

逻辑 · 数学 2023-06-22 Maria Emilia Maietti , Samuele Maschio , Michael Rathjen

Whilst Power Kripke-Platek set theory, KPP, shares many properties with ordinary Kripke-Platek set theory, KP, in several ways it behaves quite differently from KP. This is perhaps most strikingly demonstrated by a result, due to Mathias,…

逻辑 · 数学 2018-01-09 Michael Rathjen

We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…

逻辑 · 数学 2022-12-07 Rosalie Iemhoff , Robert Passmann

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…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Gyesik Lee , Benjamin Werner
‹ 上一页 1 2 3 10 下一页 ›