51 search results - page 10 / 11 » aiml 2008 |
AIML
2004
13 years 6 months ago
2004
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...
AIML
2004
13 years 6 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
AIML
1998
13 years 6 months ago
1998
In this paper I will propose a new approach to certain semantic puzzles due to Frege, Kripke and others, and the question of propositional attitudes, via the notion of belief revi...
AIML
2008
13 years 6 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
ESWS
2008
Springer
13 years 6 months ago
2008
Springer
Instant Messaging is in addition to Web and Email the most popular service on the Internet. With xOperator we demonstrate the implementation of a strategy which deeply integrates I...