Sciweavers

2573 search results - page 74 / 515
» Combinations of Modal Logics
Sort
View
ENTCS
2010
119views more  ENTCS 2010»
15 years 4 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
135
Voted
ENTCS
2002
121views more  ENTCS 2002»
15 years 3 months ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
126
Voted
IGPL
2008
85views more  IGPL 2008»
15 years 4 months ago
Independent Bases of Admissible Rules
We show that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules. Key words: admissible rule, independent basi...
Emil Jerábek
CADE
1997
Springer
15 years 8 months ago
Connection-Based Proof Construction in Linear Logic
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
Christoph Kreitz, Heiko Mantel, Jens Otten, Stepha...
158
Voted
AIML
2004
15 years 5 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou