English
Related papers

Related papers: The Consistency of $ZFC+CIFS$

200 papers

We prove that any tame abstract elementary class categorical in a suitable cardinal has an eventually global good frame: a forking-like notion defined on all types of single elements. This gives the first known general construction of a…

Logic · Mathematics 2016-03-11 Sebastien Vasey

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

Computational Complexity · Computer Science 2018-04-24 Mark Inman

The fuzzy quantification model FA has been identified as one of the best behaved quantification models in several revisions of the field of fuzzy quantification. This model is, to our knowledge, the unique one fulfilling the strict…

Artificial Intelligence · Computer Science 2019-02-07 Félix Díaz-Hermida , Marcos Matabuena , Juan C. Vidal

In a previous paper we developed a regularity and compactness theory in Euclidean ambient spaces for codimension 1 weakly stable CMC integral varifolds satisfying two (necessary) structural conditions. Here we generalize this theory to the…

Differential Geometry · Mathematics 2020-10-13 Costante Bellettini , Neshan Wickramasekera

The Wholeness Axioms, proposed by Paul Corazza, axiomatize the existence of an elementary embedding j:V-->V. Formalized by augmenting the usual language of set theory with an additional unary function symbol j to represent the embedding,…

Logic · Mathematics 2007-05-23 Joel David Hamkins

Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such…

Logic in Computer Science · Computer Science 2013-05-13 Klaus v. Gleissenthall , Andrey Rybalchenko

This paper suggests that traditional fermi-bose quantum field theories (QFT) in 3+1-D, like the standard model of physics, may often be exactly equivalent to the limiting case of a family of bosonic QFT (BQFT) which generate soliton…

High Energy Physics - Theory · Physics 2007-05-23 Paul J. Werbos

A major problem in the quantization of fields in curved spacetimes is the ambiguity in the choice of a Fock representation for the canonical commutation relations. There exists an infinite number of choices leading to different physical…

General Relativity and Quantum Cosmology · Physics 2011-08-24 Jerónimo Cortez , Guillermo A. Mena Marugán , Javier Olmedo , José M. Velhinho

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Logic · Mathematics 2024-10-30 Tamás Kátay , László Márton Tóth , Zoltán Vidnyánszky

In this paper, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we…

Logic · Mathematics 2022-10-18 Aldo Figallo-Orellano , Juan Sebastian Slagter

This paper is about Lions' open problem on density patches \cite{LIONS}: whether inhomogeneous incompressible Navier-Stokes equations preserve the initial regularity of the free boundary given by density patches. Using classical Sobolev…

Analysis of PDEs · Mathematics 2017-04-03 Francisco Gancedo , Eduardo Garcia-Juarez

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

In this paper, we extend the notion of finite-time input-to-state stability (FTISS) for finite-dimensional systems to infinite-dimensional systems. More specifically, we first prove an FTISS Lyapunov theorem for a class of…

Optimization and Control · Mathematics 2024-08-21 Xiaorong Sun , Jun Zheng , Guchuan Zhu

This paper shows that a large class of fading memory state-space systems driven by discrete-time observations of dynamical systems defined on compact manifolds always yields continuously differentiable synchronizations. This general result…

Dynamical Systems · Mathematics 2021-06-09 Lyudmila Grigoryeva , Allen Hart , Juan-Pablo Ortega

We ask for a given system of polynomials f_1,...,f_n and f over the complex numbers when there exist continuous functions q_1,...,q_n such that q_1 f_1+...+q_n f_n = f. This condition defines the continuous closure of an ideal. We give…

Commutative Algebra · Mathematics 2007-05-23 Holger Brenner

Kadison's transitivity theorem implies that, for irreducible representations of C*-algebras, every invariant linear manifold is closed. It is known that CSL algebras have this propery if, and only if, the lattice is hyperatomic (every…

Operator Algebras · Mathematics 2007-05-23 Allan Donsig , Alan Hopenwasser , David R. Pitts

We prove that a generic area-preserving diffeomorphism of a compact surface with non-empty boundary has an equidistributed set of periodic orbits. This implies that such a diffeomorphism has a dense set of periodic points, although we also…

Symplectic Geometry · Mathematics 2023-10-23 Abror Pirnapasov , Rohil Prasad

Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…

Logic in Computer Science · Computer Science 2020-03-31 Michał R. Przybyłek

Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a…

Computational Complexity · Computer Science 2016-12-28 Benjamin Rossman

We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories. In the case of bicategories and pseudofunctors, existing…

Category Theory · Mathematics 2016-12-21 Maxime Lucas