Academic Bibliography

 Search 200 years of publications by Ghent University researchers.
Advanced search
1 file | 265.58 KB
Add to list
  1. Search results
  2. Tree-like proof systems for finitely-...

Tree-like proof systems for finitely-many valued non-deterministic consequence relations

Pawel Pawlowski (UGent)
(2020) LOGICA UNIVERSALIS. 14(4). p.407-420
Author
Organization
Abstract
The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.
Keywords
Non-deterministic logics, Proof systems, Many valued logics, MODAL SEMANTICS, LOGICS, CALCULI

Downloads

  • Download
    published article.pdf
    • full text (Published version)
    • |
    • open access
    • |
    • PDF
    • |
    • 265.58 KB

Citation

Please use this url to cite or link to this publication:

MLA
Pawlowski, Pawel. “Tree-like Proof Systems for Finitely-Many Valued Non-Deterministic Consequence Relations.” LOGICA UNIVERSALIS, vol. 14, no. 4, 2020, pp. 407–20, doi:10.1007/s11787-020-00263-0.
APA
Pawlowski, P. (2020). Tree-like proof systems for finitely-many valued non-deterministic consequence relations. LOGICA UNIVERSALIS, 14(4), 407–420. https://doi.org/10.1007/s11787-020-00263-0
Chicago author-date
Pawlowski, Pawel. 2020. “Tree-like Proof Systems for Finitely-Many Valued Non-Deterministic Consequence Relations.” LOGICA UNIVERSALIS 14 (4): 407–20. https://doi.org/10.1007/s11787-020-00263-0.
Chicago author-date (all authors)
Pawlowski, Pawel. 2020. “Tree-like Proof Systems for Finitely-Many Valued Non-Deterministic Consequence Relations.” LOGICA UNIVERSALIS 14 (4): 407–420. doi:10.1007/s11787-020-00263-0.
Vancouver
1.
Pawlowski P. Tree-like proof systems for finitely-many valued non-deterministic consequence relations. LOGICA UNIVERSALIS. 2020;14(4):407–20.
IEEE
[1]
P. Pawlowski, “Tree-like proof systems for finitely-many valued non-deterministic consequence relations,” LOGICA UNIVERSALIS, vol. 14, no. 4, pp. 407–420, 2020.
@article{8758070,
  abstract     = {{The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.}},
  author       = {{Pawlowski, Pawel}},
  issn         = {{1661-8297}},
  journal      = {{LOGICA UNIVERSALIS}},
  keywords     = {{Non-deterministic logics,Proof systems,Many valued logics,MODAL SEMANTICS,LOGICS,CALCULI}},
  language     = {{eng}},
  number       = {{4}},
  pages        = {{407--420}},
  title        = {{Tree-like proof systems for finitely-many valued non-deterministic consequence relations}},
  url          = {{http://doi.org/10.1007/s11787-020-00263-0}},
  volume       = {{14}},
  year         = {{2020}},
}
Altmetric
View in Altmetric
Web of Science
Times cited: