English
Related papers

Related papers: Sahlqvist-Type Completeness Theory for Hybrid Logi…

200 papers

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…

Logic in Computer Science · Computer Science 2015-07-01 Clemens Kupke , Alexander Kurz , Yde Venema

Sandqvist's base-extension semantics for intuitionistic propositional logic defines a support relation parametrised by atomic bases, with validity identified as support in every base. Sandqvist's completeness theorem answers the global…

Logic in Computer Science · Computer Science 2026-03-16 Alexander V. Gheorghiu

Let H be a complex infinite dimensional Hilbert space. We describe the form of all *-semigroup endomorphisms $\phi$ of B(H) which are uniformly continuous on every commutative C*-subalgebra. In particular, we obtain that if $\phi$ satisfies…

Operator Algebras · Mathematics 2007-05-23 Lajos Molnar

We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…

Mesoscale and Nanoscale Physics · Physics 2015-05-13 Zohar Nussinov , Gerardo Ortiz

A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…

Logic in Computer Science · Computer Science 2015-07-01 Ugo Dal Lago , Marco Gaboardi

This thesis contains results relevant for two different classes of conformal field theory. We partly treat rational conformal field theory, but also derive results that aim at a better understanding of logarithmic conformal field theory.…

High Energy Physics - Theory · Physics 2012-10-26 Carl Stigner

The language of modal logic is capable of expressing first-order conditions on Kripke frames. The classic result by Henrik Sahlqvist identifies a significant class of modal formulas for which first-order conditions -- or Sahlqvist…

Logic in Computer Science · Computer Science 2022-06-14 Rui Li , Francesco Belardinelli

The present paper proposes a new introductory treatment of the very well known Sahlqvist correspondence theory for classical modal logic. The first motivation for the present treatment is {\em pedagogical}: classical Sahlqvist…

Logic · Mathematics 2016-06-23 Willem Conradie , Alessandra Palmigiano , Sumit Sourabh

We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and the descriptive two-sorted general frames of Ten Cate. We…

Logic · Mathematics 2016-04-26 Willem Conradie , Claudette Robinson

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

We compare three satisfiability notions for propositional formulas in the language {not, and, or} over a fixed finite-dimensional Hilbert space H=F^d with F in {R, C}. The first is the standard Hilbert-lattice semantics on the subspace…

Logic in Computer Science · Computer Science 2026-03-10 Joaquim Reizi Higuchi

For a finite-dimensional algebra {\Lambda}, we establish an explicit bijection between widely generated torsion(-free) classes and semibricks in mod {\Lambda}. Using the kappa order on the lattice of torsion classes with canonical join…

Representation Theory · Mathematics 2026-02-17 Alireza Nasr-Isfahani

A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semibounded if the corresponding operators $i\dd\pi(x)$ from the derived representation are uniformly bounded from above on some non-empty open subset of…

Representation Theory · Mathematics 2012-05-24 Karl-Hermann Neeb

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We introduce a notion of ellipticity of complexes of linear pseudodifferential operators acting on sections of $A$-Hilbert bundles over smooth manifolds, $A$ being a $C^*$-algebra. We prove that the cohomology groups of an $A$-elliptic…

Operator Algebras · Mathematics 2022-08-23 Svatopluk Krýsl

Modal logic with propositional quantifiers (i.e. second-order propositional modal logic (SOPML)) has been considered since the early time of modal logic. Its expressive power and complexity are high, and its van-Benthem-Rosen theorem and…

Logic in Computer Science · Computer Science 2021-10-19 Zhiguang Zhao

We consider "Hopfological" techniques as in \cite{Ko} but for infinite dimensional Hopf algebras, under the assumption of being co-Frobenius. In particular, $H=k[{\mathbb Z}]\#k[x]/x^2$ is the first example, whose corepresentations category…

K-Theory and Homology · Mathematics 2019-06-05 Marco A. Farinati

Rational Hopf algebras (certain quasitriangular weak quasi-Hopf $^*$-algebras) are expected to describe the quantum symmetry of rational field theories. In this paper methods are developped which allow for a classification of all rational…

High Energy Physics - Theory · Physics 2008-02-03 Jürgen Fuchs , Alexander Ganchev , Peter Vecsernyés

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…

Logic in Computer Science · Computer Science 2023-06-22 Paolo Pistone