1274 search results - page 12 / 255 » New Proofs for |
71
Voted
MLQ
1998
15 years 3 days ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
85
Voted
CSL
1994
Springer
15 years 4 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
114
Voted
COMBINATORICS
2006
15 years 15 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...
95
Voted
CADE
2001
Springer
16 years 23 days ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
103
Voted
DIAGRAMS
2004
Springer
15 years 5 months ago
2004
Springer
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...