English
Related papers

Related papers: Duality for Fitting's Multi-valued Modal logic via…

200 papers

The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…

Category Theory · Mathematics 2018-08-21 Kumar Sankar Ray , Litan Kumar Das

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

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

A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p\to q)\vee (q\to p)$ iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called bi-G\"odel…

Logic · Mathematics 2024-07-02 N. Bezhanishvili , M. Martins , T. Moraschini

A Rough semiring $(T,\Delta,\nabla)$ is considered to describe a special distributive Rough semiring known as a Rough bi-Heyting algebra. A bi-Heyting algebra is an extension of boolean algebra and it is accomplished by weaker notion of…

Rings and Algebras · Mathematics 2025-09-30 B. Praba , L. P. Anto Freeda

We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…

Logic · Mathematics 2023-10-04 Chrysafis Hartonas

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p\to q)\vee (q\to p)$ iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called bi-G\"odel…

Logic · Mathematics 2024-09-24 Miguel Martins , Tommaso Moraschini

We establish an Esakia duality for the categories of temporal Heyting algebras and temporal Esakia spaces. This includes a proof of contravariant equivalence and a congruence/filter/closed-upset correspondence. We then study two notions of…

Logic · Mathematics 2025-05-16 David Quinn Alvarez

Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence,…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p \to q) \lor (q \to p)$ iff the poset of its prime filters is a disjoint union of co-trees. Bi-Heyting algebras of this kind are called bi-G\"odel algebras and form a variety…

Logic · Mathematics 2026-02-26 Miguel Martins

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…

Logic in Computer Science · Computer Science 2022-01-05 Mehdi Zaïdi

We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…

Logic in Computer Science · Computer Science 2024-08-07 Alexander Kurz , Wolfgang Poiger , Bruno Teheux

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

A class of ordered relational topological spaces is described, which we call orthomodular spaces. Our construction of these spaces involves adding a topology to the class of orthomodular frames introduced by Hartonas, along the lines of…

Logic · Mathematics 2023-04-26 Joseph McDonald , Katalin Bimbó

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Plo\v{s}\v{c}ica. The standard representations of complete ortholattices and complete perfect Heyting…

Logic · Mathematics 2024-02-28 Wesley H. Holliday

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…

Logic in Computer Science · Computer Science 2015-07-01 Clemens Kupke , Alexander Kurz , Yde Venema

We extract the abstract core of finite homomorphism dualities using the techniques of Heyting algebras and (combinatorial) categories.

Combinatorics · Mathematics 2010-12-09 Jan Foniok , Jaroslav Nesetril , Ales Pultr , Claude Tardif
‹ Prev 1 2 3 10 Next ›