There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking f...
: Since Keynes (1930) and Hicks (1939) propounded their theory of normal backwardation, the issue of whether hedgers must pay speculators an insurance premium has remained controve...
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
Abstract-- Our starting point is the multiplicative utility function which is extensively used in the theory of multicriteria decision making. Its associativity is shown and as its...