A Sequent Calculus and a Theorem Prover for Standard Conditional Logics

Details A Sequent Calculus and a Theorem Prover for Standard Conditional Logics A Sequent Calculus and a Theorem Prover for Standard Conditional Logics

2004-07-29

arxiv.org/abs/cs/0407064v1

Computer Science

Logic in Computer Science

45 pages with 2 figures, uses prooftree.sty

Scientific paper

In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space complexity bounds for the respective logics. We also present CondLean, a theorem prover for these logics implementing SeqS calculi written in SICStus Prolog.

Affiliated with

Also associated with

No associations

Rating

A Sequent Calculus and a Theorem Prover for Standard Conditional Logics 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 A Sequent Calculus and a Theorem Prover for Standard Conditional Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Sequent Calculus and a Theorem Prover for Standard Conditional Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457167