Skip to search formSkip to main contentSkip to account menu

Modal depth

In modal logic, the modal depth of a formula is the deepest nesting of modal operators (commonly and ). Modal formulas without modal operators have a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We construct, for any sentence of the modal mu calculus Psi, derived sentences in the modal fragment and the fragment without… 
2012
2012
In many applications, agents must reason about what other agents know, whether to coordinate with them or to come out on top in a… 
2012
2012
Self-reference has been recognized as a useful feature in description logics but is known to cause substantial problems with… 
2009
2009
GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests… 
2008
2008
Review
2007
Review
2007
On the basis of materials of bottom trawl surveys of 1974–1992, data of commercial statistics of 1995–2005, as well as literature… 
2002
2002
Recently, there has been growing attention to the space requirements of tableau methods (see for example (7), (1), (12)). We have…