Switch to: Citations

References in:

Independence in Information Spaces

Studia Logica 100 (5):953-973 (2012)

Add references

You must login to add references.

An Independence Relation for Sets of Secrets.Sara Miner More & Pavel Naumov - 2010 - Studia Logica 94 (1):73-85.details A relation between two secrets, known in the literature as nondeducibility , was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call independence . This paper proposes a formal logical system for the independence relation, proves the completeness of the system with respect to a semantics of secrets, and shows that all axioms of the system are logically independent. Download Export citation Bookmark 6 citations
Logic of secrets in collaboration networks.Sara More & Pavel Naumov - 2011 - Annals of Pure and Applied Logic 162 (12):959-969.details The article proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system’s key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the proposed system with respect to a semantics of secrets. Download Export citation Bookmark 5 citations
Logic of secrets in collaboration networks.Sara Miner More & Pavel Naumov - 2011 - Annals of Pure and Applied Logic 162 (12):959-969.details The article proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system’s key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the proposed system with respect to a semantics of secrets. Download Export citation Bookmark 4 citations

1