相关论文: McColm conjecture

The category of models of any theory $T$ in any first-order language $L$ has the surprising property that any small category that is elementarily equivalent with it, already embeds in it. The proof uses an abstract argument via ultrapowers,…

The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…

We prove a generalization of the Conley conjecture: Every Hamiltonian diffeomorphism of a closed symplectic manifold has infinitely many periodic orbits if the first Chern class vanishes over the second fundamental group. In particular, we…

In this paper, we prove that the Fourier entropy of an $n$-dimensional boolean function $f$ can be upper-bounded by $O(I(f)+ \sum\limits_{k\in[n]}I_k(f)\log \frac{1}{I_k(f)})$, where $I(f)$ is its total influence and $I_k(f)$ is the…

We exhibit a finitely presented group whose second cohomology contains a weakly bounded, but not bounded, class. As an application, we disprove a long-standing conjecture of Gromov about bounded primitives of differential forms on universal…

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences…

We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it…

We prove a weak version of the cross--product conjecture: ${F}(k+1,\ell) {F}(k,\ell+1) \geq (\frac12+\varepsilon) {F}(k,\ell) {F}(k+1,\ell+1)$, where ${F}(k,\ell)$ is the number of linear extensions for which the values at fixed elements…

The Hanna Neumann conjecture states that if F is a free group, then for all finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [ rank(H)-1 ] [ rank(K)-1 ] In this paper, we show that if one of the subgroups, say H, has a…

Let $K$ be a number field or a function field of characteristic 0. If $K$ is a number field, assume the $abc$-conjecture for $K$. We prove a variant of Zsigmondy's theorem for ramified primes in preimage fields of rational functions in…

Constraint propagation is one of the basic forms of inference in many logic-based reasoning systems. In this paper, we investigate constraint propagation for first-order logic (FO), a suitable language to express a wide variety of…

We show that for 1<n<m, the class Nr_nCA_m known to be non-elementary is pseudo elementary. When n and m are finite we use a two sorted theory, when n is finite and m infinite we use a three sorted one, and finally when both are infinite we…

We present a logical system CFP (Concurrent Fixed Point Logic) from whose proofs one can extract nondeterministic and concurrent programs that are provably total and correct with respect to the proven formula. CFP is an intuitionistic…

The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate $\mathsf{dp}_k(x_1,y_1,\ldots,x_k,y_k),$ expressing the existence of internally vertex-disjoint paths between $x_i$ and $y_i,$ for…

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…

We give a new proof of the Frankl-R\"odl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden distances, where over large alphabets our bound is…

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,…

We formulate two conjectures about etale cohomology and fundamental groups motivated by categoricity conjectures in model theory. One conjecture says that there is a unique Z-form of the etale cohomology of complex algebraic varieties, up…

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…