Related papers: A note on first-order spectra with binary relation…
The spectrum of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we study the hierarchy of first-order spectra based on the number of variables. It has been conjectured…
The {\em spectrum} of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we show that when restricted to using only two variables, but allowing counting quantifiers, the…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
Spectrum of a first order sentence is the set of all $\alpha$ such that $G(n, n^{-\alpha})$ does not obey zero-one law w.r.t. this sentence. We have proved that the minimal number of quantifier alternations of a first order sentence with an…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
For a monadic sentence psi in the finite vocabulary we show that the spectra, the set of cardinalities of models of psi is almost periodic under reasonable conditions. The first is that every model is so called ``weakly k-decomposable''.…
We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…
We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…
We say that a first order formula $\Phi$ defines a graph $G$ if $\Phi$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of…
The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.
In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. G\"unter Asser…
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
We investigate the following problem: given a sample of classified strings, find a first-order sentence of minimal quantifier rank that is consistent with the sample. We represent strings as successor string structures, that is, finite…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
This is a review paper outlining recent progress in the spectral analysis of first order systems. We work on a closed manifold and study an elliptic self-adjoint first order system of linear partial differential equations. The aim is to…
We construct a formula $\phi$ which axiomatizes non-narrow rectangular grids without using any binary relations other than the grid neighborship relations. As a corollary, we prove that a set $A \subseteq \mathbb{N}$ is a spectrum of a…
We prove that for a finite first order structure $\mathbf{A}$ and a set of first order formulas $\Phi$ in its language with certain closure properties, the finitary relations on $A$ that are definable via formulas in $\Phi$ are uniquely…