English
Related papers

Related papers: Sahlqvist via Translation

200 papers

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

Formal Languages and Automata Theory · Computer Science 2015-01-19 Jiri Adamek , Stefan Milius , Robert Myers , Henning Urbat

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

In the present paper, we give a systematic study of the correspondence theory of generalized modal algebras and generalized modal spaces. The special feature of the present paper is that in the proof of the (right-handed) topological…

Logic · Mathematics 2022-05-06 Zhiguang Zhao

This work is a mathematician's attempt to understand intuitionistic logic. It can be read in two ways: as a research paper interspersed with lengthy digressions into rethinking of standard material; or as an elementary (but highly…

Logic · Mathematics 2017-05-02 Sergey A. Melikhov

Sandqvist's base-extension semantics (B-eS) for intuitionistic sentential logic grounds meaning relative to bases (rather than, say, models), which are arbitrary sets of permitted inferences over sentences. While his soundness proof is…

Logic · Mathematics 2025-04-29 Alexander V. Gheorghiu

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We present a new proof of the generalized {\L}o\'s-Tarski theorem ($\mathsf{GLT}(k)$) introduced in [1], over arbitrary structures. Instead of using $\lambda$-saturation as in [1], we construct just the "required saturation" directly using…

Logic in Computer Science · Computer Science 2018-11-16 Abhisekh Sankaran

Generalised quantifiers, which include Henkin's branching quantifiers, have been introduced by Mostowski and Lindstr\"om and developed as a substantial topic application of logic, especially model theory, to linguistics with work by…

Logic · Mathematics 2024-07-16 Loïc Allègre , Ophélie Lacroix , Christian Retoré

In the recent works \cite{Cannarsa-Chen-Cheng} and \cite{Cannarsa-Cheng3}, an intrinsic approach of the propagation of singularities along the generalized characteristics was obtained, even in global case, by a procedure of sup-convolution…

Dynamical Systems · Mathematics 2016-08-24 Cui Chen , Wei Cheng

A generalized anisotropic-diffusion framework is developed for transport problem in media described by a tensorial scattering coefficient and a scalar Henyey--Greenstein asymmetry factor. In this regime the classical similarity relation…

Optics · Physics 2026-02-24 Ernesto Pini , Michele Giusfredi , Lorenzo Pattelli

A notion of generalized $n$-semimodularity is introduced, which extends that of (sub/super)mod\-ularity in four ways at once. The main result of this paper, stating that every generalized $(n\colon\!2)$-semimodular function on the $n$th…

Probability · Mathematics 2019-02-15 Iosif Pinelis

G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…

Logic · Mathematics 2024-01-25 Hugo Herbelin , Danko Ilik

We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…

Logic · Mathematics 2026-04-14 Jim de Groot , Ian Shillito , Ranald Clouston

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

Logic · Mathematics 2025-11-05 Toby Meadows

Wick's theorem, known for yielding normal ordered from time-ordered bosonic fields may be generalized for a simple relationship between any two orderings that we define over canonical variables, in a broader sense than before. In this broad…

Quantum Physics · Physics 2018-08-08 Lajos Diósi

We derive Heisenberg uncertainty principles for pairs of Linear Canonical Transforms of a given function, by resorting to the fact that these transforms are just metaplectic operators associated with free symplectic matrices. The results…

Functional Analysis · Mathematics 2024-05-20 Nuno Costa Dias , Maurice de Gosson , João Nuno Prata

A crucial step in the history of General Relativity was Einstein's adoption of the principle of general covariance which demands a coordinate independent formulation for our spacetime theories. General covariance helps us to disentangle a…

History and Philosophy of Physics · Physics 2022-05-19 Daniel Grimmer

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

We present a new uniform method for studying modal companions of superintuitionistic rule systems and related notions, based on the machinery of stable canonical rules. Using this method, we obtain alternative proofs of the Blok-Esakia…

Logic · Mathematics 2025-08-27 Nick Bezhanishvili , Antonio Maria Cleani

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu