Ockham's razor and reasoning about information flow
Synthese 167 (2):391 - 408 (2009)
| Abstract | What is the minimal algebraic structure to reason about information flow? Do we really need the full power of Boolean algebras with co-closure and de Morgan dual operators? How much can we weaken and still be able to reason about multi-agent scenarios in a tidy compositional way? This paper provides some answers. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesKevin Kelly (2004). Justification as Truth-Finding Efficiency: How Ockham's Razor Works. Minds and Machines 14 (4):485-505.
Jan van Eijck & Fer-Jan de Vries (1995). Reasoning About Update Logic. Journal of Philosophical Logic 24 (1).
A. Baltag & S. Smets (2008). A Dynamic-Logical Perspective on Quantum Behavior. Studia Logica 89 (2):187 - 211.
Hilmi Demir (2008). Counterfactuals Vs. Conditional Probabilities: A Critical Analysis of the Counterfactual Theory of Information. Australasian Journal of Philosophy 86 (1):45 – 60.
Robert van Rooy (2003). Quality and Quantity of Information Exchange. Journal of Logic, Language and Information 12 (4):423-451.
P. Garcia & F. Esteva (1995). On Ockham Algebras: Congruence Lattices and Subdirectly Irreducible Algebras. Studia Logica 55 (2):319 - 346.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,761 of 550,803 )Recent downloads (6 months)1 ( #63,425 of 550,803 )How can I increase my downloads? |
My notes
Discussion
