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)

Related topics

Related topics

5 relations
Accessibility relationAtomic formulaModal logicModal operator

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Symmetries in Modal Logics
We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses… 
2012
2012
Extending ALCQ with Bounded Self-Reference
Self-reference has been recognized as a useful feature in description logics but is known to cause substantial problems with… 
2010
2010
Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
2009
2009
Testing Provers on a Grid - Framework Description
GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests… 
2008
2008
Boolean logics with relations
Review
2007
Review
2007
Seasonal migrations of pacific cod Gadus macrocephalus (Gadidae) off the eastern coast of Kamchatka
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
Notes on the Space Requirements for Checking Satisfiability in Modal Logics
Recently, there has been growing attention to the space requirements of tableau methods (see for example (7), (1), (12)). We have… 
2002
2002
An Elementary Construction for a Non-elementary Procedure
We consider the problem of the product finite model property for binary products of modal logics. First we give a new proof for… 
2002
2002
Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability
Heavily optimized decision procedures for propositional modal satisfiability are now becoming available. Two systems… 
1997
1997
New upper boundsfor satis ability in modal logics { the case-study of modal K
Traditional results in modal logics state that, if a formula ' is satissable in K (K-satissable), then it has a Kripke model M s… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)