Results 1  10
of
5,016
NonDenumerable Infinitary Modal Logic
"... Abstract: Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α 〉 of sets Γ of wellformed formulae and wellformed formulae α. In this paper I sh ..."
Abstract
 Add to MetaCart
Abstract: Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α 〉 of sets Γ of wellformed formulae and wellformed formulae α. In this paper I
Infinitary Modal Logic and Generalized Kripke Semantics
"... This paper deals with the infinitary modal propositional logic K!1, featuring countable disjunctions and conjunctions. It is known that the natural infinitary extension LK⇤!1 (here presented as a Taitstyle calculus, TK!1) of the standard sequent calculus LK⇤p for the propositional modal logic K is ..."
Abstract
 Add to MetaCart
This paper deals with the infinitary modal propositional logic K!1, featuring countable disjunctions and conjunctions. It is known that the natural infinitary extension LK⇤!1 (here presented as a Taitstyle calculus, TK!1) of the standard sequent calculus LK⇤p for the propositional modal logic K
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1310 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Coalgebraic Logic
 Annals of Pure and Applied Logic
, 1999
"... We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that infinitary modal logic contains characterizing formulas. That is, every modelworld pair is characterized up to bisimulation by an infinitary formula. The ..."
Abstract

Cited by 110 (0 self)
 Add to MetaCart
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that infinitary modal logic contains characterizing formulas. That is, every modelworld pair is characterized up to bisimulation by an infinitary formula
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1012 (7 self)
 Add to MetaCart
the effect of the execution of a program on the truth of a formula ', DL uses a modal construct <>', which
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 514 (2 self)
 Add to MetaCart
proving or modelchecking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof
Modality, Bisimulation And Interpolation In Infinitary Logic
, 1997
"... Rohit Parikh has been one of the pioneers at the interface of modal and dynamic logic. Bringing dynamic, processoriented concerns into modal logic has been a major move, whose repercussions are still being felt today. In this contribution, I consider the bridge concept of bisimulation, which links ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
modal logic with computational process theories. Our main results show how its modeltheoretic invariance properties, first established within firstorder model theory, may be lifted to infinitary logic, a natural generalized habitat for theories of programs and processes. The techniques used
On the Plurality of Worlds
, 1986
"... David Lewis is one of the most influential philosophers of our age, and On the Plurality of Worlds is his magnum opus. OPW1 offers an extended development and defense of the hypothesis that there are many universes, things of the same kind as the universe in which we all live, move, and have our bei ..."
Abstract

Cited by 687 (2 self)
 Add to MetaCart
being. Lewis calls these universes ―worlds‖, deliberately recalling the notion of a ―possible world ‖ familiar from modal logic and the metaphysics of modality. The title invokes the thesis of the book: there are pluralities of worlds, things of the same kind as the world we inhabit, differing only
RACER system description
, 2001
"... Abstract. RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first fullfledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability proble ..."
Abstract

Cited by 452 (41 self)
 Add to MetaCart
Abstract. RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first fullfledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms. RACER also implements a decision procedure for modal logic satisfiability
A Complete Axiomatization for ...
"... In this paper we present a completeness theorem for the infinitary modal logic ML!1 . The proof is based on the new notion of an infinitary modal consistency property. 1 1 Introduction One can make out several good reasons why infinitary modal logics should deserve our attention. In the first ..."
Abstract
 Add to MetaCart
In this paper we present a completeness theorem for the infinitary modal logic ML!1 . The proof is based on the new notion of an infinitary modal consistency property. 1 1 Introduction One can make out several good reasons why infinitary modal logics should deserve our attention
Results 1  10
of
5,016