English
Related papers

Related papers: Failure of the Blok-Esakia Theorem in the monadic …

200 papers

Let $k$ be a perfect field of positive characteristic and let $X$ be a smooth irreducible quasi-compact scheme over $k$. The Drinfeld-Kedlaya theorem states that for an irreducible $F$-isocrystal on $X$, the gap between consecutive generic…

Number Theory · Mathematics 2019-02-14 Joe Kramer-Miller

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

Logic · Mathematics 2024-11-20 Petr Cintula , George Metcalfe , Naomi Tokuda

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Logic in Computer Science · Computer Science 2016-02-22 Kaustuv Chaudhuri

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

Following a suggestion of Birkhoff and Von Neumann [Ann. Math. 37 (1936), 23-32], we pursue a joint study of quantum logic and intuitionistic logic. We exhibit a linear-time translation which for each quantum logic $Q$ and each…

Logic · Mathematics 2025-03-20 Juan P. Aguilera , Guillaume Massas

Let $\Gamma$ be a discrete subgroup of a simply connected, solvable Lie group~$G$, such that $\Ad_G\Gamma$ has the same Zariski closure as $\Ad G$. If $\alpha \colon \Gamma \to \GL_n(\real)$ is any finite-dimensional representation…

Representation Theory · Mathematics 2009-09-25 Dave Witte

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

Moores Paradox is a test case for any formal theory of belief. In Knowledge and Belief, Hintikka developed a multimodal logic for statements that express sentences containing the epistemic notions of knowledge and belief. His account…

Logic in Computer Science · Computer Science 2020-06-23 Andrés Páez

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, exhibiting a classical…

Logic in Computer Science · Computer Science 2023-08-11 Eben Blaisdell , Max Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

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

We introduce a family of modal expansions of {\L}ukasiewicz logic that are designed to accommodate modal translations of generalized basic logic (as formulated with exchange, weakening, and falsum). We further exhibit algebraic semantics…

Logic · Mathematics 2021-06-11 Wesley Fussner , William Zuluaga Botero

Let $X$ be a normal variety. Assume that for some reduced divisor $D \subset X$, logarithmic 1-forms defined on the snc locus of $(X, D)$ extend to a log resolution $\tilde X \to X$ as logarithmic differential forms. We prove that then the…

Algebraic Geometry · Mathematics 2020-11-05 Patrick Graf , Sándor J Kovács

We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set…

Logic in Computer Science · Computer Science 2008-02-21 Dietrich Kuske

We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these…

Logic in Computer Science · Computer Science 2019-03-14 Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski

This paper presents a unified algebraic study of a family of logics related to Abelian logic (Ab), the logic of Abelian lattice-ordered groups. We treat Ab as the base system and refer to its expansions as superabelian logics. The paper…

Logic · Mathematics 2026-04-17 Petr Cintula , Filip Jankovec , Carles Noguera

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

Let G be an automorphism group of a nontrivial t-(k^2,k,\lambda) design. In this paper, we prove that if G is block-transitive, then the socle of G cannot be a finite simple exceptional group of Lie type.

Group Theory · Mathematics 2025-08-27 Xingyu Chen , Haiyan Guan

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

In this paper we develop an almost general process to switch from abstract logics in the sense of Brown and Suszko to lattices. With this method we can establish dualities between some categories of abstract logics to the correspondent…

Logic · Mathematics 2014-10-30 Andreas B. M. Brunner , Darllan Conceição Pinto

While finite-variable fragments of the propositional modal logic S5--complete with respect to reflexive, symmetric and transitive frames--are polynomial-time decidable, the restriction to finite-variable formulas for logics of reflexive and…

Logic · Mathematics 2019-10-08 Mikhail Rybakov , Dmitry Shkatov