Related papers: Hybrid logic for strict betweenness
In the present paper, we develop the algorithmic correspondence theory for hybrid logic with binder. We define the class of Sahlqvist inequalities, each inequality of which is shown to have a first-order frame correspondent effectively…
The differential equations with piecewise constant argument (DEPCAs, for short) is a class of hybrid dynamical systems (combining continuous and discrete). In this paper, under the assumption that the nonlinear term is partially unbounded,…
Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…
The purpose of this contribution is to initiate the study of integrable deformations for different superstring theory formalisms that manifest the property of (classical) integrability. In this paper we choose the hybrid formalism of the…
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…
Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…
In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…
We analyze a class of modal logics rendered insensitive to reflexivity by way of a modification to the semantic definition of the modal operator. We explore the extent to which these logics can be characterized, and prove a general…
Given a finite dimensional algebra $\Lambda$, we show that a frequently satisfied finiteness condition for the category ${\cal P}^{\infty}(\Lambda\rm{-mod})$ of all finitely generated (left) $\Lambda$-modules of finite projective dimension,…
We show that ideal submodules and closed ternary ideals in Hilbert modules are the same. We use this insight as a little peg on which to hang a little note about interrelations with other notions regarding Hilbert modules. In Section 3, we…
A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…
We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are…
We derive new Heisenberg-type uncertainty relations for both joint measurability and the error-disturbance tradeoff for arbitrary observables of finite-dimensional systems. The relations are formulated in terms of a directly operational…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two…
Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…
We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize…
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the…
A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive…