English
Related papers

Related papers: A weak set theory that proves its own consistency

200 papers

We investigate the proof theory of regular expressions with fixed points, construed as a notation for (omega-)context-free grammars. Starting with a hypersequential system for regular expressions due to Das and Pous, we define its extension…

Logic in Computer Science · Computer Science 2024-04-26 Anupam Das , Abhishek De

The paper introduces and characterizes new notions of Lipschitzian and H\"olderian full stability of solutions to general parametric variational systems described via partial subdifferential and normal cone mappings acting in Hilbert…

Optimization and Control · Mathematics 2014-09-09 B. S. Mordukhovich , T. T. A. Nghia

G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…

Logic in Computer Science · Computer Science 2023-11-01 Gilles Dowek , Alexandre Miquel

This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…

Programming Languages · Computer Science 2024-05-28 Gianluca Amato , Mary DeMarco , James Lipton

Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…

General Mathematics · Mathematics 2009-07-28 Juan A. Perez

In this paper we prove Chaitin's ``heuristic principle'', {\it the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself}, for an appropriate measure of complexity. We show that the measure is…

Logic · Mathematics 2007-05-23 Cristian S. Calude , Helmut Juergensen

We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…

Logic · Mathematics 2012-03-29 Christian Pech , Maja Pech

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

Group Theory · Mathematics 2023-07-11 Lev Glebsky , Alexander Lubotzky , Nicolas Monod , Bharatram Rangarajan

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

Commutative Algebra · Mathematics 2020-08-13 Ezra Miller

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences…

Logic · Mathematics 2016-11-16 Douglas Ulrich , Richard Rast , Michael C. Laskowski

We study the formalized v statement by allowing the occurrence of different arrays of quantifiers in it. We prove that for some specific arrays of quantifiers we get consistency statements that are S-equivalent to the original…

Logic · Mathematics 2024-10-15 Paulo Guilherme Santos

In this paper, we argue that formal systems of first order Arithmetic that admit Goedelian undecidable propositions validly are abnormally non-constructive. We argue that, in such systems, the strong representation of primitive recursive…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

We analyze the properties of weakly compact sets in Lipschitz free spaces. Prior research has established that, for a complete metric space $M$, weakly precompact sets in the Lipschitz free space $\mathcal F(M)$ are tight. In this paper, we…

Functional Analysis · Mathematics 2026-02-16 Ramón J. Aliaga , Colin Petitjean , Antonín Prochazka , Triinu Veeorg

The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…

Operator Algebras · Mathematics 2010-07-21 Tim Austin , Tanja Eisner , Terence Tao

We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic…

Algebraic Topology · Mathematics 2025-06-04 Jeremy Miller , Peter Patzt , Dan Petersen , Oscar Randal-Williams

We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…

Algebraic Topology · Mathematics 2013-03-21 Frederic Chazal , Vin de Silva , Marc Glisse , Steve Oudot

Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an…

Rings and Algebras · Mathematics 2024-11-11 Laura Cossu , Salvatore Tringali

In this paper, we examine the limit of applicability of G\"{o}del's first incompleteness theorem ($\sf G1$ for short). We first define the notion "$\sf G1$ holds for the theory $T$". This paper is motivated by the following question: can we…

Logic · Mathematics 2023-09-13 Yong Cheng

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

Computational Complexity · Computer Science 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse
‹ Prev 1 3 4 5 6 7 10 Next ›