Results 1 
6 of
6
Propositional Lax Logic
, 1997
"... We investigate a novel intuitionistic modal logic, called Propositional Lax Logic, with promising applications to the formal verification of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints  a central notion in hardware verificat ..."
Abstract

Cited by 61 (8 self)
 Add to MetaCart
We investigate a novel intuitionistic modal logic, called Propositional Lax Logic, with promising applications to the formal verification of computer hardware. The logic has emerged from an attempt to express correctness `up to' behavioural constraints  a central notion in hardware verification  as a logical modality. The resulting logic is unorthodox in several respects. As a modal logic it is special since it features a single modal operator fl that has a flavour both of possibility and of necessity. As for hardware verification it is special since it is an intuitionistic rather than classical logic which so far has been the basis of the great majority of approaches. Finally, its models are unusual since they feature worlds with inconsistent information and furthermore the only frame condition is that the fl frame be a subrelation of the oeframe. In the paper we will provide the motivation for Propositional Lax Logic and present several technical results. We will investigate...
Categorical and Kripke Semantics for Constructive S4 Modal Logic
 In International Workshop on Computer Science Logic, CSL’01, L. Fribourg, Ed. Lecture Notes in Computer Science
, 2001
"... We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency, etc. Both systems have so far been studied m ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
(Show Context)
We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency, etc. Both systems have so far been studied mainly from typetheoretic and categorytheoretic perspectives, but Kripke models for similar systems were studied independently. Here we bring these threads together and prove duality results which show how to relate Kripke models to algebraic models and these in turn to the appropriate categorical models for these logics.
Extended CurryHoward Correspondence for a Basic Constructive Modal Logic
 In Proceedings of Methods for Modalities
, 2001
"... this paper. This calculus satises cutelimination, as for instance shown (in a more complicated form) in [Wij90]. This calculus is dierent from what is usually taken as the basic constructive system K, as we do not assume the distribution of possibility (3) over disjunctions neither in its binary f ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
this paper. This calculus satises cutelimination, as for instance shown (in a more complicated form) in [Wij90]. This calculus is dierent from what is usually taken as the basic constructive system K, as we do not assume the distribution of possibility (3) over disjunctions neither in its binary form 3(A _ B) ! (3A _ 3B) nor in its nullary form 3? ! ? The sequent calculus above corresponds to an axiomatic formulation given by axioms for intuitionistic logic, plus axioms: 2(A ! B) ! (2A ! 2B) 2(A ! B) ! (3A ! 3B) 2A3B ! 3(A B) together with rules for Modus Ponens and Necessitation: ` A ! B ` A ` B MP ` A ` 2A Nec Wijesekera proved a Craig interpolation theorem, one of the usual consequences of syntactic cutelimination and produced Kripke, algebraic and topological semantics for a calculus very similar to the one above. The only dierence is that he does assume 3? ! ?. From our \wish list" for logical systems only a natural deduction formulation and a categorical semantics are missing. These we proceed to discuss
Categorical and Kripke Semantics for Constructive Modal Logics
, 2001
"... We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency design, etc. Both systems have so far been studi ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency design, etc. Both systems have so far been studied mainly from a typetheoretic and categorytheoretic perspectives, but Kripke models for similar systems were studied independently. Here we bring these threads together and prove duality results which show how to relate Kripke models to algebraic models and these in turn to the appropriate categorical models for these logics.
Towards a Simply Typed CALculus for Semantic Knowledge Bases∗
"... This paper demonstrates how a constructive version of the description logic ALC can serve as a semantic type system for an extension of the simply typed λcalculus to express computations in knowledge bases. This cALculus embodies a functional core language which provides static type checking of sem ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This paper demonstrates how a constructive version of the description logic ALC can serve as a semantic type system for an extension of the simply typed λcalculus to express computations in knowledge bases. This cALculus embodies a functional core language which provides static type checking of semantic information processing of data whose structure is organised under a relational data model as used in description logics. The cALculus arises from a natural interpretation of the tableau rules for constructive ALC following the CurryHowardIsomorphism. 1
Towards Constructive Decision . . .
, 2009
"... This paper explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truthvalue interpretation to a constructive interpretation. We argue that such a strengthened interpretation is ..."
Abstract
 Add to MetaCart
This paper explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truthvalue interpretation to a constructive interpretation. We argue that such a strengthened interpretation is essential to represent applications with partial information adequately and to achieve consistency under abstraction as well as robustness under refinement. We introduce a constructive version of ALC, called cALC, for which we give a sound and complete Hilbert axiomatisation and a Gentzen tableau calculus showing finite model property and decidability. 1 When Constructiveness Matters Knowledge representatio