English
Related papers

Related papers: Modularisation of Sequent Calculi for Normal and N…

200 papers

We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as…

Logic · Mathematics 2021-12-22 Samara Burns , Richard Zach

In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Calling these calculi \emph{constructive}, we show that any…

Logic · Mathematics 2022-10-18 Amirhossein Akbar Tabatabai , Raheleh Jalali

The notion of singular reduction modules, i.e., of singular modules of nonclassical (conditional) symmetry, of differential equations is introduced. It is shown that the derivation of nonclassical symmetries for differential equations can…

Mathematical Physics · Physics 2017-12-05 Vaycheslav M. Boyko , Michael Kunzinger , Roman O. Popovych

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision…

Logic in Computer Science · Computer Science 2013-09-18 Mahfuza Farooque , Stéphane Graham-Lengrand

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…

Logic in Computer Science · Computer Science 2011-03-08 Zoran Majkic

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…

Logic in Computer Science · Computer Science 2007-05-23 Matthew Stone

This technical note provides comprehensive derivations of fundamental equations in two-level nested and sequential logit models for analyzing hierarchical choice structures. We present derivations of the Berry (1994) inversion formula,…

Econometrics · Economics 2025-04-01 Davide Luparello

Recently uncovered second derivative discontinuous solutions of the simplest linear ordinary differential equation define not only an nonstandard extension of the framework of the ordinary calculus, but also provide a dynamical…

General Mathematics · Mathematics 2010-01-12 Dhurjati Prasad Datta

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

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

Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…

Classical Analysis and ODEs · Mathematics 2011-07-25 S. Ali , F. M. Mahomed , Asghar Qadir

Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…

Logic · Mathematics 2026-03-17 Yuki Nishimura

Modal logics are widely used in multi-agent systems to reason about actions, abilities, norms, or epistemic states. Combined with description logic languages, they are also a powerful tool to formalise modal aspects of ontology-based…

Logic in Computer Science · Computer Science 2023-07-25 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki , Nicolas Troquard

The two-way modal mu-calculus is the extension of the (standard) one-way mu-calculus with converse (backward-looking) modalities. For this logic we introduce two new sequent-style proof calculi: a non-wellfounded system admitting infinite…

Logic in Computer Science · Computer Science 2025-08-12 Johannes Kloibhofer , Yde Venema

Linearization of coupled second order nonlinear ordinary differential equations (SNODEs) is one of the open and challenging problems in the theory of differential equations. In this paper we describe a simple and straightforward method to…

Exactly Solvable and Integrable Systems · Physics 2015-05-13 V. K. Chandrasekar , M. Senthilvelan , M. Lakshmanan

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…

q-alg · Mathematics 2009-10-30 Aristophanes Dimakis , J. Madore

Similar to modal connectives, the exponential ! in intuitionistic linear logic (ILL) is not canonical, in the sense that if $i\not= j$ then $!^i F\not\equiv !^j F$. Intuitively, this means that we can mark the exponential with labels taken…

Logic in Computer Science · Computer Science 2024-04-18 Carlos Olarte , Elaine Pimentel
‹ Prev 1 3 4 5 6 7 10 Next ›