On a Partial Decision Method for Dynamic Proofs
| dc.creator | Batens, Diderik | |
| dc.date | 2002-07-25 | |
| dc.date.accessioned | 2026-07-07T03:18:45Z | |
| dc.date.available | 2026-07-07T03:18:45Z | |
| dc.description | This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. At the propositional level, it forms an algorithm for final derivability. If extended to the predicative level, it provides a criterion for final derivability. This is essential in view of the absence of a positive test. The procedure may be generalized to all flat adaptive logics. | |
| dc.description | 18 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/) | |
| dc.identifier | https://arxiv.org/abs/cs/0207090 | |
| dc.identifier | http://arxiv.org/abs/cs/0207090 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31239 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1; I.2.3; I.2.4 | |
| dc.title | On a Partial Decision Method for Dynamic Proofs | |
| dc.type | text |