3690 search results - page 20 / 738 » Computation with classical sequents |
Publication
Foundations of Mechanism Design: A Tutorial - Part 1: Key Concepts and Classical Results
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
TLCA
2001
Springer
14 years 2 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
TLCA
2009
Springer
14 years 5 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
SAC
2012
ACM
12 years 6 months ago
2012
ACM
In this paper, we present the use of Markov Chain Monte Carlo (MCMC) methods to attack the classical ciphers. We use frequency analysis as our basic tool. First we investigate the...