Soundness Theorems
Soundness Theorem is a formal metatheoretical result in many-valued logic that establishes the syntactic derivability of a formula implies its semantic validity across all designated truth values, thereby ensuring that the inference rules of the logical system preserve truth within the assigned many-valued semantics.
170
Publications
7K
Citations
338
Authors
190
Institutions
Publications per year
2017–2026
34
Parents
170
Matthew Flatt, Shriram Krishnamurthi, Matthias Felleisen · 1998 · 491 citations · Full text
Melvin Fitting · Fundamenta Informaticae · 1991 · 280 citations
Typed memory management in a calculus of capabilities
Karl Crary, David Walker, Greg Morrisett · 1999 · 251 citations
1–5 of 170
338
Institut national de recherche en sciences et technologies du numérique, France
5 publications · 226 citations
5
h-index
5
h-index
3
h-index
3
h-index
3
h-index
1–5 of 338
190
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
12 h-index
19 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
12 publications
694 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
10 publications
809 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
5 h-index
8 publications
228 citations

University of Bologna
Bologna, Italy
5 h-index
9 publications
158 citations
Université Paris Cité
Paris, France
4 h-index
6 publications
491 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
4 h-index
4 publications
146 citations
KU Leuven
Leuven, Belgium
4 h-index
12 publications
207 citations
1–8 of 190
PACMPL · 11 publications · 224 citations
11
h-index
6 publications · 197 citations
6
h-index
MSCS · 5 publications · 88 citations
5
h-index
Repository · 5 publications · 92 citations
5
h-index
4 publications · 295 citations
4
h-index
1–5