68 search results - page 11 / 14 » Canonicity and Completeness Results for Many-Valued Modal Lo... |
APAL
2010
13 years 7 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
AI
2005
Springer
13 years 7 months ago
2005
Springer
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the s...
LMCS
2007
13 years 7 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
FAC
2008
13 years 7 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...