# To Know is to Know the Value of a Variable

@inproceedings{Baltag2016ToKI, title={To Know is to Know the Value of a Variable}, author={Alexandru Baltag}, booktitle={Advances in Modal Logic}, year={2016} }

We develop an epistemic logic that can express knowledge of a dependency between variables (or complex terms). An epistemic dependency formula K1n a t says that agent a knows the value of term t conditional on being given the values of terms t1, ..., tn. We add dynamic operators [!t1, . . . , tn] , capturing the e↵ect of publicly (and simultaneously) announcing the values of terms t1, . . . , tn. We prove completeness, decidability and finite model property.

No Paper Link Available

## Topics from this paper

## 16 Citations

Uncertainty-Based Semantics for Multi-Agent Knowing How Logics

- Computer ScienceTARK
- 2021

We introduce a new semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard…

Epistemic Logic with Functional Dependency Operator

- Computer ScienceArXiv
- 2017

This paper proposes a new operator Kf to express knowledge of the functional dependencies between variables, and axiomatizes three such logics in a single agent setting by allowing the function domain to vary relative to different agents and possible worlds.

Knowing Values and Public Inspection

- Computer Science, MathematicsICLA
- 2017

A sound and strongly complete axiomatization for the single and multi-agent case, making use of the well-known Armstrong axioms for dependencies in databases.

A Simple Logic of Functional Dependence

- Computer Science, MathematicsJ. Philos. Log.
- 2021

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as…

Learning What Others Know

- Computer Science, MathematicsLPAR
- 2020

A number of powerful dynamic-epistemic logics for multi-agent information sharing and acts of publicly or privately accessing other agents’ information databases are proposed and completely axiomatize several such logics and prove their decidability.

N ov 2 01 6 Knowing Values and Public Inspection

- 2016

We present a basic dynamic epistemic logic of “knowing the value”. Analogous to public announcement in standard DEL, we study “public inspection”, a new dynamic operator which updates the agents’…

De Re Updates

- Computer ScienceTARK
- 2021

This paper obtains complete axiomatizations for the counterparts of public announcement logic and event-model-based DEL based on new reduction axioms taking care of the interactions between dynamics and assignments.

How to Agree without Understanding Each Other: Public Announcement Logic with Boolean Definitions

- Computer ScienceTARK
- 2019

A conservative extension of Public Announcement Logic (PAL) in which agents have knowledge or belief about both the truth values and the meanings of propositions is presented.

Thinking About Causation: A Causal Language with Epistemic Operators

- Computer ScienceDaLí
- 2020

This paper proposes a formal framework for modeling the interaction of causal and (qualitative) epistemic reasoning. To this purpose, we extend the notion of a causal model with a representation of…

A New Modal Framework for Epistemic Logic

- Computer Science, MathematicsTARK
- 2017

This work proposes a very general and powerful framework based on quantifier-free predicate language extended by a new modality $\Box^x$, which packs exactly $\exists x \Box$ together, and axiomatizes the logic over S5 frames with intuitive axioms to capture the interaction between $\Box$ and know-that operator in an epistemic setting.

## References

SHOWING 1-10 OF 32 REFERENCES

To know or not to know: epistemic approaches to security protocol verification

- Computer ScienceSynthese
- 2010

An overview of work in the field is given and the cost of the epistemic operators in terms of model checking complexity is discussed, to which degree the use of epistemics is essential for the analysis of security protocols.

Conditionally Knowing What

- Computer ScienceAdvances in Modal Logic
- 2014

The completeness proof is highly non-trivial, compared to the singleagent case, which requires different techniques inspired by first-order intensional logic.

EPISTEMIC LOGIC AND INFORMATION UPDATE

- Mathematics
- 2008

Epistemic logic investigates what agents know or believe about certain factual descriptions of the world, and about each other. It builds on a model of what information is (statically) available in a…

Toward a Dynamic Logic of Questions

- Computer ScienceJ. Philos. Log.
- 2012

This work gives a complete logic in dynamic-epistemic style for events of raising, refining, and resolving an issue, all in the presence of information flow through observation or communication, and explores extensions of the framework to multi-agent scenarios and long-term temporal protocols.

Knowing whether A or B

- Philosophy, Computer ScienceSynthese
- 2009

This paper analyzes knowledge attributions of the form “s knows whether A or B” in an epistemic logic with alternative questions, and proposes an account of the context-sensitivity of the corresponding sentences and of their presuppositions.

Modal Dependence Logic

- 2008

We introduce a modal language which involves the concept of dependence. We give two game-theoretic definitions for the semantics of the language, and one inductive, and prove the equivalence of all…

The Logic of Public Announcements and Common Knowledge and Private Suspicions

- Mathematics, Computer ScienceTARK
- 1998

This paper presents a logical system in which various group-level epistemic actions are incorporated into the object language and contains the infinitary operators used in the standard modeling of common knowledge.

Knowing That, Knowing What, and Public Communication: Public Announcement Logic with Kv Operators

- Computer ScienceIJCAI
- 2013

It is shown that in the setting of PAL, replacing the Kv operator with its generalized version does not increase the expressive power of the resulting logic, so it is suggested that the more flexible generalization can be used instead of the original PAL+Kv.

Dependency Structures of Data Base Relationships

- Computer ScienceIFIP Congress
- 1974

The results of the present paper are applied to derive new and simpler proofs of some theorems of Casey and Delobel [5] and some conclusions are given.

Learning by Questions and Answers: From Belief-Revision Cycles to Doxastic Fixed Points

- Mathematics, Computer ScienceWoLLIC
- 2009

The long-term behavior of iterated belief revision with higher-level doxastic information is investigated, interested in whether or not the agent's beliefs, her "knowledge" and her conditional beliefs stabilize eventually or keep changing forever.