English
Related papers

Related papers: Modal Logics of Some Hereditarily Irresolvable Spa…

200 papers

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

Topological metals are special conducting materials with gapless band structures and nontrivial edge-localized resonances, whose discovery has proved elusive because the traditional topological classification methods do not apply in this…

Mesoscale and Nanoscale Physics · Physics 2023-06-21 Wenting Cheng , Alexander Cerjan , Ssu-Ying Chen , Emil Prodan , Terry A. Loring , Camelia Prodan

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

Logic in Computer Science · Computer Science 2015-08-17 Christopher Hampson , Agi Kurucz

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

Computational Complexity · Computer Science 2012-06-13 Stefan Göller , Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Felix Weiss

Interval temporal logics provide a general framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments…

Logic in Computer Science · Computer Science 2012-10-10 Davide Bresolin , Dario Della Monica , Angelo Montanari , Pietro Sala , Guido Sciavicco

A central objective in Ramsey theory is determining whether restricted families of discrete structures necessarily contain substantially larger homogeneous substructures, compared to the unrestricted structures. In the setting of…

Combinatorics · Mathematics 2026-03-05 Asaf Shapira , Raphael Yuster

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

Logic in Computer Science · Computer Science 2021-04-27 Simone Martini , Andrea Masini , Margherita Zorzi

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

Logic · Mathematics 2022-08-23 Will Johnson

Let X be a smooth projective variety over a field k. For k separably closed, we prove that the subgroup of unramified classes in the Milnor K-group $K^M_i(k(X))$ of the function field of X is contained in the subgroup of n-divisible…

Algebraic Geometry · Mathematics 2026-05-22 Jean-Louis Colliot-Thélène , Stefan Schreieder

In this paper, we associate a new topology to a nonzero unital module $M$ over a commutative $R$, which is called Golomb topology of the $R$-module $M$. Let $M\ $be an\ $R$-module and $B_{M}$ be the family of coprime cosets $\{m+N\}$ where…

Commutative Algebra · Mathematics 2024-09-17 Uğur Yiğit , Suat Koç , Ünsal Tekir

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

Logic in Computer Science · Computer Science 2023-06-22 Brijesh Dongol , Ian J. Hayes , Georg Struth

We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not required to be normal: only the weaker properties of…

Logic · Mathematics 2016-05-27 Alessandra Palmigiano , Sumit Sourabh , Zhiguang Zhao

We extend non-emtpyness and irreducibility of Hassett divisors to the moduli spaces of $M$-polarizable cubic fourfolds for higher rank lattices $M$, which in turn provides a systematic approach for describing the irreducible components of…

Algebraic Geometry · Mathematics 2021-03-17 Song Yang , Xun Yu

We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On the one hand, it is well-known that every first-order predicate modal logic complete with respect to…

Logic · Mathematics 2019-12-24 Mikhail Rybakov , Dmitry Shkatov

The paper studies computability-theoretic aspects of topological $T_0$-spaces. We introduce effective versions of the notions of a countable $c$-poset and a (second-countable) topological space with base. Based on this, we prove an…

We study the Diophantine equation $a^k + b^k = c^k + d^k$ with integer variables and exponent $k>1$, under the linear constraint $(c+d) - (a+b) = h$. We analyze the geometry and arithmetic of these linear slices. On the central slice $h=0$,…

Number Theory · Mathematics 2025-12-09 Valery Asiryan

The Ginsburg--Sands theorem from topology states that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on $\omega$: indiscrete, discrete, initial segment, final segment,…

We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

Algebraic Geometry · Mathematics 2019-03-19 Nathália Moraes de Oliveira , Enric Nart

As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several…

Logic in Computer Science · Computer Science 2014-01-16 Piero A. Bonatti , Carsten Lutz , Frank Wolter
‹ Prev 1 8 9 10 Next ›