Related papers: The $\omega$-Vaught's Conjecture
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Knowing the truth is rarely enough -- we also seek out reasons why the fact is true. While much is known about how we explain contingent truths, we understand less about how we explain facts, such as those in mathematics, that are true as a…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
Employing a Mathematica symbolic computer algebra package called xTensor, we present $(1+3)$-covariant special case proofs of the shear-free perfect fluid conjecture in General Relativity. We first present the case where the pressure is…
In this paper, we propose the study of a conjecture whose affirmative solution would provide an example of a non-convex Chebyshev set in an infinite-dimensional real Hilbert space.
Using the Feferman-Vaught Theorem, we prove that a definable subset of a product structure must be a Boolean combination of open sets, in the product topology induced by giving each factor structure the discrete topology. We prove a…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…
Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
We establish proof-theoretic, constructive and coalgebraic foundations for proof search in coinductive Horn clause theories. Operational semantics of coinductive Horn clause resolution is cast in terms of coinductive uniform proofs; its…
We provide new conditions for the Strong Atiyah conjecture to lift to finite group extensions. In particular, we show cocompact special groups satisfy these conditions, so the Strong Atiyah conjecture holds for virtually cocompact special…
We survey most of the known results concerning the Eisenbud-Green-Harris Conjecture. Our presentation includes new proofs of several theorems, as well as a unified treatment of many results which are otherwise scattered in the literature.…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
In this note, we exhibit a method to prove the Baum-Connes conjecture (with coefficients) for extensions with finite quotients of certain groups which already satisfy the Baum-Connes conjecture. Interesting examples to which this method…
It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…
Being inspired by the success of \texttt{word2vec} \citep{mikolov2013distributed} in capturing analogies, we study the conjecture that analogical relations can be represented by vector spaces. Unlike many previous works that focus on the…
We prove that if an $\omega$-categorical structure has an $\omega$-categorical homogeneous Ramsey expansion, then so does its model-complete core.