Related papers: Independence of Essential Sets in Finite Implicati…
In this paper we will show that using implicative algebras one can produce models of intuitionistic set theory generalizing both realizability and Heyting-valued models. This has as consequence that if one assumes the inaccessible cardinal…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…
Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
Recently a class of generalized information measures was defined on sets of items parametrized by submodular functions. In this paper, we propose and study various notions of independence between sets with respect to such information…
We extend two kinds of causal models, structural equation models and simulation models, to infinite variable spaces. This enables a semantics for conditionals founded on a calculus of intervention, and axiomatization of causal reasoning for…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…
On a finite structure, the polymorphism invariant relations are exactly the primitively positively definable relations. On infinite structures, these two sets of relations are different in general. Infinitary primitively positively…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…
Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new…
Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…
We examine the notion of anticonfinement and the role it has to play in the singularity analysis of discrete systems. A singularity is said to be anticonfined if singular values continue to arise indefinitely for the forward and backward…
Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical…
A new family of positive, trace-preserving maps is introduced. It is defined using the mutually unbiased measurements, which generalize the notion of mutual unbiasedness of orthonormal bases. This family allows one to define entanglement…