Related papers: A Finite Model Property for Intersection Types
We prove rigidity type results on the vanishing of stable (co)homology for modules of finite complete intersection dimension, results which generalize and improve upon known results. We also introduce a notion of pre-rigidity, which…
I present a criterion for all-order finiteness in N=1 SYM theories. Three applications are given; they yield all-order finite N=1 SYM models with global symmetries of the superpotential.
We propose an intersection type system for an imperative lambda-calculus based on a state monad and equipped with algebraic operations to read and write to the store. The system is derived by solving a suitable domain equation in the…
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…
We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
We present distributions of countable models and correspondent structural characteristics of complete theories with continuum many types: for prime models over finite sets relative to Rudin-Keisler preorders, for limit models over types and…
The present paper is devoted to study some completeness properties of transitive binary relational set, i.e., a set together with a transitive binary relation (so called t-set).
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
The subtyping rules for intersection types traditionally employ a transitivity rule (Barendregt et al. 1983), which means that subtyping does not satisfy the subformula property, making it more difficult to use in filter models for compiler…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
This is a survey, intended both for group theorists and model theorists, concerning the structure of pseudofinite groups, that is, infinite models of the first order theory of finite groups. The focus is on concepts from stability theory…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…
In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
A first-order theory T has the Schr\"oder-Bernstein (SB) property if any pair of elementarily bi-embeddable models are isomorphic. We prove that T has an expansion by constants that has the SB property if and only if T is superstable and…
Literature involving preferences of artificial agents or human beings often assume their preferences can be represented using a complete transitive binary relation. Much has been written however on different models of preferences. We review…
Building on prior work on distributed databases and the CALM Theorem, we define and study the question of free termination: in the absence of distributed coordination, what query properties allow nodes in a distributed (database) system to…