Minimal doxastic logic: probabilistic and other completeness theorems
Notre Dame Journal of Formal Logic 34 (4):499-526 (1993)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesKrister Segerberg (2010). Some Completeness Theorems in the Dynamic Doxastic Logic of Iterated Belief Revision. Review of Symbolic Logic 3 (2):228-246.
Branden Fitelson (2001). Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. Journal of Philosophical Logic 30 (1):51 - 55.
Kenneth Harris & Branden Fitelson (2001). Comments on Some Completeness Theorems of Urquhart and Méndez & Salto. Journal of Philosophical Logic 30 (1):51-55.
Norihiro Kamide (2009). Proof Systems Combining Classical and Paraconsistent Negations. Studia Logica 91 (2):217 - 238.
Giovanna Corsi (2002). A Unified Completeness Theorem for Quantified Modal Logics. Journal of Symbolic Logic 67 (4):1483-1510.
Paolo Gentilini (1993). Syntactical Results on the Arithmetical Completeness of Modal Logic. Studia Logica 52 (4):549 - 564.
Peter Milne (2004). Algebras of Intervals and a Logic of Conditional Assertions. Journal of Philosophical Logic 33 (5):497-548.
Charles B. Cross (1993). From Worlds to Probabilities: A Probabilistic Semantics for Modal Logic. Journal of Philosophical Logic 22 (2):169 - 192.
Albert Visser (1981). A Propositional Logic with Explicit Fixed Points. Studia Logica 40 (2):155 - 175.
Frank Wolter (1997). Completeness and Decidability of Tense Logics Closely Related to Logics Above K. Journal of Symbolic Logic 62 (1):131-158.
D. C. McCarty (1996). Undecidability and Intuitionistic Incompleteness. Journal of Philosophical Logic 25 (5):559 - 565.
Douglas N. Hoover (1987). An Analytic Completeness Theorem for Logics with Probability Quantifiers. Journal of Symbolic Logic 52 (3):802-816.
J. Paris & A. Vencovská (1998). Proof Systems for Probabilistic Uncertain Reasoning. Journal of Symbolic Logic 63 (3):1007-1039.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
