221,866 research outputs found
On the equivalence between progressive taxation and inequality reduction
We establish the precise connections between progressive taxation and inequality reduction, in a setting where the level of tax revenue to be raised is endogenously fixed and tax schemes are balanced. We show that, in contrast with the traditional literature on taxation, the equivalence between inequality reduction and the combination of progressivity and income order preservation does not always hold in this setting. However, we show that, among rules satisfying consistency and, either revenue continuity, or revenue monotonicity, the equivalence remains intact.progressivity, inequality reduction, income order preservation, consistency, taxation
Causal Consistency: Beyond Memory
In distributed systems where strong consistency is costly when not
impossible, causal consistency provides a valuable abstraction to represent
program executions as partial orders. In addition to the sequential program
order of each computing entity, causal order also contains the semantic links
between the events that affect the shared objects -- messages emission and
reception in a communication channel , reads and writes on a shared register.
Usual approaches based on semantic links are very difficult to adapt to other
data types such as queues or counters because they require a specific analysis
of causal dependencies for each data type. This paper presents a new approach
to define causal consistency for any abstract data type based on sequential
specifications. It explores, formalizes and studies the differences between
three variations of causal consistency and highlights them in the light of
PRAM, eventual consistency and sequential consistency: weak causal consistency,
that captures the notion of causality preservation when focusing on convergence
; causal convergence that mixes weak causal consistency and convergence; and
causal consistency, that coincides with causal memory when applied to shared
memory.Comment: 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel
Programming, Mar 2016, Barcelone, Spai
The Role of Consistency and Diversity in Building Knowledge in Family Preservation
Family preservation has been criticized for implementing programs that are not theoretically founded. One result of this circumstance is a lack of information regarding processes and outcomes of family preservation services. The knowledge base of family preservation is thus rather limited at present and will remain limited unless theory is consistently integrated within individual programs. A model for conceptualizing how theoretical consistency may be implemented within programs is presented and applied to family preservation. It is also necessary for programs to establish theoretical consistency before theoretical diversity, both within individual and across multiple programs, in order to advance the field in meaningful ways. A developmental cycle of knowledge generation is presented and applied to family preservation
Consistency preservation and crazy formulas in BMS
International audienceWe provide conditions under which seriality is preserved during an update in the BMS framework. We consider not only whether the entire updated model is serial but also whether its generated submodels are serial. We also introduce the notion of crazy formulas which are formulas such that after being publicly announced at least one of the agents' beliefs become inconsistent
Dualized Simple Type Theory
We propose a new bi-intuitionistic type theory called Dualized Type Theory
(DTT). It is a simple type theory with perfect intuitionistic duality, and
corresponds to a single-sided polarized sequent calculus. We prove DTT strongly
normalizing, and prove type preservation. DTT is based on a new propositional
bi-intuitionistic logic called Dualized Intuitionistic Logic (DIL) that builds
on Pinto and Uustalu's logic L. DIL is a simplification of L by removing
several admissible inference rules while maintaining consistency and
completeness. Furthermore, DIL is defined using a dualized syntax by labeling
formulas and logical connectives with polarities thus reducing the number of
inference rules needed to define the logic. We give a direct proof of
consistency, but prove completeness by reduction to L.Comment: 47 pages, 10 figure
Substituting fields within the action: consistency issues and some applications
In field theory, as well as in mechanics, the substitution of some fields in
terms of other fields at the level of the action raises an issue of consistency
with respect to the equations of motion. We discuss this issue and give an
expression which neatly displays the difference between doing the substitution
at the level of the Lagrangian or at the level of the equations of motion. Both
operations do not commute in general. A very relevant exception is the case of
auxiliary variables, which are discussed in detail together with some of their
relevant applications. We discuss the conditions for the preservation of
symmetries - Noether as well as non-Noether - under the reduction of degrees of
freedom provided by the mechanism of substitution. We also examine how the
gauge fixing procedures fit in our framework and give simple examples on the
issue of consistency in this case.Comment: 17 page
- …