1101 search results - page 107 / 221 » Forcing in proof theory |
154
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
111
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
83
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
93
Voted
CIE
2007
Springer
15 years 7 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
172
Voted
ILC
2007
Springer
15 years 6 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...