1894 search results - page 62 / 379 » A TLA Proof System |
115
Voted
COMBINATORICS
2006
15 years 21 days ago
2006
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
98
Voted
JSYML
2010
14 years 7 months ago
2010
In this paper, we introduce the systems ns-ACA0 and ns-WKL0 of non-standard second-order arithmetic in which we can formalize non-standard arguments in ACA0 and WKL0, respectively...
ACNS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
118
click to vote
CADE
2005
Springer
16 years 1 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
99
Voted
MKM
2005
Springer
15 years 6 months ago
2005
Springer
Recently, significant advances have been made in formalised mathematical texts for large, demanding proofs. But although such large developments are possible, they still take an i...