English
Related papers

Related papers: Blending margins: The modal logic K has nullary un…

200 papers

We study the completeness problem for propositionally quantified modal logics on quantifiable general frames, where the admissible sets are the propositions the quantifiers can range over and expressible sets of worlds are admissible, and…

Logic · Mathematics 2024-06-25 Yifeng Ding , Yipu Li

In this paper, we establish a theorem that proves a condition when an inclusion morphism between simplicial sets becomes a weak homotopy equivalence. Additionally, we present two applications of this result. The first application…

Algebraic Topology · Mathematics 2024-05-07 Hisato Matsukawa

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

Logic · Mathematics 2014-08-26 Wojciech Dzik , Michal M. Stronkowski

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…

Logic in Computer Science · Computer Science 2025-03-04 Ali K. Caires-Santos , Maribel Fernández , Daniele Nantes-Sobrinho

Non notherian Formal schemes of perfectoid type (for example $\mathbb{Z}_p[p^{1/p^\infty}]\langle X^{1/p^\infty} \rangle$ along with its multivariate version) with rational degree are constructed and are shown to be admissible. These formal…

Algebraic Geometry · Mathematics 2019-07-05 Harpreet Singh Bedi

The main result is that the category of ordinary modules of an affine vertex operator algebra of a simply laced Lie algebra at admissible level is rigid and thus a braided fusion category. If the level satisfies a certain coprime property…

Quantum Algebra · Mathematics 2018-07-03 Thomas Creutzig

Several methods for checking admissibility of rules in the modal logic $S4$ are presented in [1], [15]. These methods determine admissibility of rules in $S4$, but they don't determine or give substitutions rejecting inadmissible rules. In…

Logic · Mathematics 2017-01-25 Mojtaba Aghaei , Maryam Rostami Giv

We consider a boundary value problem driven by the fractional p-Laplacian operator with a bounded reaction term. By means of barrier arguments, we prove H\"older regularity up to the boundary for the weak solutions, both in the singular…

Analysis of PDEs · Mathematics 2015-04-07 Antonio Iannizzotto , Sunra Mosconi , Marco Squassina

We investigate rational $G$-modules $M$ for a linear algebraic group $G$ over an algebraically closed field $k$ of characteristic $p > 0$ using filtrations by sub-coalgebras of the coordinate algebra $k[G]$ of $G$. Even in the special case…

Representation Theory · Mathematics 2015-10-27 Eric M. Friedlander

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

Let $G$ be a connected reductive algebraic group $G$ over an algebraically closed field $k$ of prime characteristic $p$, and $\ggg=\Lie(G)$. In this paper, we study modular representations of the reductive Lie algebra $\ggg$ with…

Representation Theory · Mathematics 2011-11-09 Yiyang Li , Bin Shu

Let p\in\{2,3\}, and let k be an imaginary quadratic field in which p decomposes into two distinct primes \mathfrak{p} and \bar{\mathfrak{p}}. Let k_\infty be the unique Z_p-extension of k which is unramified outside of \mathfrak{p}, and…

Number Theory · Mathematics 2012-06-05 Stéphane Viguié

Coalition Logic is primarily concerned with what coalitions can achieve, whereas what coalitions cannot achieve -- their \emph{inability} -- has received comparatively little explicit attention. This asymmetry matters in artificial…

Logic in Computer Science · Computer Science 2026-05-01 Shanxia Wang

Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…

Logic · Mathematics 2025-01-01 Vladislav Sliusarev

In this paper we continue the study of locally analytic representations of a $p$-adic Lie group $G$ in vector spaces over a spherically complete non-archimedean field $K$, building on the algebraic approach to such representations…

Number Theory · Mathematics 2007-05-23 Peter Schneider , Jeremy Teitelbaum

The theory of factor-equivalence of integral lattices establishes a far-reaching relationship between the Galois module structure of the unit group of the ring of integers of a number field and its arithmetic. For a number field $K$ that is…

Number Theory · Mathematics 2025-10-07 Zakariae Bouazzaoui , Donghyeok Lim

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Logic in Computer Science · Computer Science 2024-04-30 Hugo Férée , Iris van der Giessen , Sam van Gool , Ian Shillito