English
Related papers

Related papers: Sufficient conditions for local tabularity of a po…

200 papers

Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

We define a notion of Lambda-simulation for coalgebraic modal logics, parametric on the choice Lambda of predicate liftings for a functor T. We show this notion is adequate in several ways: i) it preserves truth of positive formulas, ii)…

Logic in Computer Science · Computer Science 2013-04-12 Daniel Gorín , Lutz Schröder

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…

Logic · Mathematics 2019-02-20 David Gilbert , Giorgio Venturi

Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…

Logic in Computer Science · Computer Science 2025-05-23 Wojciech Przybyszewski , Szymon Toruńczyk

Let $G$ be a locally compact group with left regular representation $\lambda_{G}.$ We say that $G$ admits a frame of translates if there exist a countable set $\Gamma\subset G$ and $\varphi\in L^{2}(G)$ such that $(\lambda_{G}(x)…

Representation Theory · Mathematics 2018-02-09 Hartmut Fuhr , Vignon Oussa

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

We study the existence problem for a local implicit function determined by a system of nonlinear algebraic equations in the particular case when the determinant of its Jacobian matrix vanishes at the point under consideration. We present a…

Metric Geometry · Mathematics 2007-05-23 Victor Alexandrov

A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected…

Logic in Computer Science · Computer Science 2022-05-03 Fatemeh Seifan , Lutz Schröder , Dirk Pattinson

This paper is a commutative algebra introduction to the homological theory of quasi-coherent sheaves and contraherent cosheaves over quasi-compact semi-separated schemes. Antilocality is an alternative way in which global properties are…

Commutative Algebra · Mathematics 2024-02-26 Leonid Positselski

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

Let $G$ be a connected reductive group acting on a complex vector space $V$ and projective space ${\mathbb P}V$. Let $x\in V$ and ${\cal H}\subseteq {\cal G}$ be the Lie algebra of its stabilizer. Our objective is to understand points…

Representation Theory · Mathematics 2022-01-04 Bharat Adsul , Milind Sohoni , K V Subrahmanyam

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

We introduce a logical framework for the specification and verification of component-based systems, in which finitely many component instances are active, but the bound on their number is not known. Besides specifying and verifying…

Logic in Computer Science · Computer Science 2019-08-30 Marius Bozga , Radu Iosif , Joseph Sifakis

The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years. Both the semantic…

Logic in Computer Science · Computer Science 2015-07-01 Joerg Endrullis , Roel de Vrijer , Johannes Waldmann

In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…

Group Theory · Mathematics 2014-11-06 Rupert McCallum

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

We prove an optimal result on the birational rigidity and K-stability of index $1$ hypersurfaces in $\mathbb{P}^{n+1}$ with ordinary singularities when $n\gg 0$ and also study the birational superrigidity and K-stability of certain weighted…

Algebraic Geometry · Mathematics 2021-02-22 Ziquan Zhuang

We study the algorithmic properties of first-order monomodal logics of frames $\langle \mathbb{N}, \leq \rangle$, $\langle \mathbb{N}, < \rangle$, $\langle \mathbb{Q}, \leq \rangle$, $\langle \mathbb{Q}, < \rangle$, $\langle \mathbb{R},…

Logic in Computer Science · Computer Science 2021-05-26 Mikhail Rybakov , Dmitry Shkatov

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

Logic · Mathematics 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers. This approach has been regarded as inappropriate in practice, because the resulting…

Logic in Computer Science · Computer Science 2021-12-30 Jian Zhang