Automated reasoning in modal logics: A framework with applications
| Abstract | The principle that every truth is possibly necessary can now be shown to entail that every truth is necessary by a chain of elementary inferences in a perspicuous notation unavailable to Hegel. —Williamson [5, p. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesDov M. Gabbay (ed.) (2003). Many-Dimensional Modal Logics: Theory and Applications. Elsevier North Holland.
Riccardo Rosati (1999). Reasoning About Minimal Knowledge in Nonmonotonic Modal Logics. Journal of Logic, Language and Information 8 (2):187-203.
Tijn Borghuis (1998). Modal Pure Type Systems. Journal of Logic, Language and Information 7 (3):265-296.
Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
Franz Baader & Ulrike Sattler (2001). An Overview of Tableau Algorithms for Description Logics. Studia Logica 69 (1):5-40.
Melvin Fitting, Lars Thalmann & Andrei Voronkov (2001). Term-Modal Logics. Studia Logica 69 (1):133-169.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads11 ( #99,484 of 549,069 )Recent downloads (6 months)1 ( #63,185 of 549,069 )How can I increase my downloads? |
My notes
Discussion
