Related papers: Finding the limit of incompleteness I
In this paper, we provide a complete classification for the first-order Goedel logics concerning the property that the formulas admit logically equivalent prenex normal forms. We show that the only first-order Goedel logics that admit such…
Let G be a connected reductive linear algebraic group. The aim of this note is to settle a question of J-P. Serre concerning the behaviour of his notion of G-complete reducibility under separable field extensions. Part of our proof relies…
We provide a mathematical definition of a low energy scaling limit of a sequence of general non-relativistic quantum theories in any dimension, and apply our formalism to anyonic chains. We formulate Conjecture 4.3 on conditions when a…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
Using a result of M. Hochster and C. Huneke on $F$-rational rings a criterion for complete intersection rings of characteristic $p>0$ is presented. As an application, we give a completely different proof for an algebraic result of G.…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
It is known that the famous Heins Theorem (also known as the de Branges Lemma) about the minimum of two entire functions of minimal type does not extend to functions of finite exponential type. We study in detail pairs of entire functions…
This work is based on the idea that extension of physical and mathematical theories to include the amount of space, time, momentum, and energy resources required to determine properties of systems may influence what is true in physics and…
We prove the modularity of minimally ramified ordinary residually reducible p-adic Galois representations of an imaginary quadratic field F under certain assumptions. We first exhibit conditions under which the residual representation is…
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…
Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…
Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only…
We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f: \mathbb{Z}^+ \to…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…
The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…
Let T be an SMT solver with no theory solvers except for Quantifier Instantiation. Given a set of first-order clauses S saturated by Resolution (with a valid literal selection function) we show that T is complete if its Trigger function is…
This survey article has two components. The first part gives a gentle introduction to Serre's notion of $G$-complete reducibility, where $G$ is a connected reductive algebraic group defined over an algebraically closed field. The second…
Let $G(k)=\int_0^1g(x)e^{kx}dx$, $g\in L^1(0,1)$. The main result of this paper is the following theorem. {\bf Theorem}. {\it If $\limsup_{k\to +\infty}|G(k)|<\infty$, then $g=0$. There exists $g\not\equiv 0$, $g\in L^1(0,1)$, such that…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…