English
Related papers

Related papers: Incompleteness and Jump Hierarchies

200 papers

The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal…

Logic in Computer Science · Computer Science 2023-06-22 Benedetto Intrigila , Giulio Manzonetto , Andrew Polonsky

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Logic · Mathematics 2016-04-01 Richard Rast

We study proper holomorphic maps between bounded symmetric domains $D$ and $\Omega$. In particular, when $D$ and $\Omega$ are of the same rank $\ge 2$ such that all irreducible factors of $D$ are of rank $\ge 2$, we prove that any proper…

Complex Variables · Mathematics 2019-07-18 Shan Tai Chan

The theory of ordinal ranks on Baire class 1 functions developed by Kechris and Loveau was recently extended by Elekes, Kiss and Vidny\'{a}nszky to Baire class $\xi$ functions for any countable ordinal $\xi\geq1$. In this paper, we answer…

Functional Analysis · Mathematics 2017-01-23 Denny H. Leung , Hong-Wai Ng , Wee-Kee Tang

Completeness relations are associated through Mercer's theorem to complete orthonormal basis of square integrable functions, and prescribe how a Dirac delta function can be decomposed into basis of eigenfunctions of a Sturm-Liouville…

Mathematical Physics · Physics 2015-11-17 Paulo H. F. Reimberg , L. Raul Abramo

The paper focuses on the structure of fundamental sequences of ordinals smaller than $\epsilon_0$. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for…

Logic in Computer Science · Computer Science 2010-06-17 Laurent Braud

In 1931, G\"odel presented in K\"onigsberg his famous Incompleteness Theorem, stating that some true mathematical statements are unprovable. Yet, this result gives us no idea about those independent (that is, true and unprovable)…

Logic in Computer Science · Computer Science 2011-07-08 Bruno Grenet

The degree of Kripke-incompleteness of a logic $L$ in some lattice $\mathcal{L}$ of logics is the cardinality of logics in $\mathcal{L}$ which share the same class of Kripke-frames with $L$. A celebrated result on Kripke-incompleteness is…

Logic · Mathematics 2025-09-25 Qian Chen

We prove that if $X$ is a topological space that admits Debreu's classical utility theorem (eg.\ $X$ is separable and connected, second countable, etc.), then order relations on $X$ satisfying milder completeness conditions can be…

Economics · Quantitative Finance 2021-01-21 Lawrence Carr

In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.

Logic · Mathematics 2018-03-13 Albert Visser

The equaliser of a set of homomorphisms $S: F(a, b)\rightarrow F(\Delta)$ has rank at most two if $S$ contains an injective map, and is not finitely generated otherwise. This proves a strong form of Stallings' Equaliser Conjecture for the…

Group Theory · Mathematics 2021-11-10 Alan D. Logan

We define the notion of a 2-operad relative to an operad, and prove that the 2-associahedra form a 2-operad relative to the associahedra. Using this structure, we define the notions of an $(A_\infty,2)$-category and $(A_\infty,2)$-algebra…

Category Theory · Mathematics 2021-06-30 Nathaniel Bottman , Shachar Carmeli

It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this…

Logic · Mathematics 2023-06-22 Fedor Pakhomov , James Walsh

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…

Logic in Computer Science · Computer Science 2023-05-18 Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…

Logic · Mathematics 2007-06-13 Radoslaw Hofman

We first prove De Giorgi type level estimates for functions in $W^{1,t}(\Omega)$, $\Omega\subset\mathbb{R}^N$, with $t>N\geq 2$. This augmented integrability enables us to establish a new Harnack type inequality for functions which do not…

Analysis of PDEs · Mathematics 2020-11-03 Daniele Cassani , Antonio tarsia

Following the paper~[3] by V\"{a}\"{a}n\"{a}nen and the author, we continue to investigate on the difference between Boolean-valued second-order logic and full second-order logic. We show that the compactness number of Boolean-valued…

Logic · Mathematics 2025-04-18 Daisuke Ikegami

Let be a general curve of genus g embedded via a general linear series of degree d in P^r. The well-known Maximal Rank Conjecture asserts that the restriction maps H^0(O_{P^r}(m)) \to H^0(O_C(m) are of maximal rank; if known, this…

Algebraic Geometry · Mathematics 2018-09-20 Eric Larson

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

Logic · Mathematics 2019-08-29 Fedor Pakhomov

In this expository article, we give a survey of Adrian Ioana's cocycle superrigidity theorem for profinite actions of Property (T) groups, and its applications to ergodic theory and set theory. In addition to a statement and proof of…

Logic · Mathematics 2019-08-16 Samuel Coskey