English
Related papers

Related papers: On pre-local tabularity above $\mathrm{S4}\times \…

200 papers

We consider modal logics of products of neighborhood frames and prove that for any pair $L$ and $L'$ of logics from set $\{S4, D4, D, T\}$ modal logic of products of $L$-neighborhood frames and $L'$-neighborhood frames is the fusion of $L$…

Logic · Mathematics 2014-05-27 Andrey Kudinov

In this paper we study non-abelian extensions of a Lie group $G$ modeled on a locally convex space by a Lie group $N$. The equivalence classes of such extension are grouped into those corresponding to a class of so-called smooth outer…

Group Theory · Mathematics 2007-05-23 Karl-Hermann Neeb

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

Two extension problems are solved. First, the class of locally matricial algebras over an arbitrary field is closed under extensions. Second, the class of locally finite dimensional semisimple algebras over a fixed field is closed under…

Rings and Algebras · Mathematics 2025-04-18 K. R. Goodearl

Let E be an elliptic curve over the rationals. Let L be an infinite Galois extension of the rationals with uniformly bounded local degrees at almost all primes. We will consider the infinite extension L(E_tor) of the rationals where we…

Number Theory · Mathematics 2018-10-24 Linda Frey

We study the existence of lattices in almost abelian Lie groups that admit left invariant locally conformal K\"ahler or locally conformal symplectic structures in order to obtain compact solvmanifolds equipped with these geometric…

Differential Geometry · Mathematics 2020-04-06 A. Andrada , M. Origlia

In this article, we examine how clausal resolution can be applied to a specific, but widely used, non-classical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary…

Logic in Computer Science · Computer Science 2007-05-23 Michael Fisher , Clare Dixon , Martin Peim

We extend the approach in [Ann. Statist. 38 (2010) 2499-2524] for identifying locally optimal designs for nonlinear models. Conceptually the extension is relatively simple, but the consequences in terms of applications are profound. As we…

Statistics Theory · Mathematics 2012-10-04 Min Yang , John Stufken

Temporal logics stands for a widely adopted family of formalisms for the verification of computational devices, enriching propositional logics by operators predicating on the step-wise behaviour of a system. Its quantified extensions allow…

Logic in Computer Science · Computer Science 2022-01-05 Fabio Gadducci , Davide Trotta

We consider scalar-input control systems in the vicinity of an equilibrium, at which the linearized systems are not controllable. For finite dimensional control systems, the authors recently classified the possible quadratic behaviors.…

Optimization and Control · Mathematics 2019-05-27 Karine Beauchard , Frédéric Marbach

In this paper, we study the probabilistic local well-posedness of the cubic Schr\"odinger equation (cubic NLS): \[ (i\partial_{t} + \Delta) u = \pm |u|^{2} u \text{ on } [0,T) \times \mathbb{R}^{d}, \] with initial data being a Wiener…

Analysis of PDEs · Mathematics 2024-04-10 Jean-Baptiste Casteras , Juraj Foldes , Gennady Uraltsev

We investigate when the categories of all rational $A$-modules and of finite dimensional rational modules are closed under extensions inside the category of $C^*$-modules, where $C^*$ is the cofinite topological completion of $A$. We give a…

Category Theory · Mathematics 2011-10-13 Miodrag C. Iovanov

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

Logic in Computer Science · Computer Science 2020-02-17 Marianna Girlando , Sara Negri , Nicola Olivetti

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

Logic in Computer Science · Computer Science 2022-04-25 Takeshi Tsukada , Kazuyuki Asada

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…

Logic in Computer Science · Computer Science 2015-07-01 François Laroussinie , Antoine Meyer , Eudes Petonnet

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

Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…

Rings and Algebras · Mathematics 2026-01-13 Oksana Bezushchak

Solvable structures, likewise solvable algebras of local symmetries, can be used to integrate scalar ODEs by quadratures. Solvable structures, however, are particularly suitable for the integration of ODEs with a lack of local symmetries.…

Mathematical Physics · Physics 2009-11-13 Diego Catalano Ferraioli , Paola Morando

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…

Logic in Computer Science · Computer Science 2016-09-15 Gaëlle Fontaine , Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Loredana Sorrentino