scholarly journals Evolutionary epistemology and non-normal modal logic of knowledge

Author(s):  
Vladimir О. Lobovikov ◽  
2007 ◽  
Vol 15 (3) ◽  
pp. 239-254 ◽  
Author(s):  
E. Calardo ◽  
V. V. Rybakov

2021 ◽  
pp. 64-81
Author(s):  
Atefeh Rohani ◽  
Thomas Studer

2018 ◽  
Vol 11 (3) ◽  
pp. 436-469 ◽  
Author(s):  
GURAM BEZHANISHVILI ◽  
NICK BEZHANISHVILI ◽  
JULIA ILIN

AbstractStable logics are modal logics characterized by a class of frames closed under relation preserving images. These logics admit all filtrations. Since many basic modal systems such as K4 and S4 are not stable, we introduce the more general concept of an M-stable logic, where M is an arbitrary normal modal logic that admits some filtration. Of course, M can be chosen to be K4 or S4. We give several characterizations of M-stable logics. We prove that there are continuum many S4-stable logics and continuum many K4-stable logics between K4 and S4. We axiomatize K4-stable and S4-stable logics by means of stable formulas and discuss the connection between S4-stable logics and stable superintuitionistic logics. We conclude the article with many examples (and nonexamples) of stable, K4-stable, and S4-stable logics and provide their axiomatization in terms of stable rules and formulas.


1981 ◽  
Vol 40 (1) ◽  
pp. 47-67 ◽  
Author(s):  
P. K. Schotch ◽  
R. E. Jennings

1996 ◽  
Vol 05 (03) ◽  
pp. 305-312 ◽  
Author(s):  
PAULO CAMARGO SILVA

Telepresence is constituted of a robotic system controlled by a human operator at a remote control station. In these systems the human operator is immerse in a virtual reality and the robot is controlled at distance by human operator. Often the human operator has that repeat tasks through robot. In this article we propose that the telepresence can use semi-autonomous (semi-reactive) robots, that execute the tasks that the operator repeats often, However, to create a relationship between the human operator and the semi-autonomous (semi-reactive) robot, it is necessary to develop a logic that combines the knowledge of the reactive robot and the knowledge of the human operator. On the other hand, in the last years we have seen the possibility to structure virtual worlds with Fuzzy Cognitive Maps. These maps can model virtual worlds with numerous actors. Moreover these FCMs can combine different virtual worlds. In this article we introduce a multi-agent modal logic of knowledge and belief that can be used in design of telep resence with semi-reactive robots. In this logic we describe possible worlds (“states of nature”) by fuzzy cognitive maps.


Studia Logica ◽  
1987 ◽  
Vol 46 (4) ◽  
pp. 291-309 ◽  
Author(s):  
Slavian Radev

2019 ◽  
Vol 13 (2) ◽  
pp. 416-435 ◽  
Author(s):  
SERGEI P. ODINTSOV ◽  
STANISLAV O. SPERANSKI

AbstractWe shall be concerned with the modal logic BK—which is based on the Belnap–Dunn four-valued matrix, and can be viewed as being obtained from the least normal modal logic K by adding ‘strong negation’. Though all four values ‘truth’, ‘falsity’, ‘neither’ and ‘both’ are employed in its Kripke semantics, only the first two are expressible as terms. We show that expanding the original language of BK to include constants for ‘neither’ or/and ‘both’ leads to quite unexpected results. To be more precise, adding one of these constants has the effect of eliminating the respective value at the level of BK-extensions. In particular, if one adds both of these, then the corresponding lattice of extensions turns out to be isomorphic to that of ordinary normal modal logics.


2016 ◽  
Vol 81 (1) ◽  
pp. 284-315 ◽  
Author(s):  
GURAM BEZHANISHVILI ◽  
NICK BEZHANISHVILI ◽  
ROSALIE IEMHOFF

AbstractWe introduce stable canonical rules and prove that each normal modal multi-conclusion consequence relation is axiomatizable by stable canonical rules. We apply these results to construct finite refutation patterns for modal formulas, and prove that each normal modal logic is axiomatizable by stable canonical rules. We also define stable multi-conclusion consequence relations and stable logics and prove that these systems have the finite model property. We conclude the paper with a number of examples of stable and nonstable systems, and show how to axiomatize them.


Sign in / Sign up

Export Citation Format

Share Document