Related papers: The $\omega$-Vaught's Conjecture

Prompted by results of Guardo, Van Tuyl and the second author for lines in projective 3 space, we develop asymptotic upper bounds for the least degree of a homogeneous form vanishing to order at least m on a union of disjoint r dimensional…

The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…

We prove several representation theorems for infinitary predicate modal logic

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Despite the failure of the integral Hodge conjecture, we show that the rational Hodge conjecture implies an integral version (modulo torsion) of the absolute Hodge conjecture.

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…

We show that the Generalized Vanishing Conjecture $$\forall_{m \ge 1} [\Lam^m f^m = 0] \Longrightarrow \forall_{m \gg 0} [\Lam^m (g f^m) = 0]$$ for a fixed differential operator $\Lam \in k[\partial]$ follows from a special case of it,…

I prove an envelope theorem with a converse: the envelope formula is equivalent to a first-order condition. Like Milgrom and Segal's (2002) envelope theorem, my result requires no structure on the choice set. I use the converse envelope…

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.

In this paper, we study the employment of $\Sigma_1$-sentences with certificates, i.e., $\Sigma_1$-sentences where a number of principles is added to ensure that the witness is sufficiently number-like. We develop certificates in some…

We establish a quantitative version of Oppenheim's conjecture for generic ternary indefinite quadratic forms using an analytic number theory approach. The statements come with power gains and in some cases are essentially optimal

We say that a theory $T$ is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence $T$ is…

In partial answer to a question posed by Arnie Miller (http://www.math.wisc.edu/~miller/res/problem.pdf) and X. Caicedo, we obtain sufficient conditions for an L_{omega_1,omega} theory to have an independent axiomatization. As a consequence…

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

Inspired by the quantitative $K$-theory, in this paper, we introduce the coarse Baum-Connes conjecture with filtered coefficients which generalizes the original conjecture. There are two advantages for the conjecture with filtered…

The primary theme of this investigation is a decision theoretic account of conditional ought statements (e.g., "You ought to do A, if C") that rectifies glaring deficiencies in classical deontic logic. The resulting account forms a sound…

We give a sufficient condition for the strong symmetric version of Strassen's additivity conjecture: the Waring rank of a sum of forms in independent variables is the sum of their ranks, and every Waring decomposition of the sum is a sum of…

The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…