On a Partial Decision Method for Dynamic Proofs

Details On a Partial Decision Method for Dynamic Proofs On a Partial Decision Method for Dynamic Proofs

2002-07-25

arxiv.org/abs/cs/0207090v1

Computer Science

Logic in Computer Science

18 pages. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiha

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On a Partial Decision Method for Dynamic Proofs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a Partial Decision Method for Dynamic Proofs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Partial Decision Method for Dynamic Proofs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226634