Related papers: A Finite Model Property for Intersection Types
We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational…
In this paper we give a classification of complete intersection vanishing ideals on parameterized sets of clutter type over finite fields.
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
We present a type system that combines, in a controlled way, first-order polymorphism with intersectiontypes, union types, and subtyping, and prove its safety. We then define a type reconstruction algorithm that issound and terminating.…
We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…
Using approximations, we give several characterizations of separability of bimodules. We also discuss how separability properties can be used to transfer some representation theoretic properties from one ring to another one: contravariant…
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the…
In this paper we deal with verification of safety properties of parameterized systems with a tree topology. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which…
We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…
We remark that Pearl's Graphoid intersection property, also called intersection property in Bayesian networks, is a particular case of a general intersection property, in the sense of intersection of coverings, for factorisation spaces,…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
Given a finite dimensional algebra $\Lambda$, we show that a frequently satisfied finiteness condition for the category ${\cal P}^{\infty}(\Lambda\rm{-mod})$ of all finitely generated (left) $\Lambda$-modules of finite projective dimension,…
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.
Linear intersection pairs of linear codes have become of interest due to their nice algebraic properties and wide applications. In this paper, we focus on linear intersection pairs of cyclic codes over finite fields. Some properties of…
Refining and extending previous work by Retor\'e, we develop a systematic approach to intersection types via natural deduction. We show how a step of beta reduction can be seen as performing, at the level of typing derivations, Prawitz…
Transfer systems on finite posets have recently been gaining traction as a key ingredient in equivariant homotopy theory. Additionally, they also naturally occur in the data of a model structure. We give a complete characterization of all…