Stone duality for nominal Boolean algebras with И

Authors:
Murdoch J. Gabbay;Tadeusz Litak;Daniela Petrişan
Affiliations:
-;-;-
Venue:
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Year:
2011

Citing 25
Cited 1

Solution of the Robbins Problem

Journal of Automated Reasoning
FreshML: programming with binders made simple

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A spatial logic for concurrency (part I)

Information and Computation - TACS 2001
A Sequent Calculus for Nominal Logic

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Nominal Games and Full Abstraction for the Nu-Calculus

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Nominal rewriting with name generation: abstraction vs. locality

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
On a monadic semantics for freshness

Theoretical Computer Science - Applied semantics: Selected topics
Hybridizing a Logical Framework

Electronic Notes in Theoretical Computer Science (ENTCS)
A Logic for Reasoning about Generic Judgments

Electronic Notes in Theoretical Computer Science (ENTCS)
Pi-Calculus in Logical Form

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Full abstraction for nominal general references

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Nominal logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

Theoretical Computer Science
Nominal Algebra and the HSP Theorem

Journal of Logic and Computation
Nominal (Universal) Algebra

Journal of Logic and Computation
Nominal system T

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logical properties of name restriction

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Formalising the π-calculus using nominal logic

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Permissive-nominal logic

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Applying Universal Algebra to Lambda Calculus*

Journal of Logic and Computation
On universal algebra over nominal sets

Mathematical Structures in Computer Science
Modal Logics are Coalgebraic1

The Computer Journal
Freshness and name-restriction in sets of traces with names

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A simpler proof theory for nominal logic

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Algebraization of hybrid logic with binders

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra

Instances of Computational Effects: An Algebraic Perspective

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define Boolean algebras over nominal sets with a function-symbol И mirroring the И 'fresh name' quantifier (Banonas), and dual notions of nominal topology and Stone space. We prove a representation theorem over fields of nominal sets, and extend this to a Stone duality.