4 research outputs found
Parametric Constructive Kripke-Semantics for Standard Multi-Agent Belief and Knowledge (Knowledge As Unbiased Belief)
We propose parametric constructive Kripke-semantics for multi-agent
KD45-belief and S5-knowledge in terms of elementary set-theoretic constructions
of two basic functional building blocks, namely bias (or viewpoint) and
visibility, functioning also as the parameters of the doxastic and epistemic
accessibility relation. The doxastic accessibility relates two possible worlds
whenever the application of the composition of bias with visibility to the
first world is equal to the application of visibility to the second world. The
epistemic accessibility is the transitive closure of the union of our doxastic
accessibility and its converse. Therefrom, accessibility relations for common
and distributed belief and knowledge can be constructed in a standard way. As a
result, we obtain a general definition of knowledge in terms of belief that
enables us to view S5-knowledge as accurate (unbiased and thus true)
KD45-belief, negation-complete belief and knowledge as exact KD45-belief and
S5-knowledge, respectively, and perfect S5-knowledge as precise (exact and
accurate) KD45-belief, and all this generically for arbitrary functions of bias
and visibility. Our results can be seen as a semantic complement to previous
foundational results by Halpern et al. about the (un)definability and
(non-)reducibility of knowledge in terms of and to belief, respectively
Arrows for knowledge-based circuits
Knowledge-based programs (KBPs) are a formalism for directly relating agents' knowledge and behaviour in a way that has proven useful for specifying distributed systems. Here we present a scheme for compiling KBPs to executable automata in finite environments with a proof of correctness in Isabelle/HOL. We use Arrows, a functional programming abstraction, to structure a prototype domain-specific synchronous language embedded in Haskell. By adapting our compilation scheme to use symbolic representations we can apply it to several examples of reasonable size
Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic
This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL
, in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established