English
Related papers

Related papers: The Consistency of $ZFC+CIFS$

200 papers

It is well-known that a finite axiomatization of Zermelo-Fraenkel set theory (ZF) is not possible in the same first-order language. In this note we show that a finite axiomatization is possible if we extent the language of ZF with the new…

General Mathematics · Mathematics 2018-06-05 Marcoen Cabbolet

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

Logic · Mathematics 2024-05-17 Ben Goodman

We introduce a formal theory called Flow where the intended interpretation of its terms is that of function. We prove ZF, ZFC and ZFU (ZF with atoms) can be immersed within Flow as natural consequences from our framework. Our first…

Logic · Mathematics 2021-03-31 Adonai Sant'Anna , Renato Brodzinski , Marcio de França , Otávio Bueno

We prove the consistency of the theory ZFC + there is a strongly compact cardinal from the existence of a cardinal preserving embedding from the universe into an inner model. The proof almost shows that under SCH, every cardinal preserving…

Logic · Mathematics 2021-03-02 Gabriel Goldberg

We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…

Dynamical Systems · Mathematics 2026-05-05 Elismar R. Oliveira , Paulo Varandas

We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…

Logic · Mathematics 2026-04-01 Peter Holy , Emma Palmer , Jonathan Schilhan

In the first part of this text we give a survey of the properties satisfied by the C1-generic conservative diffeomorphisms of compact surfaces. The main result that we will discuss is that a C1-generic conservative diffeomorphism of a…

Dynamical Systems · Mathematics 2010-11-23 Sylvain Crovisier

We prove that in a compact manifold of dimension $n\geq 2$, a $C^{1+\alpha}$ volume-preserving diffeomorphisms that are robustly transitive in the $C^1$-topology have a dominated splitting. Also we prove that for 3-dimensional compact…

Dynamical Systems · Mathematics 2008-10-02 Alexander Arbieto , Carlos Matheus

For a compactification $\alpha X$ of a Tychonoff space $X$, the algebra of all functions $f\in C(X)$ that are continuously extendable over $% \alpha X$ is denoted by $C_{\alpha}(X)$. It is shown that, in a model of $\textbf{ZF}$, it may…

General Topology · Mathematics 2018-05-25 Kyriakos Keremedis , Eliza Wajch

We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-26 Paulo Sérgio Almeida

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…

Functional Analysis · Mathematics 2008-12-18 Marianne Morillon

We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…

Logic · Mathematics 2025-10-23 Frank Gilson

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…

Logic · Mathematics 2023-10-18 Yurii Khomskii , Hrafn Valtýr Oddsson

This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…

Logic · Mathematics 2012-01-04 Dan E. Willard

We prove that a $C^2$ diffeomorphism $f$ of a compact manifold $M$ satisfies Axiom A and the strong transversality condition if and only if it is H\"{o}lder stable, that is, any $C^1$ diffeomorphism $g$ of $M$ sufficiently $C^1$ close to…

Dynamical Systems · Mathematics 2007-08-31 Jinpeng An

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…

Logic · Mathematics 2014-02-10 Itaï Ben Yaacov , Arthur Paul Pedersen

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…

Logic · Mathematics 2015-07-01 Jean-Louis Krivine