English
Related papers

Related papers: Choice-free Topological Duality for Implicative La…

200 papers

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

In this paper, we investigate a bitopological duality for algebras of Fitting's multi-valued logic. We also extend the natural duality theory for $\mathbb{ISP_I}(\mathcal{L})$ by developing a duality for $\mathbb{ISP}(\mathcal{L})$, where…

Logic in Computer Science · Computer Science 2019-12-30 Litan Kumar Das , Kumar Sankar Ray

There are several prominent duality results in pointfree topology. The Hofmann-Lawson duality establishes that the category of continuous frames is dually equivalent to the category of locally compact sober spaces. This restricts to a dual…

General Topology · Mathematics 2024-04-23 G. Bezhanishvili , S. Melzer

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

Logic in Computer Science · Computer Science 2016-10-27 Emil Jeřábek

We develop a new duality for distributive and implicative meet semi-lattices. For distributive meet semi-lattices our duality generalizes Priestley's duality for distributive lattices and provides an improvement of Celani's duality. Our…

Logic · Mathematics 2024-11-01 Guram Bezhanishvili , Ramon Jansana

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka

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

We classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which contains a non-trivial apartness term satisfies the weak law of…

Logic · Mathematics 2024-10-21 Zoltan A. Kocsis

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

We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice…

Logic · Mathematics 2007-05-23 Michael O'Connor

It is known that the set of tautologies of second order intuitionistic propositional logic, $\mathrm{IPC} 2$, is undecidable. Here, we prove that the sets of formulas of $\mathrm{IPC} 2$ which are true in the algebra of open subsets of…

Logic · Mathematics 2016-12-22 Konrad Zdanowski

We introduce relational semantics for "flat Heyting-Lewis logic" $\mathsf{HLC}^{\flat}$. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart…

Logic · Mathematics 2026-03-31 Jim de Groot , Tadeusz Litak

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A…

Logic · Mathematics 2013-09-13 Mai Gehrke , Sam Van Gool

In this paper we show that using implicative algebras one can produce models of set theory generalizing Heyting/Boolean-valued models and realizability models of (I)ZF, both in intuitionistic and classical logic. This has as consequence…

Logic in Computer Science · Computer Science 2024-02-14 Samuele Maschio , Alexandre Miquel

In this note we generalize the construction, due to Ghilardi, of the free Heyting algebra generated by a finite distributive lattice, to the case of arbitrary distributive lattices. Categorically, this provides an explicit construction of a…

Logic · Mathematics 2026-04-03 Rodrigo Nicolau Almeida

In [{\it On the free implicative semilattice extension of a Hilbert algebra}. Mathematical Logic Quarterly 58, 3 (2012), 188--207], Celani and Jansana give an explicit description of the free implicative semilattice extension of a Hilbert…

Logic · Mathematics 2018-07-09 José L. Castiglioni , Hernán J. San Martín

The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze
‹ Prev 1 2 3 10 Next ›