Modal Logics of Stone Spaces

Order ◽  
2011 ◽  
Vol 29 (2) ◽  
pp. 271-292 ◽  
Author(s):  
Guram Bezhanishvili ◽  
John Harding
Keyword(s):  
Modal Logics ◽  
Stone Spaces

Modal logics with Belnapian truth values

2010 ◽  
Vol 20 (3) ◽  
pp. 279-304 ◽  
Author(s):  
Serge P Odintsov ◽  
Heinrich Wansing
Keyword(s):  
Modal Logics ◽  
Truth Values

QUASI-TOPOLOGICAL STONE SPACES

1994 ◽  
Vol 27 (3-4) ◽  
Author(s):  
Bronislaw Tembrowski
Keyword(s):  
Stone Spaces

scholarly journals On modal logics arising from scattered locally compact Hausdorff spaces

2019 ◽  
Vol 170 (5) ◽  
pp. 558-577
Author(s):  
Guram Bezhanishvili ◽  
Nick Bezhanishvili ◽  
Joel Lucero-Bryan ◽  
Jan van Mill
Keyword(s):  
Modal Logics ◽  
Hausdorff Spaces ◽  
Locally Compact

Modal logics of domains on the real plane

Studia Logica ◽  
1983 ◽  
Vol 42 (1) ◽  
pp. 63-80 ◽  
Author(s):  
V. B. Shehtman
Keyword(s):  
Modal Logics ◽  
Real Plane ◽  
The Real

Analyzing completeness of axiomatic functional systems for temporal × modal logics

2010 ◽  
Vol 56 (1) ◽  
pp. 89-102 ◽  
Author(s):  
Alfredo Burrieza ◽  
Inmaculada P. de Guzmán ◽  
Emilio Muñoz-Velasco
Keyword(s):  
Modal Logics ◽  
Functional Systems

scholarly journals A category of compositional domain-models for separable Stone spaces

2003 ◽  
Vol 290 (1) ◽  
pp. 599-635 ◽  
Author(s):  
Fabio Alessi ◽  
Paolo Baldan ◽  
Furio Honsell
Keyword(s):  
Domain Models ◽  
Stone Spaces

A Modal Semantics of Negation in Logic Programming

1992 ◽  
Vol 16 (3-4) ◽  
pp. 231-262
Author(s):  
Philippe Balbiani
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Modal Logics ◽  
Kripke Models ◽  
Logic Programs ◽  
Modal Semantics ◽  
Soundness And Completeness ◽  
Modal Completion ◽  
Well Foundedness

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.

Sign in / Sign up

Export Citation Format

Share Document