中文
相关论文

相关论文: On partitioning Kripke frames of finite height

200 篇论文

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…

逻辑 · 数学 2009-11-13 Sérgio Marcelino , Pedro Resende

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

逻辑 · 数学 2021-01-20 Christian Herrmann

We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization,…

We settle a conjecture by Bik and Marigliano stating that the degree of a one-dimensional discrete model with rational maximum likelihood estimator is bounded above by a linear function in the size of its support, therefore showing that…

统计理论 · 数学 2026-03-04 Carlos Améndola , Viet Duc Nguyen , Janike Oldekop

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

计算机科学中的逻辑 · 计算机科学 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

We observe that the notion of a trivial Serre fibration, a Serre fibration, and being contractible, for finite CW complexes, can be defined in terms of the Quillen lifting property with respect to a single map M-->/\ of finite topological…

范畴论 · 数学 2021-12-30 M. Gavrilovich , K. Pimenov

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

计算机科学中的逻辑 · 计算机科学 2010-11-23 Facundo Carreiro

Assume that $p>2$, and let $\mathscr{O}_K$ be a $p$-adic discrete valuation ring with residue field admitting a finite $p$-basis, and let $R$ be a formally smooth formally finite-type $\mathscr{O}_K$-algebra. (Indeed, we allow slightly more…

数论 · 数学 2013-10-30 Wansu Kim

We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…

逻辑 · 数学 2020-08-18 Nicholas Pischke

(Pre)closure spaces are a generalization of topological spaces covering also the notion of neighbourhood in discrete structures, widely used to model and reason about spatial aspects of distributed systems. In this paper we introduce an…

计算机科学中的逻辑 · 计算机科学 2021-01-01 Davide Castelnovo , Marino Miculan

It is proved that an irreducible quasifinite $W_\infty$-module is a highest or lowest weight module or a module of the intermediate series; a uniformly bounded indecomposable weight $W_\infty$-module is a module of the intermediate series.…

表示论 · 数学 2007-05-23 Yucai Su , Bin Xin

The module category of any artin algebra is filtered by the powers of its radical, thus defining an associated graded category. As an extension of the degree of irreducible morphisms, this text introduces the degree of morphisms in the…

表示论 · 数学 2018-05-22 Claudia Chaio , Patrick Le Meur , Sonia Trepode

We study the satisfiability problem for the fluted fragment extended with transitive relations. We show that the logic enjoys the finite model property when only one transitive relation is available. On the other hand we show that the…

计算机科学中的逻辑 · 计算机科学 2019-06-24 Ian Pratt-Hartmann , Lidia Tendera

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

代数几何 · 数学 2021-03-09 Niels Lubbes

Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current…

计算机科学中的逻辑 · 计算机科学 2013-04-02 Radu Iosif , Adam Rogalewicz , Jiri Simacek

For any ordinal \Lambda, we can define a polymodal logic GLP(\Lambda), with a modality [\xi] for each \xi<\Lambda. These represent provability predicates of increasing strength. Although GLP(\Lambda) has no Kripke models, Ignatiev showed…

逻辑 · 数学 2012-04-24 David Fernández-Duque , Joost J. Joosten

There are two known general results on the finite model property (fmp) of commutators [L,L'] (bimodal logics with commuting and confluent modalities). If L is finitely axiomatisable by modal formulas having universal Horn first-order…

计算机科学中的逻辑 · 计算机科学 2017-10-18 Agi Kurucz

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

表示论 · 数学 2018-09-25 Calin Chindris , Ryan Kinser

We define a discrete closure operation for definably complete locally o-minimal structures $\mathcal M$. The pair of the underlying set of $\mathcal M$ and the discrete closure operation forms a pregeometry. We define the rank of a…

逻辑 · 数学 2022-04-06 Masato Fujita

We define a class of pre-ordered abelian groups that we call finite-by-Presburger groups, and prove that their theory is model-complete. We show that certain quotients of the multiplicative group of a local field of characteristic zero are…

逻辑 · 数学 2016-03-30 Jamshid Derakhshan , Angus Macintyre