A logical framework is presented for representing and reasoning about nondeterministic programs that may not terminate. We propose a logic PDL(; ;, ||, d(∗)) which is an extension of dynamic logic such that the program constructors related to demonic operations are introduced in its language. A complete and sound Hilbert-style proof system is given and it is shown that PDL(; ;, ||, d(∗)) is dec...

Inquisitive semantics (cf. Groenendijk, 2008) provides a formal framework for reasoning about information exchange. The central logical notion that the semantics gives rise to is compliance. This paper presents an algorithm that computes the set of compliant responses to a given initiative. The algorithm is sound and complete. The implementation is accessible online via www.illc.uva.nl/inquisit...

Research on provenance in databases (or other settings) sometimes has an arbitrary flavor. Once we abandon the classical semantics of queries there is a large design space for alternative semantics that could provide some useful provenance information, but there is little guidance for how to explore this space or justify or compare different proposals. Topics from mathematical or philosophical ...


 Phonogram is a visual element in comics that represents the existence of sound. Together with picture elements, they both create construction governed by narrative. As manifestation sound, phonogram’s also delivers message form signs. By using semiotic approach, this study seeks to identify nature phonogram, its function, and way it produced perceived. Symbolic messages are created drama...

This short and informal article shows that, although Godel's theorem is valid using classical logic, there exists some four-valued logical system that is able to prove that arithmetic is both sound and complete. This article also describes a four-valued Prolog in some informal, brief and intuitive manner.

We use “nearly sound” logical constraints to infer hidden states of relational processes. We introduce a simple-transition cost model, which is parameterized by weighted constraints and a statetransition cost. Inference for this model, i.e. finding a minimum-cost state sequence, reduces to a single-state minimization (SSM) problem. For relational Horn constraints, we give a practical approach t...

We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems. We give a syntax and a relational semantics in which we abstract away from phases and probabilities. We present a sound proof system for this logi...

We present a logical relation for proving contextual equivalence in a probabilistic programming language (PPL) with continuous random variables and with a scoring operation for expressing observations and soft constraints. Our PPL model is based on a big-step operational semantics that represents an idealized sampler with likelihood weighting. The semantics treats probabilistic non-determinism ...