English
Related papers

Related papers: Tableau systems for some Ivlev-like (quantified) m…

200 papers

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…

Logic in Computer Science · Computer Science 2007-05-23 Alessio Guglielmi

Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We…

Logic in Computer Science · Computer Science 2015-07-01 Ben Moszkowski

We establish the strictness of several set quantifier alternation hierarchies that are based on modal logic, evaluated on various classes of finite graphs. This extends to the modal setting a celebrated result of Matz, Schweikardt and…

Logic in Computer Science · Computer Science 2016-03-01 Fabian Reiter

L.L. Maksimova and L. Esakia, V. Meskhi showed that the modal logic S4 has exactly 5 pretabular extensions: PM1-PM5. In this paper, we study and systematize the problem of unification for all given pretabular logics. We showed that PM2,PM3…

Logic · Mathematics 2021-08-09 Stepan Igorevich Bashmakov

We study non-self-adjoint Hamiltonian systems on Sturmian time scales, defining Weyl-Sims sets, which replace the classical Weyl circles, and a matrix-valued $M-$function on suitable cone-shaped domains in the complex plane. Furthermore, we…

Classical Analysis and ODEs · Mathematics 2010-01-25 Douglas R. Anderson

Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…

Combinatorics · Mathematics 2023-02-21 Igor Araujo , Alexander E. Black , Amanda Burcroff , Yibo Gao , Robert A. Krueger , Alex McDonough

We present algorithms giving upper and lower bounds for the number of independent primitive rational Vassiliev invariants of degree m modulo those of degree m-1. The values have been calculated for the formerly unknown degrees m = 10, 11,…

q-alg · Mathematics 2008-02-03 Jan A. Kneissler

We compare a relativistic and a nonrelativistic version of Ostrogradsky's method for higher-time derivative theories extended to scalar field theories and consider as an alternative a multi-field variant. We apply the schemes to space-time…

High Energy Physics - Theory · Physics 2024-05-07 Andreas Fring , Takano Taira , Bethan Turner

A logic $L$ is called tabular if it is the logic of some finite frame and $L$ is pretabular if it is not tabular while all of its proper consistent extensions are tabular. In this work, we study pretabular tense logics in the lattice…

Logic · Mathematics 2025-09-30 Qian Chen

Temporal logic inference is the process of extracting formal descriptions of system behaviors from data in the form of temporal logic formulas. The existing temporal logic inference methods mostly neglect uncertainties in the data, which…

Artificial Intelligence · Computer Science 2021-06-01 Nasim Baharisangari , Jean-Raphaël Gaglione , Daniel Neider , Ufuk Topcu , Zhe Xu

We argue that the obstacles to having a first-order formalism for odd-derivative actions presented in a pedagogical note by Deser are based on examples which are not first-order forms of the original actions. The general derivation of an…

High Energy Physics - Theory · Physics 2008-11-26 N. Kiriushcheva , S. V. Kuzmin

Previous works by Gor\'e, Postniece and Tiu have provided sound and cut-free complete proof systems for modal logics extended with path axioms using the formalism of nested sequent. Our aim is to provide (i) a constructive cut-elimination…

Logic in Computer Science · Computer Science 2024-06-14 Sonia Marin , Paaras Padhiar

In this paper, we prove the semantic incompleteness of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that was proposed in Liberman et al. (2020) "Dynamic Term-modal Logics for First-order…

Logic in Computer Science · Computer Science 2025-01-03 Takahiro Sawasaki

Given a finite-dimensional module, $V$, for a finite-dimensional, complex, semi-simple Lie algebra $\lie g$ and a positive integer $m$, we construct a family of graded modules for the current algebra $\lie g[t]$ indexed by simple $\CC\lie…

Representation Theory · Mathematics 2015-09-11 Matthew Bennett , Rollo Jenkins

This article addresses the question of involutiveness and discusses the initial value problem for a class of overdetermined systems of partial differential equations which arise in the theory of integrable systems and are defined by…

Differential Geometry · Mathematics 2009-11-11 Emilio Musso , Lorenzo Nicolodi

Trawl processes belong to the class of continuous-time, strictly stationary, infinitely divisible processes; they are defined as Levy bases evaluated over deterministic trawl sets. This article presents the first nonparametric estimator of…

Statistics Theory · Mathematics 2026-02-17 Orimar Sauri , Almut E. D. Veraart

A dynamical system is a pair $(X,f)$, where $X$ is a topological space and $f\colon X\to X$ is continuous. Kremer observed that the language of propositional linear temporal logic can be interpreted over the class of dynamical systems,…

Logic · Mathematics 2023-06-22 David Fernández-Duque

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…

Logic in Computer Science · Computer Science 2017-03-08 Kamal Lodaya , Paritosh K. Pandya

Large language models (LLMs) are primarily designed to understand unstructured text. When directly applied to structured formats such as tabular data, they may struggle to discern inherent relationships and overlook critical patterns. While…

Machine Learning · Computer Science 2024-10-11 Natraj Raman , Sumitra Ganesh , Manuela Veloso
‹ Prev 1 4 5 6 7 8 10 Next ›