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

The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic…

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…

In this paper we affirm Br\"{u}ck conjecture provided $f$ is of hyper-order less than one by studying the infinite hyper-order of solutions of a complex differential equation.

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

We prove a new theorem on additive Levy processes and show that this theorem implies several proved theorems and a hard conjectured theorem.

Motivated by considerations in the foundations of quantum mechanics and inspired by the literature on vague predicates, we introduce the concept of an opaque predicate. While in the case of vague predicates there is a kind of indeterminacy…

We prove a recent conjecture of Sean A. Irvine about a nonlinear recurrence, using mechanized guessing and verification. The theorem-prover Walnut plays a large role in the proof.

We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…

The Scott process of a relational structure $M$ is the sequence of sets of formulas given by the Scott analysis of $M$. We present axioms for the class of Scott processes of structures in a relational vocabulary $\tau$, and use them to give…

We prove a conjecture of Roe by constructing unified warped cones that violate the coarse Baum-Connes conjecture. Interestingly, the reason for this is probably not what Roe expected, as the obstruction arises in odd rather than even…

We show that a version of L\'opez-Escobar's theorem holds in the setting of logic for metric structures. More precisely, let $\mathbb{U}$ denote the Urysohn sphere and let $\mathrm{Mod}(\mathcal{L},\mathbb{U})$ be the space of metric…

We propose a new approach to sequential testing which is an adaptive (on-line) extension of the (off-line) framework developed in [10]. It relies upon testing of pairs of hypotheses in the case where each hypothesis states that the vector…

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

We give a simple combinatorial proof of the $\lambda_g$ conjectue in genus 2. We use a description of the class $\lambda_2$ as a linear combination of boundary strata, and show the conjecture follows inductively from applications of the…

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…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…