Abstract. The semantic collapse problem is perhaps the main difficulty associated to the very powerful mechanism for combining logics known as fibring. In this paper we propose cryptofibred semantics as a generalization of fibred semantics, and show that it provides a solution to the collapsing problem. In particular, given that the collapsing problem is a special case of failure of conservativeness, we formulate and prove a sufficient condition for cryptofibring to yield a conservative extension of the logics being combined. For illustration, we revisit the example of combining intuitionistic and classical propositional logics
This article studies preservation of certain algebraic properties of propositional logics when combi...
AbstractIn this paper, we propose a semantics for logic programs with negation as failure, the Finit...
Abstract. In this paper a variation of the fibred semantics of D. Gabbay called plain fibring is pro...
Fibring is recognized as one of the main mechanisms in combining logics, with great significance in ...
abstract. This paper is a guided tour through the theory of fibring as a general mechanism for combi...
Abstract Until recently, truth-functionality has been considered essential to the mechanism for comb...
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and unders...
The method of fibring for combining logics includes some other methods as fusion as a special case. ...
A completeness theorem is established for logics with congruence endowed with general semantics (in ...
Abstract. The methodology of fibring is a successful framework for combining logical systems based o...
This paper develops a new framework for combining propositional logics, called "juxtaposit...
The problem of fibring paraconsistent logics is addressed. Such logics raise new problems in the sem...
We give a categorial characterization of how labelled deduction systems for logics with a propositio...
Fibring is defined as a mechanism for combining logics with a first-order base, at both the semantic...
Although 'glue semantics' is the most extensively developed theory of semantic composition for LFG, ...
This article studies preservation of certain algebraic properties of propositional logics when combi...
AbstractIn this paper, we propose a semantics for logic programs with negation as failure, the Finit...
Abstract. In this paper a variation of the fibred semantics of D. Gabbay called plain fibring is pro...
Fibring is recognized as one of the main mechanisms in combining logics, with great significance in ...
abstract. This paper is a guided tour through the theory of fibring as a general mechanism for combi...
Abstract Until recently, truth-functionality has been considered essential to the mechanism for comb...
Fibring is a powerful mechanism for combining logics, and an essential tool for designing and unders...
The method of fibring for combining logics includes some other methods as fusion as a special case. ...
A completeness theorem is established for logics with congruence endowed with general semantics (in ...
Abstract. The methodology of fibring is a successful framework for combining logical systems based o...
This paper develops a new framework for combining propositional logics, called "juxtaposit...
The problem of fibring paraconsistent logics is addressed. Such logics raise new problems in the sem...
We give a categorial characterization of how labelled deduction systems for logics with a propositio...
Fibring is defined as a mechanism for combining logics with a first-order base, at both the semantic...
Although 'glue semantics' is the most extensively developed theory of semantic composition for LFG, ...
This article studies preservation of certain algebraic properties of propositional logics when combi...
AbstractIn this paper, we propose a semantics for logic programs with negation as failure, the Finit...
Abstract. In this paper a variation of the fibred semantics of D. Gabbay called plain fibring is pro...