English
Related papers

Related papers: Bi-intuitionistic logics through the abstract alge…

200 papers

In this paper we develop an almost general process to switch from abstract logics in the sense of Brown and Suszko to lattices. With this method we can establish dualities between some categories of abstract logics to the correspondent…

Logic · Mathematics 2014-10-30 Andreas B. M. Brunner , Darllan Conceição Pinto

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

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

In the style of Lindstr\"om's theorem for classical first-order logic, this article characterizes propositional bi-intuitionistic logic as the maximal (with respect to expressive power) abstract logic satisfying a certain form of…

Logic · Mathematics 2021-04-08 Grigory Olkhovikov , Guillermo Badia

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…

Logic in Computer Science · Computer Science 2026-05-27 Vijay D'Silva , Alessandra Palmigiano , Apostolos Tzimoulis , Caterina Urban

The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus. But its relation with the…

Logic in Computer Science · Computer Science 2011-01-25 Simona Ronchi Della Rocca , Alexis Saurin , Yiorgos Stavrinos , Anastasia Veneti

Besides the better-known Nelson's Logic and Paraconsistent Nelson's Logic, in "Negation and separation of concepts in constructive systems" (1959), David Nelson introduced a logic called S with the aim of analyzing the constructive content…

Logic · Mathematics 2018-06-12 Thiago Nascimento , Umberto Rivieccio , João Marcos , Matthew Spinks

Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal…

Logic in Computer Science · Computer Science 2016-03-09 Joelle Despeyroux , Kaustuv Chaudhuri

We prove that the sequent calculus $\mathsf{L_{RBL}}$ for residuated basic logic $\mathsf{RBL}$ has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic $\mathsf{BPL}$. Thus…

Logic · Mathematics 2014-04-30 Minghui Ma , Zhe Lin

Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…

Logic · Mathematics 2023-05-17 Will Stafford

This paper explores proof-theoretic semantics, a formal approach to inferential semantics. It derives sentence meaning from formalized proofs, building upon Gentzen and Prawitz's work. The study addresses challenges in understanding how…

Logic · Mathematics 2023-10-23 Ukyo Suzuki , Yoriyuki Yamagata

We construct functorially a class of algebras using the formalism of double derivations. These algebras extend to higher dimensions Crawley-Boevey and Holland's construction of deformed preprojective algebras and encompass symplectic…

Rings and Algebras · Mathematics 2010-08-13 Iain Gordon

When we represent logical, connective implications by directed edges, the resulting set of directed edges can be regarded as a complex network. In this article, we compose a network model that represents a deductive-logic-like structure…

Social and Information Networks · Computer Science 2015-07-06 Koji Sawa

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…

Logic · Mathematics 2026-03-02 Jim de Groot , Tadeusz Litak , Dirk Pattinson

We introduce the logic $\sf ITL^e$, an intuitionistic temporal logic based on structures $(W,\preccurlyeq,S)$, where $\preccurlyeq$ is used to interpret intuitionistic implication and $S$ is a $\preccurlyeq$-monotone function used to…

Logic · Mathematics 2017-04-11 Joseph Boudou , Martín Diéguez , David Fernández-Duque

This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports…

Logic in Computer Science · Computer Science 2017-01-11 Alwen Tiu

Inquisitive logic is a research program that extends the scope of logic to cover not only statements, but also questions. In the context of this program, a logic that plays a prominent role is inquisitive first-order logic, InqBQ, which…

Logic · Mathematics 2026-03-24 Ivano Ciardelli , Juha Kontinen

One leading question with respect to Bi-intuitionistic logic (BINT) is, what does BINT look like across the three arcs -- logic, typed $\lambda$-calculi, and category theory -- of the Curry-Howard-Lambek correspondence? Categorically, BINT…

Logic in Computer Science · Computer Science 2017-08-22 Harley Eades , Gianluigi Bellin

Indirect inference (II) is a methodology for estimating the parameters of an intractable (generative) model on the basis of an alternative parametric (auxiliary) model that is both analytically and computationally easier to deal with. Such…

Methodology · Statistics 2015-05-14 Christopher C. Drovandi , Anthony N. Pettitt , Anthony Lee

Realizability, introduced by Kleene, can be understood as a concretization of the Brouwer-Heyting-Kolmogorov (BHK) interpretation of proofs, providing a framework to interpret mathematical statements and proofs in terms of their…

Logic in Computer Science · Computer Science 2026-02-09 Alexandre Lucquin , Luc Pellissier , Thomas Seiller