This paper argues that exhaustification is empirically and theoretically important as a tool in the semantic description of various constructions in natural language. Discussion f...
Abstract. In this paper we propose a certification technique for noninterference of Java programs based on rewriting logic, a very general logical and semantic framework efficientl...
For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be -reduced individually. Underspecified versions can ...
Manuel Bodirsky, Katrin Erk, Alexander Koller, Joa...
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...