345 search results - page 5 / 69 » Kripke models for classical logic |
178
Voted
CALCO
2011
Springer
14 years 10 days ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
96
Voted
AMAST
2006
Springer
15 years 4 months ago
2006
Springer
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
112
click to vote
IJIS
2011
14 years 3 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
107
click to vote
DBPL
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
137
Voted
JELIA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...