Consistency in Organization

Internal organization relies heavily on psychological consistency requirements. This perspective has been emphasized in modern compensation theory, but has not been extended to organization theory. The idea is developed by starting from Williamson's discussion of idiosyncratic exchange. The perspective sheds new light on several topics in the theory of the firm, like the boundaries of the firm (“Williamson's puzzle”), the importance of fairness concerns within firms, the attenuation of incentives, or the role of routines. It implies a “perceptional” theory of the firm that is “realistic” in the sense advocated by Coase (1937)

Consistency Decision

The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map codes and soundness of that evaluation in set theoretical frame: internal p. r. map code equality is evaluated into set theoretical equality. So the free-variable consistency predicate of set theory is decided by set theory, {\omega}-consistency assumed. By G\"odel's second incompleteness theorem on undecidability of set theory's consistency formula by set theory under assumption of this {\omega}- consistency, classical set theory turns out to be {\omega}-inconsistent.Comment: arXiv admin note: text overlap with arXiv:1312.727

Consistency, converse consistency, and aspirations in TU-games

In problems of choosing ‘aspirations’ for TU-games, we study two axioms, ‘MW-consistency’ and ‘converse MW-consistency.’ In particular, we study which subsolutions of the aspiration correspondence satisfy MW-consistency and/or converse MW-consistency. We also provide axiomatic characterizations of the aspiration kernel and the aspiration nucleolus

Security Policy Consistency

With the advent of wide security platforms able to express simultaneously all the policies comprising an organization's global security policy, the problem of inconsistencies within security policies become harder and more relevant. We have defined a tool based on the CHR language which is able to detect several types of inconsistencies within and between security policies and other specifications, namely workflow specifications. Although the problem of security conflicts has been addressed by several authors, to our knowledge none has addressed the general problem of security inconsistencies, on its several definitions and target specifications.Comment: To appear in the first CL2000 workshop on Rule-Based Constraint Reasoning and Programmin