Priestley representation for distributive lattices with operators and 
applications to automated theorem proving

Sofronie-Stokkermans, Viorica

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Priestley representation for distributive lattices with operators and applications to automated theorem proving

MPS-Authors

/persons/resource/persons45516

Sofronie-Stokkermans, Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Sofronie-Stokkermans, V. (1999). Priestley representation for distributive lattices with operators and applications to automated theorem proving. In J. Vaz de Carvalho, & I. Ferreirim (Eds.), Dualities, Interpretability and Ordered Structures (pp. 43-54). Lisbon: Centro de 'Algebra da Universidade de Lisboa.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3681-F

Abstract

We present an extension of the Priestley representation theorem to distributive lattices with operators. We then point out how it can be used for automated theorem proving in certain finitely-valued logics.