Similar Items: Strong negation in the theory of computable functionals TCF
- A proof of strong normalisation using domain theory
- On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
- Strongly Complete Logics for Coalgebras
- On the Strong Equivalences for LPMLN Programs
- The Complexity of Infinite Computations In Models of Set Theory
- Representations of measurable sets in computable measure theory