English
Related papers

Related papers: Degrees of the finite model property: the antidich…

200 papers

The degree of Kripke-incompleteness of a logic $L$ in some lattice $\mathcal{L}$ of logics is the cardinality of logics in $\mathcal{L}$ which share the same class of Kripke-frames with $L$. A celebrated result on Kripke-incompleteness is…

Logic · Mathematics 2025-09-25 Qian Chen

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

Logic · Mathematics 2026-05-13 Tenyo Takahashi

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

Logic in Computer Science · Computer Science 2019-09-04 Wesley H. Holliday , Tadeusz Litak

We consider the natural generalization of the notion of the order of a phantom map from the topological setting to triangulated categories. When applied to the derived category of the category of countable flat modules over a countable…

Logic · Mathematics 2025-06-24 Matteo Casarosa , Martino Lupini

The Blok-Esakia theorem states that there is an isomorphism from the lattice of intermediate logics onto the lattice of normal extensions of Grzegorczyk modal logic. The extension for multi-conclusion consequence relations was obtained by…

Logic · Mathematics 2018-10-23 Michał M. Stronkowski

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

Logic in Computer Science · Computer Science 2025-06-27 Amirhossein Akbar Tabatabai , Raheleh Jalali

We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the…

Logic · Mathematics 2020-11-05 Stanislav Kikot , Ilya Shapirovsky , Evgeny Zolin

It is a long-standing open problem whether modal logics of the form $\mathbf{K} \oplus \Box^n p \to \Box^m p$ for $n>m>1$ have the finite model property (FMP). We solve this by showing that any modal logic axiomatized by formulas of the…

Logic · Mathematics 2025-10-02 Søren Brinck Knudstorp

We study the cardinality of classes of equational theories (varieties) and logics by applying descriptive set theory. We affirmatively solve open problems raised by Jackson and Lee [Trans. Am. Math. Soc. 370 (2018), pp. 4785-4812] regarding…

Logic · Mathematics 2026-03-31 Juan P. Aguilera , Nick Bezhanishvili , Tenyo Takahashi

The famous Bloch--Kato conjecture implies that for a field $F$ containing a primitive $p$th root of unity, the cohomology ring of the absolute Galois group $G_F$ of $F$ with $\mathbb{F}_p$ coefficients is generated by degree one elements.…

Number Theory · Mathematics 2026-03-18 Sunil K. Chebolu , Ján Mináč , Cihan Okay , Andrew Schultz , Charlotte Ure

The logics $\mathsf{CS4}$ and $\mathsf{IS4}$ are the two leading intuitionistic variants of the modal logic $\mathsf{S4}$. Whether the finite model property holds for each of these logics have been long-standing open problems. It was…

Logic in Computer Science · Computer Science 2024-03-18 Philippe Balbiani , Martín Diéguez , David Fernández-Duque , Brett McLean

This monograph elucidates and extends many theorems and conjectures in analytic number theory and algebraic asymptotic analysis via the natural notion of "degree" and a more general notion that we call "logexponential degree." Specifically,…

Number Theory · Mathematics 2025-06-24 Jesse Elliott

In a recent paper, Krawczyk proved that there are continuum many axiomatic extensions of global consequence associated with the modal system $E$ that do not admit the local deduction detachment theorem. In algebraic parlance, he showed that…

Logic · Mathematics 2024-02-13 Zalán Gyenis , Zalán Molnár

Given a $(0,p)$-mixed characteristic complete discrete valued field $\mathcal{K}$ we define a class of finite field extensions called \emph{pseudo-perfect} extensions such that the natural restriction map on the mod-$p$ Milnor $K$-groups is…

Number Theory · Mathematics 2025-10-17 Srinivasan Srimathy

Recently, Baltag and van Benthem introduced a decidable logic of functional dependence (LFD) that extends the logic of Cylindrical Relativized Set Algebras (CRS) with atomic local dependence statements. Its semantics can be given in terms…

Logic in Computer Science · Computer Science 2021-09-20 Raoul Koudijs

Let $A$ be a finite-dimensional algebra over a field $k$. We define $A$ to be $\mathbf{C}$-dichotomic if it has the dichotomy property of the representation type on complexes of projective $A$-modules. $\mathbf{C}$-dichotomy implies the…

Representation Theory · Mathematics 2025-12-09 Jie Li , Chao Zhang

Let $A$ be a commutative ring, and assume every non-trivial ideal of $A$ has finite-index. We show that if ${\rm{SL}}_n(A)$ has bounded elementary generation then every conjugation-invariant norm on it is either discrete or precompact. If…

Group Theory · Mathematics 2025-04-07 Leonid Polterovich , Yehuda Shalom , Zvi Shem-Tov

The approximate non-deterministic degree of a Boolean function $f$, denoted $\mathsf{ndeg}_\epsilon(f)$ (written $\mathsf{N}_\epsilon(f)$ for brevity), is the minimum degree of a real polynomial $p$ such that $0 \le |p(x)| \le \epsilon$…

Computational Complexity · Computer Science 2026-05-25 Samruddhi Pednekar , Supartha Podder

We show that for any finite $p$-group $P$ of rank at least 2 and any algebraically closed field $k$ of characteristic $p$ the graded center $Z^*(\modbar(kP))$ of the stable module category of finite-dimensional $kP$-modules has infinite…

Representation Theory · Mathematics 2008-12-01 Markus Linckelmann , Radu Stancu

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

‹ Prev 1 2 3 10 Next ›