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

Authors

338

  1. FP
    François Pottier

    Institut national de recherche en sciences et technologies du numérique, France

    5 publications · 226 citations

    5

    h-index

  2. UD
    Ugo Dal Lago

    University of Bologna, Italy

    5 publications · 101 citations

    5

    h-index

  3. AW
    Andrew W. Appel

    Princeton University, United States

    3 publications · 282 citations

    3

    h-index

  4. SK
    Shriram Krishnamurthi

    Brown University, United States

    3 publications · 516 citations

    3

    h-index

  5. NS
    Natalia Sidorova

    Eindhoven University of Technology, Netherlands

    3 publications · 100 citations

    3

    h-index

1–5 of 338

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 11 publications · 224 citations

    11

    h-index

  2. ACM SIGPLAN Notices

    6 publications · 197 citations

    6

    h-index

  3. Mathematical Structures in Computer Science

    MSCS · 5 publications · 88 citations

    5

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 92 citations

    5

    h-index

  5. The Review of Symbolic Logic

    4 publications · 295 citations

    4

    h-index

1–5