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

Sofronie-Stokkermans, Viorica

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

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

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

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.