1996
DOI: 10.1007/bf00357841
|View full text |Cite
|
Sign up to set email alerts
|

Bi-Heyting algebras, toposes and modalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0
1

Year Published

1997
1997
2018
2018

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 53 publications
(28 citation statements)
references
References 7 publications
0
27
0
1
Order By: Relevance
“…In [8], it was shown that any complete bi-Heyting algebra comes equipped with a canonical modal structure that is obtained through the iteration of the Heyting and co-Heyting negations of the algebra. We will now give a brief overview of this modal structure.…”
Section: Modal Operators In Tqtmentioning
confidence: 99%
See 1 more Smart Citation
“…In [8], it was shown that any complete bi-Heyting algebra comes equipped with a canonical modal structure that is obtained through the iteration of the Heyting and co-Heyting negations of the algebra. We will now give a brief overview of this modal structure.…”
Section: Modal Operators In Tqtmentioning
confidence: 99%
“…(Reyes and Zolfaghari [8]) Let a ∈ B. Then a is the greatest complemented x ∈ B such that x ≤ a and ♦a is the least complemented x ∈ B such that x ≥ a.…”
Section: Modal Operators In Tqtmentioning
confidence: 99%
“…This sublattice is not a Boolean algebra as it is not closed under complementation. It is a bi-Heyting algebra for which the special case of graphs rather than hypergraphs has been discussed by Lawvere [18] and Reyes and Zolfaghari [19]. Figure 2 shows a subgraph K, indicated by the unbroken edges and the nodes as solid discs, together with its pseudocomplement and dual pseudocomplement.…”
Section: Definition 10mentioning
confidence: 99%
“…This bi-Heyting structure has been described in [Law86,RZ96], but we review it here, in the more general setting of hypergraphs, as it provides motivation for later sections.…”
Section: The Algebra Of Graphs and Hypergraphsmentioning
confidence: 99%