Related papers: Taylor is prime

In this paper, we present a first-order frame condition for interpretability logic and show that the condition is not modally definable. Yet, the frame-condition holds both on ILM and on ILP frames and, hence, is of potential importance for…

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

We present a review on the recently discovered link between the Lie theory,the theory of quiver Grassmannians, and various degenerations of flag varieties. Our starting point is the induced Poincar\'{e}--Birkhoff--Witt filtration on the…

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…

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

In this paper, we introduce $\phi$-$\delta$-primary elements in a compactly generated multiplicative lattice $L$ and obtain its characterizations. We prove many of its properties and investigate the relations between these structures. By a…

We study the set of networks, which consist of sources, sinks and neutral points, bijective to the permutations. The set of directed edges, which characterizes a network, is constructed from a polyomino or a Rothe diagram of a permutation…

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

Recently there has been significant progress in classifying integer friezes and $\text{SL}_2$-tilings. Typically, combinatorial methods are employed, involving triangulations of regions and inventive counting techniques. Here we develop a…

Convergence is a fundamental topic in analysis that is most commonly modelled using topology. However, there are many natural convergences that are not given by any topology; e.g., convergence almost everywhere of a sequence of measurable…

Under hypotheses required for the Taylor-Wiles method, we prove for forms of $U(3)$ which are compact at infinity that the lattice structure on upper alcove algebraic vectors or on principal series types given by the $\lambda$-isotypic part…

In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…

The main results of the paper points out the connection between the weak ordered relations and factor lattices defined by tolerances. It is proved that for any tolerance $T$ of a lattice $L$ the Dedekind-Mac Neille completion of $L/T$ is…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

A nearlattice is a join semilattice such that every principal filter is a lattice with respect to the induced order. Hickman and later Chajda et al independently showed that nearlattices can be treated as varieties of algebras with a…

We systematically compare three filtering methods used to extract topological excitations from lattice gauge configurations, namely smearing, Laplace filtering and the filtered fermionic topological charge (with chirally improved fermions).…

We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.

This is a survey of characterizations and relationships between some properties of lattices, particularly the modular, Arguesian, linear, and distributive properties, but also some other related properties. The survey emphasizes finite and…