English
Related papers

Related papers: Hypersequent Calculi for Intermediate Predicate Lo…

200 papers

In a previously published ENTCS paper (Santos et al. (2016)), we introduced a sequent calculus called $\mathbf{LMT^{\rightarrow}}$ for Minimal Implicational Propositional Logic ($\mathbf{LMT^{\rightarrow}}$). This calculus provides a proof…

Logic in Computer Science · Computer Science 2020-02-04 Jefferson de Barros Santos , Bruno Lopes Vieira , Edward Hermann Haeusler

We provide the first (non-labelled) sequent calculi for bimodal provability logics with "usual" provability predicates. In particular, we introduce calculi for the logics CS, CSM and ER. Additionally, we present non-wellfounded versions of…

Logic · Mathematics 2026-05-15 Borja Sierra Miranda , Thomas Studer

We construct a flow of continuous time and discrete state branching processes. Some scaling limit theorems for the flow are proved, which lead to the path-valued branching processes and nonlocal branching superprocesses over the positive…

Probability · Mathematics 2012-04-13 Hui He , Rugang Ma

We present nested sequent systems for propositional G\"odel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these…

Logic in Computer Science · Computer Science 2024-06-07 Tim S. Lyon

We present Coneris, the first higher-order concurrent separation logic for reasoning about error probability bounds of higher-order concurrent probabilistic programs with higher-order state. To support modular reasoning about concurrent…

Logic in Computer Science · Computer Science 2025-08-08 Kwing Hei Li , Alejandro Aguirre , Simon Oddershede Gregersen , Philipp G. Haselwarter , Joseph Tassarotti , Lars Birkedal

We present Hypersequent Classical Processes (HCP), a revised interpretation of the "Proofs as Processes" correspondence between linear logic and the {\pi}-calculus initially proposed by Abramsky [1994], and later developed by Bellin and…

Logic in Computer Science · Computer Science 2018-11-07 Wen Kokke , Fabrizio Montesi , Marco Peressotti

The aim of our paper is twofold: firstly we present a sequent calculus for an intuitionistic non-Fregean logic ISCI, which is based on the calculus presented in the paper by Chlebowski and Leszczynska-Jasion, 'An Investigation into…

Logic in Computer Science · Computer Science 2022-04-15 Agata Tomczyk , Dorota Leszczyńska-Jasion

We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formulas of the first order language of enriched formal contexts,…

In a porous medium featuring heterogeneous permeabilities, a wide range of fluid velocities may be recorded, so that significant inertial and frictional effects may arise in high-speed regions. In such parts, the link between pressure…

Numerical Analysis · Mathematics 2024-08-02 Chiara Giovannini , Alessio Fumagalli , Francesco Patacchini

Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…

Logic · Mathematics 2022-11-03 Caleb M. H. Camrud , Timothy H. McNicholl

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

Logic in Computer Science · Computer Science 2025-10-31 Michael Benedikt , Chia-Hsuan Lu , Tony Tan

This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the {\pi}-calculus closely related to linear logic. Decompositions of intuitionistic…

Logic in Computer Science · Computer Science 2011-07-22 Emmanuel Beffara

We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…

Contrastive decoding (CD) (Li et al., 2023) improves the next-token distribution of a large expert language model (LM) using a small amateur LM. Although CD is applied to various LMs and domains to enhance open-ended text generation, it is…

Computation and Language · Computer Science 2024-11-05 Haw-Shiuan Chang , Nanyun Peng , Mohit Bansal , Anil Ramakrishna , Tagyoung Chung

We introduce a sequent calculus for the temporal-over-topological fragment $\textbf{DTL}_{0}^{\circ * \slash \Box}$ of dynamic topological logic $\textbf{DTL}$, prove soundness semantically, and prove completeness syntactically using the…

Logic · Mathematics 2014-08-05 Samuel Reid

We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…

cmp-lg · Computer Science 2016-08-31 Glyn Morrill

We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as…

Logic in Computer Science · Computer Science 2024-12-03 Andrzej Indrzejczak , Yaroslav Petrukhin

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

This paper is devoted to the study of the well-posedness of a singular nonlinear fractional pseudo-hyperbolic system. The fractional derivative is described in Caputo sense. The equations are supplemented by classical and nonlocal boundary…

Analysis of PDEs · Mathematics 2022-11-23 Said Mesloub , Hassan Eltayeb Gadian , Lotfi Kasmi

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

Logic · Mathematics 2020-02-20 Eugenio Orlandelli