English
Related papers

Related papers: Sufficient conditions for local tabularity of a po…

200 papers

Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the…

Logic in Computer Science · Computer Science 2016-09-15 Tomer Libal , Marco Volpe

We give a complete solution to the local classification program of higher rank partially hyperbolic algebraic actions. We show $C^\infty$ local rigidity of abelian ergodic algebraic actions for symmetric space examples, twisted symmetric…

Dynamical Systems · Mathematics 2025-03-20 Zhenqi Jenny Wang

We describe some results on moduli space of logarithmic connections equipped with framings on a $n$-pointed compact Riemann surface.

Algebraic Geometry · Mathematics 2021-03-24 Indranil Biswas , Michi-aki Inaba , Arata Komyo , Masa-Hiko Saito

Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the…

Logic in Computer Science · Computer Science 2024-02-14 Michele Loreti , Michela Quadrini

We show local and cocycle rigidity for $\R^k \times \Z^l$ partially hyperbolic translation actions on homogeneous spaces $\mc G/ \Lambda$. We consider a large class of actions whose geometric properties are more complicated than previously…

Dynamical Systems · Mathematics 2017-05-02 Kurt Vinhage , Zhenqi Jenny Wang

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We prove that all these logics are expressively complete, and we introduce sound and complete systems of…

Logic · Mathematics 2022-02-16 Fan Yang

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

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

Logic · Mathematics 2026-03-11 Itaï Ben Yaacov , Tomás Ibarlucía

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities, and corresponding residual implications. In this work, we…

Logic in Computer Science · Computer Science 2023-08-10 Tikhon Pshenitsyn

We introduce the notion of linear multifractional stable sheets in the broad sense (LMSS) with $\alpha\in(0,2]$, to include both linear multifractional Brownian sheets ($\alpha=2$) and linear multifractional stable sheets ($\alpha<2$). The…

Probability · Mathematics 2022-06-16 Yujia Ding , Qidi Peng , Yimin Xiao

For a conformal vector field on a closed, real-analytic, Lorentzian manifold we prove that the flow is locally isometric -- that it preserves a metric in the conformal class on a neighborhood of any point -- or the metric is everywhere…

Differential Geometry · Mathematics 2025-11-06 Sorin Dumitrescu , Charles Frances , Karin Melnick , Vincent Pecastaing , Abdelghani Zeghib

Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them…

Data Structures and Algorithms · Computer Science 2011-12-01 Noga Alon , Ronitt Rubinfeld , Shai Vardi , Ning Xie

We study in detail the one-variable local theory of functions holomorphic over a finite-dimensional commutative associative unital $\mathbb{C}$-algebra $\mathcal{A}$, showing that it shares a multitude of features with the classical…

Complex Variables · Mathematics 2019-01-03 Marin Genov

Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…

Combinatorics · Mathematics 2025-07-02 Aleksa Džuklevski , Dragan Mašulović

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

We compare different local-global principles for torsors under a reductive group G defined over a semiglobal field F. In particular if the F-group G s a retract rational F-variety, we prove that the local global principle holds for the…

Algebraic Geometry · Mathematics 2024-11-05 Philippe Gille , Raman Parimala

Pull-tabbing is an evaluation technique for functional logic programs which computes all non-deterministic results in a single graph structure. Pull-tab steps are local graph transformations to move non-deterministic choices towards the…

Programming Languages · Computer Science 2020-08-28 Michael Hanus , Finn Teegen

We determine the modal logic of fixed-point models of truth and their axiomatizations by Solomon Feferman via Solovay-style completeness results. Given a fixed-point model $\mathcal{M}$, or an axiomatization $S$ thereof, we find a modal…

Logic · Mathematics 2020-10-28 Carlo Nicolai , Johannes Stern

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2022-09-22 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingolfsdottir
‹ Prev 1 8 9 10 Next ›