English
Related papers

Related papers: Toward the van Benthem Characterization Theorem fo…

200 papers

In this work, we introduce the notion of polarization of generalized Nijenhuis torsions and establish several algebraic identities. We prove that these polarizations are relevant in the characterization of Haantjes $C^{\infty}$(M)-modules…

Mathematical Physics · Physics 2023-02-07 Piergiulio Tempesta , Giorgio Tondo

In this paper we study the expressive power and definability for (extended) modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt-Thomason…

Logic · Mathematics 2007-05-23 Balder ten Cate , David Gabelaia , Dmitry Sustretov

Van Holten's covariant algorithm for deriving conserved quantities is presented, with particular attention paid to Runge-Lenz-type vectors. The classical dynamics of isospin-carrying particles is reviewed. Physical applications including…

High Energy Physics - Theory · Physics 2013-02-07 J. -P. Ngome

In the paper it is shown that the Kochen-Specker theorem follows from Burnside's theorem on noncommutative algebras. Accordingly, contextuality (as an impossibility of assigning binary values to projection operators independently of their…

Quantum Physics · Physics 2018-03-21 Arkady Bolotin

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

Using a central limit theorem for arrays of interacting quantum systems, we give analytical expressions for the density of states and the partition function at finite temperature of such a system, which are valid in the limit of infinite…

Statistical Mechanics · Physics 2009-11-10 Michael Hartmann , Guenter Mahler , Ortwin Hess

We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…

Logic · Mathematics 2024-05-09 Jose Moncayo , Pedro H. Zambrano

In standard process algebra, parallel components do not share a common state and communicate through synchronisation. The advantage of this type of communication is that it facilitates compositional reasoning. For modelling and analysing…

Logic in Computer Science · Computer Science 2020-09-01 Mark Bouwman , Bas Luttik , Wouter Schols , Tim A. C. Willemse

The paper continues the line of model-theoretic characterizations for versions of intuitionistic logic previously achieved by the author, further generalizing them. This results in a model-theoretic characterization of expressive powers of…

Logic · Mathematics 2018-02-01 Grigory Olkhovikov

The study of modal logic has witnessed tremendous development following the introduction of Kripke semantics. However, recent developments in programming languages and type theory have led to a second way of studying modalities, namely…

Logic in Computer Science · Computer Science 2024-05-09 G. A. Kavvos

We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…

Logic · Mathematics 2026-01-05 Mojtaba Mojtahedi

Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…

Logic in Computer Science · Computer Science 2026-03-27 Luca Aceto , Antonis Achilleos , Aggeliki Chalki , Anna Ingolfsdottir

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…

Logic in Computer Science · Computer Science 2015-07-01 Helle Hvid Hansen , Clemens Kupke , Eric Pacuit

Bayesian reasoning plays a significant role both in human rationality and in machine learning. In this paper, we introduce transfinite modal logic, which combines modal logic with ordinal arithmetic, in order to formalize Bayesian reasoning…

Artificial Intelligence · Computer Science 2022-04-08 Xinyu Wang

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped…

Logic · Mathematics 2026-02-04 Daniel Quigley

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses…

Logic · Mathematics 2019-08-28 Xinyu Wang

We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued…

Logic in Computer Science · Computer Science 2014-01-29 Bruno Teheux

We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general exponential models. For decomposable…

Statistics Theory · Mathematics 2007-06-13 Dan Geiger , Christopher Meek , Bernd Sturmfels

In this paper, we study the asymptotic posterior distribution of linear functionals of the density. In particular, we give general conditions to obtain a semiparametric version of the Bernstein-Von Mises theorem. We then apply this general…

Statistics Theory · Mathematics 2009-08-31 Vincent Rivoirard , Judith Rousseau

State-based models of concurrent systems are traditionally considered under a variety of notions of process equivalence. In the particular case of labelled transition systems, these equivalences range from trace equivalence to (strong)…

Logic in Computer Science · Computer Science 2020-10-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder