Related papers: A mixed logic with binary operators

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

Jolissaint and Stalder introduced definitions of mixing and weak mixing for von Neumann subalgebras of finite von Neumann algebras. In this note, we study various algebraic and analytical properties of subalgebras with these mixing…

The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…

In this paper we introduce the class of weak Heyting Brouwer algebras (WHB-algebras, for short). We extend the well known duality between distributive lattices and Priestley spaces, in order to exhibit a relational Priestley-like duality…

Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…

We establish necessary and sufficient conditions for the boundedness and compactness of weighted composition operators acting on weighted Dirichlet spaces and determine the spectrum of a certain class of such operators. Our results extend…

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

In this paper we go deep into the connection between duality and fields redefinition for general bilinear models involving the 1-form gauge field $A$. A duality operator is fixed based on "gauge embedding" procedure. Dual models are shown…

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

We notice that for any positive integer $k$, the set of $(1,2)$-specialized characters of level $k$ standard $A_{1}^{(1)}$-modules is the same as the set of rescaled graded dimensions of the subspaces of level $2k+1$ standard…

The scope of this text is to study a process that induces another proof of the Spectral Embedding Theorem: that any densely defined symmetric operator can be extended by a multiplication operator through an embedding of the Hilbert space…

In a previous paper we generalized the theory of W*-modules to the setting of modules over nonselfadjoint dual operator algebras, obtaining the class of weak*-rigged modules. At that time we promised a forthcoming paper devoted to other…

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also…