Related papers: A Finite Model Property for Intersection Types
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
We claim that if by a choice of the couplings the theory can be made conformally invariant (vanishing of the beta functions) it is automatically finite and vice versa. This is demonstrated by explicit example in supersymmetric gauge theory.…
In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
We extend the notions of complete intersection dimension and lower complete intersection dimension to the category of complexes with finite homology and verify basic properties analogous to those holding for modules. We also discuss the…
Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a…
We introduce a finiteness property for braided fusion categories, describe a conjecture that would characterize categories possessing this, and verify the conjecture in a number of important cases. In particular we say a category has F if…
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…
Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type {\Omega}, the auto- autoapplication and they thus do not ensure any form of normalization/productivity. Moreover, in most…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
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…
Recently, Baltag and van Benthem arXiv:2103.14946 [cs.LO] introduced a new decidable logic of functional dependence (LFD) with local dependence formulas and dependence quantifiers. The language is interpreted over dependence models, which…
Recently, Baltag and van Benthem introduced a decidable logic of functional dependence (LFD) that extends the logic of Cylindrical Relativized Set Algebras (CRS) with atomic local dependence statements. Its semantics can be given in terms…
In the present paper we use the theory of exact completions to study categorical properties of small setoids in Martin-L\"of type theory and, more generally, of models of the Constructive Elementary Theory of the Category of Sets, in terms…
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…
Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…
We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…
We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages with pattern matching features. To model such programming…
A new topological model is proposed in three dimensions as an extension of the BF-model. It is a three-dimensional counterpart of the two-dimensional model introduced by Chamseddine and Wyler ten years ago. The BFK-model, as we shall call…
We show that an accessible group with infinitely many ends has property $R_{\infty}$. That is, it has infinitely many twisted conjugacy classes for any twisting automorphism. We deduce that having property $R_{\infty}$ is undecidable…