One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
We present a result which is obtained by combining a result of Carlson with the Finitary Dual Ramsey Theorem of Graham-Rothschild. We start by introducing some notation. We confor...
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...