Standard
Intuitionistic Euler-Venn Diagrams. /
Linker, Sven.
Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings. ed. / A-V Pietarinen; P Chapman; L Bosveld-de Smet; V Giardino; J. Corter; S Linker. Cham: Springer, 2020. p. 264-280 (Lecture Notes in Computer Science; Vol. 12169).
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Harvard
Linker, S 2020,
Intuitionistic Euler-Venn Diagrams. in A-V Pietarinen, P Chapman, L Bosveld-de Smet, V Giardino, J Corter & S Linker (eds),
Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings. Lecture Notes in Computer Science, vol. 12169, Springer, Cham, pp. 264-280.
https://doi.org/10.1007/978-3-030-54249-8_21
APA
Linker, S. (2020).
Intuitionistic Euler-Venn Diagrams. In A-V. Pietarinen, P. Chapman, L. Bosveld-de Smet, V. Giardino, J. Corter, & S. Linker (Eds.),
Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings (pp. 264-280). (Lecture Notes in Computer Science; Vol. 12169). Springer.
https://doi.org/10.1007/978-3-030-54249-8_21
Vancouver
Linker S.
Intuitionistic Euler-Venn Diagrams. In Pietarinen A-V, Chapman P, Bosveld-de Smet L, Giardino V, Corter J, Linker S, editors, Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings. Cham: Springer. 2020. p. 264-280. (Lecture Notes in Computer Science). Epub 2020 Aug 17. doi: 10.1007/978-3-030-54249-8_21
Author
Linker, Sven. /
Intuitionistic Euler-Venn Diagrams. Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings. editor / A-V Pietarinen ; P Chapman ; L Bosveld-de Smet ; V Giardino ; J. Corter ; S Linker. Cham : Springer, 2020. pp. 264-280 (Lecture Notes in Computer Science).
Bibtex
@inproceedings{f844ef3a51fc48739198897083504ec4,
title = "Intuitionistic Euler-Venn Diagrams",
abstract = "We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of conjunction, disjunction and intuitionistic implication. Furthermore, we need to add new syntactic elements to express these concepts. We present a cut-free sequent calculus for this language, and prove it to be sound and complete. Furthermore, we show that the rules of cut, weakening and contraction are admissible.",
author = "Sven Linker",
year = "2020",
month = aug,
day = "24",
doi = "10.1007/978-3-030-54249-8_21",
language = "English",
isbn = "9783030542481",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "264--280",
editor = "A-V Pietarinen and P Chapman and {Bosveld-de Smet}, L and V Giardino and J. Corter and S Linker",
booktitle = "Diagrammatic Representation and Inference",
}
RIS
TY - GEN
T1 - Intuitionistic Euler-Venn Diagrams
AU - Linker, Sven
PY - 2020/8/24
Y1 - 2020/8/24
N2 - We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of conjunction, disjunction and intuitionistic implication. Furthermore, we need to add new syntactic elements to express these concepts. We present a cut-free sequent calculus for this language, and prove it to be sound and complete. Furthermore, we show that the rules of cut, weakening and contraction are admissible.
AB - We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of conjunction, disjunction and intuitionistic implication. Furthermore, we need to add new syntactic elements to express these concepts. We present a cut-free sequent calculus for this language, and prove it to be sound and complete. Furthermore, we show that the rules of cut, weakening and contraction are admissible.
U2 - 10.1007/978-3-030-54249-8_21
DO - 10.1007/978-3-030-54249-8_21
M3 - Conference contribution/Paper
SN - 9783030542481
T3 - Lecture Notes in Computer Science
SP - 264
EP - 280
BT - Diagrammatic Representation and Inference
A2 - Pietarinen, A-V
A2 - Chapman, P
A2 - Bosveld-de Smet, L
A2 - Giardino, V
A2 - Corter, J.
A2 - Linker, S
PB - Springer
CY - Cham
ER -
