English
Related papers

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

200 papers

We make a systematic study of the infinitesimal lifting conditions of a pseudo finite type map of noetherian formal schemes. We recover the usual general properties in this context, and, more importantly, we uncover some new phenomena. We…

Algebraic Geometry · Mathematics 2007-05-23 Leovigildo Alonso , Ana Jeremias , Marta Perez

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

The planar scattering amplitudes of $\mathcal{N} = 4$ super-Yang--Mills theory display symmetries and structures which underlie their relatively simple analytic properties such as having only logarithmic singularities and no poles at…

High Energy Physics - Theory · Physics 2018-09-26 Zvi Bern , Michael Enciso , Chia-Hsien Shen , Mao Zeng

We develop the fundamentals of a local regularity theory for prescribed Jacobian equations which extend the corresponding results for optimal transportation equations. In this theory the cost function is extended to a generating function…

Analysis of PDEs · Mathematics 2013-04-25 Neil S Trudinger

(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…

Logic in Computer Science · Computer Science 2021-01-01 Davide Castelnovo , Marino Miculan

TLA is a popular temporal logic for writing stuttering-invariant specifications of digital systems. However, TLA lacks higher-order features useful for specifying modern software written in higher-order programming languages. We use…

Logic in Computer Science · Computer Science 2020-09-16 Philip Johnson-Freyd , Jon Aytac , Geoffrey Hulette

Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple…

Logic in Computer Science · Computer Science 2019-10-28 Jens Oliver Gutsfeld , Markus Müller-Olm , Christian Dielitz

For a class of systems of nonlinear and nonlocal balance laws in several space dimensions, we prove the local in time existence of solutions and their continuous dependence on the initial datum. The choice of this class is motivated by a…

Analysis of PDEs · Mathematics 2015-04-02 Rinaldo M. Colombo , Francesca Marcellini

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Category Theory · Mathematics 2013-04-29 Peter Hines

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

Different extended objects can fall in different ways, depending on their internal structures. Some motions are nevertheless impossible, regardless of internal structure. This paper derives universal constraints on extended-body motion,…

General Relativity and Quantum Cosmology · Physics 2023-09-14 Abraham I. Harte , David Dwyer

We define when a ternary term $m$ of an algebraic language $\mathcal{L}$ is called a \textit{distributive nearlattice term} (DN-term) of a sentential logic $\mathcal{S}$. Distributive nearlattices are ternary algebras generalising Tarski…

Logic · Mathematics 2018-02-13 Luciano J. González

We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected…

Logic in Computer Science · Computer Science 2015-07-01 Roman Kontchakov , Ian Pratt-Hartmann , Frank Wolter , Michael Zakharyaschev

We study the rationality properties of the moduli space $\mathcal{A}_g$ of principally polarised abelian $g$-folds over $\mathbb{Q}$ and apply the results to arithmetic questions. In particular we show that any principally polarised abelian…

Algebraic Geometry · Mathematics 2025-03-26 Daniel Loughran , Gregory Sankaran

The main objects of study are adic spaces with logarithmic structures. After establishing the basic definitions, we analyze the Kummer \'etale and pro-Kummer \'etale topologies on log adic spaces. In particular, we show that log adic spaces…

Number Theory · Mathematics 2019-12-16 Hansheng Diao

Let $R$ be a commutative Noetherian ring with non-zero identity and $\fa$ an ideal of $R$. Let $M$ be a finite $R$--module of of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the…

Commutative Algebra · Mathematics 2011-08-09 Moharram Aghapournahr

It is the aim of this work to study product structures on four dimensional solvable Lie algebras. We determine all possible paracomplex structures and consider the case when one of the subalgebras is an ideal. These results are applied to…

Rings and Algebras · Mathematics 2010-12-23 A. Andrada , M. L. Barberis , I. Dotti , G. Ovando

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of…

Logic in Computer Science · Computer Science 2015-07-01 Everardo Bárcenas , Jesús Lavalle

We present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical relations. We first observe that logical predicates are…

Logic in Computer Science · Computer Science 2024-01-15 Sergey Goncharov , Alessio Santamaria , Lutz Schröder , Stelios Tsampas , Henning Urbat