Connection-Based Theorem Proving in Classical and Non-Classical Logics
| dc.creator | Kreitz,Christoph | |
| dc.creator | Otten,Jens | |
| dc.date | 1999 | |
| dc.date.accessioned | 2024-02-06T12:49:57Z | |
| dc.date.available | 2024-02-06T12:49:57Z | |
| dc.description | We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel's connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development of proofs in interactive proof assistants and shows how to integrate automated and interactive theorem proving. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-005-03-0088 | |
| dc.identifier | https://lib.jucs.org/article/27541/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7530 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 5(3): 88-112 | |
| dc.title | Connection-Based Theorem Proving in Classical and Non-Classical Logics | |
| dc.type | Research Article |