Results 1 
7 of
7
QuasiBoolean Encodings and Conditionals in Algebraic Specification
"... We develop a general study of the algebraic specification practice, originating from the OBJ tradition, which encodes atomic sentences in logical specification languages as Boolean terms. This practice originally motivated by operational aspects, but also leading to significant increase in expressiv ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
We develop a general study of the algebraic specification practice, originating from the OBJ tradition, which encodes atomic sentences in logical specification languages as Boolean terms. This practice originally motivated by operational aspects, but also leading to significant increase in expressivity power, has recently become important within the context of some formal verification methodologies mainly because it allows the use of simple equational reasoning for frameworks based on logics that do not have an equational nature. Our development includes a generic rigorous definition of the logics underlying the above mentioned practice, based on the novel concept of ‘quasiBoolean encoding’, a general result on existence of initial semantics for these logics, and presents a general method for employing Birkhoff calculus of conditional equations as a sound calculus for these logics. The high level of generality of our study means that the concepts are introduced and the results are obtained at the level of abstract institutions (in the sense of Goguen and Burstall [12]) and are therefore applicable to a multitude of logical systems and environments.
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
 COMPUTER SCIENCE LOGIC, CZECH REPUBLIC
, 2010
"... We prove “untyping” theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to th ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
We prove “untyping” theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to the typed settings. Some of these theorems are obtained via a detour through fragments of cyclic linear logic, and give rise to a substantial optimisation of standard proof search algorithms.
Borrowing Interpolation
, 2011
"... We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the socaled ‘institution theory’ which is a categorical abstract model theory providing a formal definition for the informal concept of ‘logical system’ and a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the socaled ‘institution theory’ which is a categorical abstract model theory providing a formal definition for the informal concept of ‘logical system’ and a mathematical concept of ‘homomorphism’ between logical systems. We develop three different styles or patterns to apply the proposed borrowing interpolation method. These three ways are illustrated by the development of a series of concrete interpolation results for logical systems that are used in mathematical logic or in computing science, most of these interpolation properties apparently being new results. These logical systems include fragments of (classical many sorted) first order logic with equality, preordered algebra and its Horn fragment, partial algebra, higher order logic. Applications are also expected for many other logical systems, including membership algebra, various types of order sorted algebra, the logic of predefined types, etc., and various combinations of the logical systems discussed here.
Untyping Typed Algebraic Structures
"... Algebraic structures sometimes need to be typed. For example, matrices over a ring form a ring, but the product is a only a partial operation: dimensions have to agree. Therefore, an easy way to look at matrices algebraically is to consider “typed rings”. We prove some “untyping ” theorems: in some ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Algebraic structures sometimes need to be typed. For example, matrices over a ring form a ring, but the product is a only a partial operation: dimensions have to agree. Therefore, an easy way to look at matrices algebraically is to consider “typed rings”. We prove some “untyping ” theorems: in some algebras (semirings, Kleene algebras, residuated monoids), types can be reconstructed from valid untyped equalities. As a consequence, the corresponding untyped decision procedures can be extended to the typed setting.
Under consideration for publication in Math. Struct. in Comp. Science Encoding Hybridised Institutions into First Order Logic
, 2013
"... A ‘hybridisation ’ of a logic, referred to as the base logic, consists of developing the characteristic features of hybrid logic on top of the respective base logic, both at the level of syntax (i.e. modalities, nominals, etc.) and of the semantics (i.e. possible worlds). By ‘hybridised institutions ..."
Abstract
 Add to MetaCart
A ‘hybridisation ’ of a logic, referred to as the base logic, consists of developing the characteristic features of hybrid logic on top of the respective base logic, both at the level of syntax (i.e. modalities, nominals, etc.) and of the semantics (i.e. possible worlds). By ‘hybridised institutions’ we mean the result of this process when logics are treated abstractly as institutions (in the sense of the institution theory of Goguen and Burstall). This work develops encodings of hybridised institutions into (manysorted) first order logic (abbreviated FOL) as a ‘hybridisation ’ process of abstract encodings of institutions into FOL, which may be seen as an abstraction of the well known standard translation of modal logic into first order logic. The concept of encoding employed by our work is that of comorphism from institution theory, which is a rather comprehensive concept of encoding as it features encodings both of the syntax and of the semantics of logics/institutions. Moreover we consider the socalled theoroidal version of comorphisms that encode signatures to theories, a feature that accommodates a wide range of concrete applications. Our theory is also general enough to accommodate various constraints on the possible worlds semantics as well a wide variety of quantifications. We also provide pragmatic sufficient conditions for the conservativity of the encodings to be preserved through the hybridisation process, which provides the possibility to shift a formal verification process from the hybridised institution to FOL. 1.
On the Existence of Translations of Structured Specifications
"... We provide a set of sufficient conditions for the existence of translations of structured specifications across specification formalisms. The most basic condition is the existence of a translation between the logical systems underlying the specification formalisms, which corresponds to the unstructu ..."
Abstract
 Add to MetaCart
We provide a set of sufficient conditions for the existence of translations of structured specifications across specification formalisms. The most basic condition is the existence of a translation between the logical systems underlying the specification formalisms, which corresponds to the unstructured situation. Our approach is based upon institution theory and especially upon a recent abstract approach to structured specifications in which both the underlying logics and the structuring systems are treated fully abstractly. Hence our result is applicable to a wide range of actual specification formalisms that may employ different logics as well as different structuring systems, and is very relevant within the context of the fastly developing heterogeneous specification paradigm. 1.
UNTYPING TYPED ALGEBRAS AND COLOURING CYCLIC LINEAR LOGIC ∗
, 2011
"... Vol. 8 (2:12) 2012, pp. 1–21 www.lmcsonline.org ..."
(Show Context)