Formal Proof Systems
Formal Proof Systems is a deductive framework in mathematical logic that consists of a precisely defined set of axioms and inference rules, distinguishing itself by enabling the systematic derivation of theorems through strictly formalized syntactic operations.
1.1K
Publications
62.6K
Citations
1.5K
Authors
583
Institutions
Publications per year
2017–2026
116
Variants
Logical Calculi
Parents
1.1K
The temporal logic of programs
Amir Pnueli · 1977 · 5.7K citations
An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM · 1969 · 3.9K citations · Full text
Frank Plumpton Ramsey · Proceedings of the London Mathematical Society · 1930 · 1.9K citations
An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM · 1983 · 1.5K citations
1–5 of 1.1K
1.5K
17
h-index
13
h-index
11
h-index
10
h-index
10
h-index
1–5 of 1.5K
583
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
26 h-index
74 publications
3.6K citations
University of Cambridge
Cambridge, United Kingdom
22 h-index
54 publications
3.3K citations

University of Edinburgh
Edinburgh, United Kingdom
20 h-index
41 publications
1.7K citations
Stanford University
Stanford, United States
20 h-index
36 publications
3.1K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
50 publications
2K citations
Université Paris Cité
Paris, France
16 h-index
26 publications
1.3K citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
16 h-index
31 publications
1.4K citations

Imperial College London
London, United Kingdom
14 h-index
32 publications
1.6K citations
1–8 of 583
53 publications · 3.4K citations
30
h-index
33 publications · 2.2K citations
24
h-index
29 publications · 1.2K citations
19
h-index
ENTCS · 40 publications · 812 citations
19
h-index
27 publications · 1.5K citations
19
h-index
1–5