Reasoning on Schemata of Formulae

Details Reasoning on Schemata of Formulae Reasoning on Schemata of Formulae

2012-04-12

arxiv.org/abs/1204.2990v1

Computer Science

Logic in Computer Science

Scientific paper

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists, the trees etc.). A proof procedure is proposed to relate the satisfiability problem for schemata to that of finite disjunctions of base formulae. It is shown that this procedure is sound, complete and terminating, hence the basic computational properties of the base language can be carried over to schemata.

Affiliated with

Also associated with

No associations

Rating

Reasoning on Schemata of Formulae 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 Reasoning on Schemata of Formulae, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reasoning on Schemata of Formulae will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313357