David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 69 (1):133-169 (2001)
Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal operators indexed by the terms of the logics. Thus, one can quantify over variables occurring in modal operators. In term-modal logics agents can be represented by terms, and knowledge of agents is expressed with formulas within the scope of modal operators.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
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
No references found.
Citations of this work BETA
Giovanna Corsi & Eugenio Orlandelli (2013). Free Quantified Epistemic Logics. Studia Logica 101 (6):1159-1183.
Arild Waaler, Johan W. Klüwer, Tore Langholm & Espen H. Lian (2007). Only Knowing with Degrees of Confidence. Journal of Applied Logic 5 (3):492-518.
Similar books and articles
Nobu-Yuki Suzuki (1989). An Algebraic Approach to Intuitionistic Modal Logics in Connection with Intermediate Predicate Logics. Studia Logica 48 (2):141 - 155.
Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
Frank Wolter (1997). Superintuitionistic Companions of Classical Modal Logics. Studia Logica 58 (2):229-259.
Dominic Gregory (2001). Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators. Journal of Philosophical Logic 30 (1):57-78.
Stéphane Demri & Dov Gabbay (2000). On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. Studia Logica 66 (3):349-384.
Ágnes Kurucz (2000). Arrow Logic and Infinite Counting. Studia Logica 65 (2):199-222.
Marcus Kracht & Frank Wolter (1997). Simulation and Transfer Results in Modal Logic – a Survey. Studia Logica 59 (2):149-177.
Added to index2009-01-28
Total downloads17 ( #216,615 of 1,906,981 )
Recent downloads (6 months)9 ( #78,891 of 1,906,981 )
How can I increase my downloads?