Proof Compression is a methodological framework in proof theory that reduces the size of formal proofs while preserving their logical validity, thereby distinguishing itself from other proof-theoretic techniques by prioritizing efficiency in proof representation without altering semantic content.
5
Publications
77
Citations
5
Authors
4
Institutions
Publications per year
2017–2026
3
Parents
Publications
5
Recent Progress in Proof Mining in Nonlinear Analysis.
Ulrich Kohlenbach · FLAP · 2017 · 22 citations
Compressing Propositional Refutations
Hasan Amjad · Electronic Notes in Theoretical Computer Science · 2007 · 16 citations · Full text
Proof Compression and NP Versus PSPACE
L. Gordeev · Studia Logica · 2017 · 11 citations
1–5 of 5
Authors
5
- LS
1
h-index
- HA
1
h-index
- GR
1
h-index
- UK
1
h-index
- LG
1
h-index
1–5 of 5
Institutions
4
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
13 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
1 publications
16 citations
University of Tübingen
Tübingen, Germany
1 h-index
1 publications
11 citations
Centre Inria de Saclay
Palaiseau, France
1 h-index
1 publications
15 citations
1–4 of 4
Venues
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 1 publications · 15 citations
1
h-index
- Studia Logica
1 publications · 11 citations
1
h-index
- FLAP
1 publications · 22 citations
1
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 1 publications · 16 citations
1
h-index
- Electronic Proceedings in Theoretical Computer Science
1 publications · 13 citations
1
h-index
1–5