Graduate studies at Western
Studia Logica 72 (2):233-252 (2002)
|Abstract||The complexity of the satisfiability problems of various arrow logics and cylindric modal logics is determined. As is well known, relativising these logics makes them decidable. There are several parameters that can be set in such a relativisation. We focus on the following three: the number of variables involved, the similarity type and the kind of relativised models considered. The complexity analysis shows the importance and relevance of these parameters.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Kazimierz Świrydowicz (1990). On Regular Modal Logics with Axiom □ ⊤ → □□ ⊤. Studia Logica 49 (2):171 - 174.
Franz Baader & Ulrike Sattler (2001). An Overview of Tableau Algorithms for Description Logics. Studia Logica 69 (1):5-40.
Nobu-Yuki Suzuki (1989). An Algebraic Approach to Intuitionistic Modal Logics in Connection with Intermediate Predicate Logics. Studia Logica 48 (2):141 - 155.
Melvin Fitting, Lars Thalmann & Andrei Voronkov (2001). Term-Modal Logics. Studia Logica 69 (1):133-169.
Marcus Kracht & Frank Wolter (1997). Simulation and Transfer Results in Modal Logic – a Survey. Studia Logica 59 (2):149-177.
Frank Wolter (1997). Superintuitionistic Companions of Classical Modal Logics. Studia Logica 58 (2):229-259.
Ágnes Kurucz (2000). Arrow Logic and Infinite Counting. Studia Logica 65 (2):199-222.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #292,081 of 739,304 )
Recent downloads (6 months)0
How can I increase my downloads?