Two Proof Systems for Peirce Algebras

Schmidt, Renate A.; Or{\l}owska, Ewa; Hustadt, Ullrich; Berghammer, Rudolf; Möller, Bernhard; Struth, Georg

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Two Proof Systems for Peirce Algebras

MPS-Authors

/persons/resource/persons45401

Schmidt, Renate A.
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44660

Hustadt, Ullrich
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45565

Struth, Georg
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

引用

Schmidt, R. A., Or{\l}owska, E., & Hustadt, U. (2004). Two Proof Systems for Peirce Algebras. In Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra (pp. 238-251). Berlin, Germany: Springer.

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

要旨

This paper develops and compares two tableaux-style proof systems for Peirce algebras. One is a tableau refutation proof system, the other is a proof system in the style of Rasiowa-Sikorski.