English
Related papers

Related papers: Extensional realizability for intuitionistic set t…

200 papers

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

Metric Geometry · Mathematics 2015-06-23 Michael Gene Dobbins , Andreas Holmsen , Alfredo Hubard

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

We show, in Zermelo-Fraenkel set theory without the Axiom of Choice, that the existence of a discontinuous homomorphism of the additive group of real numbers induces a selector for the Vitali equivalence relation $\mathbb{R}/\mathbb{Q}$.…

Logic · Mathematics 2020-06-09 Paul B. Larson , Jindrich Zapletal

We introduce the forcing model of IZFA (Intuitionistic Zermelo-Fraenkel set theory with Atoms) for every Grothendieck topology and prove that the topos of sheaves on every site is equivalent to the category of 'sets in this forcing model'.

Logic · Mathematics 2018-03-14 Keita Yamamoto

The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…

General Relativity and Quantum Cosmology · Physics 2023-10-24 Aristotelis Panagiotopoulos , George Sparling , Marios Christodoulou

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Logic · Mathematics 2009-05-19 Jaap van Oosten

We introduce extensions by rules of the extensional level of the Minimalist Foundation which turn out to be equivalent to constructive and classical axiomatic set theories.

Logic · Mathematics 2021-02-26 Samuele Maschio , Pietro Sabelli

Introduced by Dal Lago and Hofmann, quantitative realizability is a technique used to define models for logics based on Multiplicative Linear Logic. A particularity is that functions are interpreted as bounded time computable functions. It…

Logic in Computer Science · Computer Science 2012-11-20 Aloïs Brunel

Iterated admissibility (IA) can be seen as exhibiting a minimal criterion of rationality in games. In order to make this intuition more precise, the epistemic characterization of this game-theoretic solution has been actively investigated…

Logic · Mathematics 2013-04-19 Fernando Tohmè , Gianluca Caterina , Rocco Gangle

It is a well-known result that, after adding one Cohen real, the transcendence degree of the reals over the ground-model reals is continuum. We extend this result for a set $X$ of finitely many Cohen reals, by showing that, in the forcing…

Logic · Mathematics 2026-01-13 Azul Fatalini , Ralf Schindler

This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.

Logic · Mathematics 2016-09-07 Pietro Ursino

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

By Easton's theorem one can force the exponential function on regular cardinals to take rather arbitrary cardinal values provided monotonicity and Koenig's lemma are respected. In models without choice we employ a "surjective" version of…

Logic · Mathematics 2013-08-09 Anne Fernengel , Peter Koepke

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

General Topology · Mathematics 2020-08-05 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

Logic · Mathematics 2008-02-03 Saharon Shelah

In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…

Logic · Mathematics 2019-08-08 Arieh Lev

The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…

Logic · Mathematics 2019-09-05 Andrei Alexandru , Gabriel Ciobanu

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

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…

Logic · Mathematics 2018-01-08 Michael Rathjen

This paper offers an approach to extensible knowledge representation and reasoning for a family of formalisms known as Description Logics. The approach is based on the notion of adding new concept constructors, and includes a heuristic…

Artificial Intelligence · Computer Science 2011-05-30 A. Borgida