Two proof systems for peirce algebras

Renate A. Schmidt; Ewa Orłowska; Ullrich Hustadt

Two proof systems for peirce algebras

Renate A. Schmidt, Ewa Orłowska, Ullrich Hustadt

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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. © Springer-Verlag 2004.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\|Lect. Notes Comput. Sci.
Pages	238-251
Number of pages	13
Volume	3051
Publication status	Published - 2004
Event	Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7) - Duration: 1 Jan 1824 → …

Conference

Conference	Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7)
Period	1/01/24 → …

Cite this

@inproceedings{6aaf9f1b8a23408996a8e47936c1d926,

title = "Two proof systems for peirce algebras",

abstract = "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. {\textcopyright} Springer-Verlag 2004.",

author = "Schmidt, {Renate A.} and Ewa Or{\l}owska and Ullrich Hustadt",

year = "2004",

language = "English",

volume = "3051",

pages = "238--251",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",

note = "Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7) ; Conference date: 01-01-1824",

}

Two proof systems for peirce algebras. / Schmidt, Renate A.; Orłowska, Ewa; Hustadt, Ullrich.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 3051 2004. p. 238-251.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Two proof systems for peirce algebras

AU - Schmidt, Renate A.

AU - Orłowska, Ewa

AU - Hustadt, Ullrich

PY - 2004

Y1 - 2004

N2 - 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. © Springer-Verlag 2004.

AB - 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. © Springer-Verlag 2004.

M3 - Conference contribution

VL - 3051

SP - 238

EP - 251

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.

T2 - Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7)

Y2 - 1 January 1824

ER -

Two proof systems for peirce algebras

Abstract

Conference

Fingerprint

Cite this