Related papers: Hindman's Theorem: An Ultrafilter Argument in Seco…

We pursue the idea of generalizing Hindman's Theorem to uncountable cardinalities, by analogy with the way in which Ramsey's Theorem can be generalized to weakly compact cardinals. But unlike Ramsey's Theorem, the outcome of this paper is…

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…

We present a simple extension of Lindeberg's argument for the Central Limit Theorem to get a general invariance result. We apply the technique to prove results from random matrix theory, spin glasses, and maxima of random fields.

In the present work, we introduce the notion of a hyper-atom and prove their main structure theorem. We then apply the global isoperimetric methodology to give a new proof for Kemperman's structure Theory and a slight improvement.

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…

In a previous paper (of which this is a prosecution) we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translation into System F. Our key idea was to introduce an extended…

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…

We study the first step of the weight filtration on the cohomology of a proper complex algebraic variety, which we call the combinatorial part. We obtain a natural upper bound on its size, which gives rather strong information about the…

Two results on product of compact filters are shown to be the common principle behind a surprisingly large number of theorems.

We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.

In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.

We prove Horrocks' theorem for the odd elementary orthogonal group, which gives a decomposition of an orthogonal matrix with entries from a polynomial ring $R[X]$, over a commutative ring $R$ in which 2 is invertible, as a product of an…

Using morphic cohomology, we produce a sequence of conjectures, called morphic conjectures, which terminates at the Grothendieck standard conjecture A. A refinement of Hodge structures is given, and with the assumption of morphic…

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…

We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural…