A method of comparison of Post-complete propositional logics
| dc.contributor.author | Bryll, Grzegorz | pl_PL |
| dc.contributor.author | Sochacki, Robert | pl_PL |
| dc.date.accessioned | 2019-09-06T07:04:59Z | |
| dc.date.available | 2019-09-06T07:04:59Z | |
| dc.date.issued | 2003 | |
| dc.identifier.citation | Annales Academiae Paedagogicae Cracoviensis. 16, Studia Mathematica 3 (2003), s. [27]-32 | pl_PL |
| dc.identifier.uri | http://hdl.handle.net/11716/5727 | |
| dc.description.abstract | In this paper we consider a necessary and sufficient condition for every propositional calculus to be Post-complete. We will show, how this condition may be used to compare consequence operations for these calculi. | en_EN |
| dc.language.iso | en | pl_PL |
| dc.title | A method of comparison of Post-complete propositional logics | en_EN |
| dc.type | Article | pl_PL |