Related papers: The $\omega$-Vaught's Conjecture
Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…
We show that the intuitionistic first-order theory of equality has continuum many complete extensions. We also study the Vitali equivalence relation and show there are many intuitionistically precise versions of it.
Analogy has received attention as a form of inductive reasoning in the empirical sciences. However, its role in pure mathematics has received less consideration. This paper provides an account of how an analogy with a more familiar…
We give a purely combinatorial proof for the infinitary van der Waerden's theorem.
In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…
The Hodge conjecture is shown to be equivalent to a question about the homology of very ample divisors with ordinary double point singularities. The infinitesimal version of the result is also discussed.
We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…
We study the Ein-Lazarsfeld Conjecture of syzygies of Veronese varieties in the case of linear syzygies q=1. We show a vanishing statement which agrees with the conjecture up to highest and second-highest order for linear syzygies.
In this paper we show the equivalence of the conjectures of Giuga and Agoh in a direct way which leads to a combined conjecture. This conjecture is described by a sum of fractions from which all conditions can be derived easily.
Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
We survey Lawvere theories at the level of infinity categories, as an alternative framework for higher algebra (rather than infinity operads). From a pedagogical perspective, they make many key definitions and constructions less technical.…
This paper introduces the notion of objection-based causal networks which resemble probabilistic causal networks except that they are quantified using objections. An objection is a logical sentence and denotes a condition under which a,…
Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…
The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…
We prove some injectivity theorems. Our proof depends on the theory of mixed Hodge structures on cohomology groups with compact support. Our injectivity theorems would play crucial roles in the minimal model theory for higher-dimensional…
In this paper we discuss an obstruction to the integral Hodge conjecture, which arises from certain behavior of vanishing cycles. This allows us to construct new counter-examples to the integral Hodge conjecture. One typical such…
We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…