English
Related papers

Related papers: Connexive implications in Substructural Logics

200 papers

In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…

Logic · Mathematics 2021-05-19 Ivan Chajda , Kadir Emir , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…

Logic · Mathematics 2023-08-23 Ivan Chajda , Helmut Länger

Effect algebras form a formal algebraic description of the structure of the so-called effects in a Hilbert space which serves as an event-state space for effects in quantum mechanics. This is why effect algebras are considered as logics of…

Logic · Mathematics 2019-08-16 Ivan Chajda , Helmut Länger

We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic (CHL), hereby introduced as an example of a strong connexive logic with intuitive semantics. We use the reverse algebraisation paradigm: CHL is presented…

Logic · Mathematics 2022-09-01 Davide Fazio , Antonio Ledda , Francesco Paoli

In this paper, we define and investigate a connexive logic, called 'Connexive semi-Heyting logic' (\mathcal{CSH} for short) and a new subvariety CSH of the variety SH of semi-Heyting algebras. It is shown that the logic \mathcal{CSH} is…

Logic · Mathematics 2025-12-01 Juan M. Cornejo , Hanamantagouda P. Sankappanavar

We involve a certain propositional logic based on ortholattices. We characterize the implicational reduct of such a logic and we show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence…

Quantum Physics · Physics 2007-05-23 I. Chajda , R. Halas

Two kinds of the connective implication are introduced as term operations of a pseudocomplemented lattice. It is shown that they share a lot of properties with the intuitionistic implication based on Heyting algebras. In particular, if the…

Logic · Mathematics 2024-01-12 Ivan Chajda , Helmut Länger

We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

Logic · Mathematics 2021-05-18 Ivan Chajda , Helmut Länger

In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in…

Logic · Mathematics 2018-04-20 Ramon Jansana , Hernan Javier San Martin

When an algebraic logic based on a poset instead of a lattice is investigated then there is a natural problem how to introduce the connective implication to be everywhere defined and satisfying (left) adjointness with the connective…

Logic · Mathematics 2019-10-22 Ivan Chajda , Helmut Länger

We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form "If $\sim A$, then $A$", should not hold,…

Logic · Mathematics 2021-09-13 Niki Pfeifer , Giuseppe Sanfilippo

The approach taken by Gheorghiu, Gu and Pym in their paper on giving a Base-extension Semantics for Intuitionistic Multiplicative Linear Logic is an interesting adaptation of the work of Sandqvist for IPL to the substructural setting. What…

Logic in Computer Science · Computer Science 2025-10-16 Yll Buzoku

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Logic · Mathematics 2023-10-04 Nikolaos Galatos , Gavin St. John

The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…

Computational Complexity · Computer Science 2010-06-02 Olaf Beyersdorff , Arne Meier , Michael Thomas , Heribert Vollmer

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Rings and Algebras · Mathematics 2014-09-16 João Pita Costa , Primož Škraba , Mikael Vejdemo-Johansson

In this paper we intend to study implications in their most general form, generalizing different classes of implications including the Heyting implication, sub-structural implications and weak strict implications. Following the topological…

Logic · Mathematics 2020-04-23 Amirhossein Akbar Tabatabai

It was proved by Maksimova in 1977 that exactly eight varieties of Heyting algebras have the amalgamation property, and hence exactly eight axiomatic extensions of intuitionistic propositional logic have the deductive interpolation…

Logic · Mathematics 2026-03-11 Wesley Fussner , George Metcalfe , Simon Santschi

Pseudo-effect algebras are partial algebraic structures, that were introduced as a non-commutative generalization of effect algebras. In the present paper, lattice ordered pseudo-effect algebras are considered as possible algebraic…

Rings and Algebras · Mathematics 2010-07-05 David J. Foulis , Sylvia Pulmannova , Elena Vincekova

This paper is motivated by the desire to study package management using the toolkit of the semantics of functional languages. As it transpires, this is deeply related to the semantics of concurrent computation. The models we produce are not…

Logic in Computer Science · Computer Science 2020-04-14 Gershom Bazerman , Raymond Puzio
‹ Prev 1 2 3 10 Next ›