Supracompact inference operations

When a proposition is cumulatively entailed by a finite setA of premisses, there exists, trivially, a finite subsetB ofA such thatB B entails for all finite subsetsB that are entailed byA. This property is no longer valid whenA is taken to be an arbitrary infinite set, even when the considered inference operation is supposed to be compact. This leads to a refinement of the classical definition of compactness. We call supracompact the inference operations that satisfy the non-finitary analogue of the above property. We show that for any arbitrary cumulative operationC, there exists a supracompact cumulative operationK(C) that is smaller thenC and agrees withC on finite sets. Moreover,K(C) inherits most of the properties thatC may enjoy, like monotonicity, distributivity or disjunctive rationality. The main part of the paper concerns distributive supracompact operations. These operations satisfy a simple functional equation, and there exists a representation theorem that provides a semantic characterization for this family of operations. We examine finally the case of rational operations and show that they can be represented by a specific kind of model particularly easy to handle.