相关论文: Pre-filtrations, Pre-stable Canonical Rules, and t…

We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…

The Canonical Transformation theory of Yanai and Chan [J. Chem. Phys. 124, 194106 (2006)] provides a rigorously size-extensive description of dynamical correlation in multireference problems. Here we describe a new formulation of the theory…

We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without…

We present a canonical formalism for computing quantum fluctuations of certain discrete degrees of freedom in systems governed by integrable partial differential equations with known Hamiltonian structure, provided these models are…

This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different…

This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.

We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

The purpose of this paper is two-fold. First we explain the construction of the canonical model of filtered $A_\infty$-algebras given in the authors' book [FOOO]. The canonical model plays a crucial role in the study of Lagrangian Floer…

This work introduces a canonical structure for a broad class of unconstrained first-order algorithms that admit a Lur'e representation, including systems with relative degree greater than one, e.g., systems with delayed gradient feedback.…

In this paper, we give an extension of the J\'{o}nsson-Tarski representation theorem for both normal and non-normal modal algebras so that it preserves countably many infinitary meets and joins. To extend the J\'{o}nsson-Tarski…

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

We extend a well-known theorem of Murski\v{\i} to the probability space of finite models of a system $\mathcal{M}$ of identities of a strong idempotent linear Maltsev condition. We characterize the models of $\mathcal{M}$ in a way that can…

The aim of this work is to study the notions of lax protomodular and Ord-Mal'tsev category at the level of (coherent) varieties of (pre)ordered algebras and to further compare them, as has been done in the non-ordered context. We…

We use duality theorems to obtain presentations of some categories of modules. To derive these presentations we generalize a result of Cautis-Kamnitzer-Morrison [arXiv:1210.6437v4]: Let $\mathfrak{g}$ be a reductive Lie algebra, and $A$ an…

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…

In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic…

I study the modal theory of linear orders under embeddings, monotone maps, condensations, and end-extensions. I prove modality elimination for embeddings and monotone maps, show that condensations make scatteredness modally definable, and…