AbstractThis work inaugurates a cycle of papers based on the following common idea. Given a property P(f) which is defined for Boolean functions ƒ: Bn→B, introduce and study a suitable “local” property p(ƒ, X) depending both on the function ƒ and on a point X∈Bn in such a way that for every Boolean function ƒ, property P(ƒ) is true if and only if p(ƒ, X>) holds for every X∈Bn.The first article of the series deals with local injectivity, showing in particular that for n ≔ 1 local injectivity coincides with global injectivity, whereas for n > 1 there is no injective Boolean function (in the classical sense). Two forthcoming papers will study local isotony and applications to extremal solutions of Boolean equations
AbstractBistable bidomains have been used to give a simple order-theoretic construction of a cartesi...
AbstractClasses of locally complex and locally simple functions are introduced. The classes are prov...
AbstractWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that...
AbstractThis cycle of papers is based on the following common idea. Given a property P(f) which is d...
Abstract The aim of this paper is to study a novel property of Boolean mappings called local interti...
AbstractClasses of locally complex and locally simple functions are introduced. The classes are prov...
AbstractWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that...
In this paper we study the expressiveness of local queries. By locality we mean --- informally --- t...
In this paper we study the expressiveness of local queries. By locality we mean --- informally --- t...
peer reviewedWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say...
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseud...
peer reviewedIn this paper we report recent results in [1] concerning local versions of monotonicity...
In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps ...
In this paper we report recent results concerning local versions of monotonicity for Boolean and pse...
In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps ...
AbstractBistable bidomains have been used to give a simple order-theoretic construction of a cartesi...
AbstractClasses of locally complex and locally simple functions are introduced. The classes are prov...
AbstractWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that...
AbstractThis cycle of papers is based on the following common idea. Given a property P(f) which is d...
Abstract The aim of this paper is to study a novel property of Boolean mappings called local interti...
AbstractClasses of locally complex and locally simple functions are introduced. The classes are prov...
AbstractWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that...
In this paper we study the expressiveness of local queries. By locality we mean --- informally --- t...
In this paper we study the expressiveness of local queries. By locality we mean --- informally --- t...
peer reviewedWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say...
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseud...
peer reviewedIn this paper we report recent results in [1] concerning local versions of monotonicity...
In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps ...
In this paper we report recent results concerning local versions of monotonicity for Boolean and pse...
In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps ...
AbstractBistable bidomains have been used to give a simple order-theoretic construction of a cartesi...
AbstractClasses of locally complex and locally simple functions are introduced. The classes are prov...
AbstractWe propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that...