Small infinitary epistemic logics

Review of Symbolic Logic 12 (4):702-735 (2019)

Abstract
We develop a series of small infinitary epistemic logics to study deductive inference involving intra-/interpersonal beliefs/knowledge such as common knowledge, common beliefs, and infinite regress of beliefs. Specifically, propositional epistemic logics GL are presented for ordinal α up to a given αo so that GL is finitary KDn with n agents and GL allows conjunctions of certain countably infinite formulae. GL is small in that the language is countable and can be constructive. The set of formulae Lα is increasing up to α = ω but stops at ω We present Kripke-completeness for GL for each α ≤ ω, which is proved using the Rasiowa–Sikorski lemma and Tanaka–Ono lemma. GL has a sufficient expressive power to discuss intra-/interpersonal beliefs with infinite lengths. As applications, we discuss the explicit definability of Axioms T, 4, 5, and of common knowledge in GL Also, we discuss the rationalizability concept in game theory in our framework. We evaluate where these discussions are done in the series GL, α ≤ ω.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s1755020319000029
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,182
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Lectures on Boolean Algebras.Paul R. Halmos - 1966 - Journal of Symbolic Logic 31 (2):253-254.
Introduction to Mathematical Logic.John Corcoran - 1964 - Journal of Symbolic Logic 54 (2):618-619.
Justifying Induction on Modal -Formulae.L. Alberucci, J. Krahenbuhl & T. Studer - 2014 - Logic Journal of the IGPL 22 (6):805-817.

View all 14 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Representing Any-Time and Program-Iteration by Infinitary Conjunction.Norihiro Kamide - 2013 - Journal of Applied Non-Classical Logics 23 (3):284 - 298.
Infinitary S5‐Epistemic Logic.Aviad Heifetz - 1997 - Mathematical Logic Quarterly 43 (3):333-342.
Game Logic and its Applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
An Infinitary Graded Modal Logic.Maurizio Fattorosi-Barnaba & Silvano Grassotti - 1995 - Mathematical Logic Quarterly 41 (4):547-563.
Unification in Epistemic Logics.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):91-105.
Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.
Epistemic Logic of Shallow Depths and Game Theoretical Applications.Mamoru Kaneko & Nobu-Yuki Suzuki - 2002 - In Frank Wolter, Heinrich Wansing, Maarten de Rijke & Michael Zakharyaschev (eds.), Advances in Modal Logic, Volume 3. CSLI Publications. pp. 279-298.
Substructural Epistemic Logics.Igor Sedlár - 2015 - Journal of Applied Non-Classical Logics 25 (3):256-285.

Analytics

Added to PP index
2019-03-16

Total views
9 ( #830,005 of 2,289,504 )

Recent downloads (6 months)
4 ( #307,373 of 2,289,504 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature