“Whoa! It’s like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

Detecting Loops During Proof Search in Propositional Affine Logic

It is well-known that proof search, in general, does not terminate. In some decidable logics (e.g. intuitionistic propositional logic) it is possible to give a terminating sequent calculus, i.e. one in which a naive backward proof search will always terminate. However, such calculi are not always available, even for decidable logics. In this paper we investigate the incorporation of a loop detection mechanism into an inference system for propositional affine logic (i.e. propositional linear logic with arbitrary weakening). This logic is decidable, but no terminating sequent calculus for it is known. We adapt the history techniques used for intuitionistic and modal logics, but in this case we cannot assume that the context will always be non-decreasing. We show how to overcome this problem, and hence to provide a loop detection mechanism for propositional affine logic. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Logic And Computation Oxford University Press

Detecting Loops During Proof Search in Propositional Affine Logic

Abstract

It is well-known that proof search, in general, does not terminate. In some decidable logics (e.g. intuitionistic propositional logic) it is possible to give a terminating sequent calculus, i.e. one in which a naive backward proof search will always terminate. However, such calculi are not always available, even for decidable logics. In this paper we investigate the incorporation of a loop detection mechanism into an inference system for propositional affine logic (i.e. propositional linear logic with arbitrary weakening). This logic is decidable, but no terminating sequent calculus for it is known. We adapt the history techniques used for intuitionistic and modal logics, but in this case we cannot assume that the context will always be non-decreasing. We show how to overcome this problem, and hence to provide a loop detection mechanism for propositional affine logic.
Loading next page...
 
/lp/oxford-university-press/detecting-loops-during-proof-search-in-propositional-affine-logic-S4kxAiUtOJ

Sorry, we don’t have permission to share this article on DeepDyve,
but here are related articles that you can start reading right now:

Explore the DeepDyve Library

How DeepDyve Works

Spend time researching, not time worrying you’re buying articles that might not be useful.

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.

All the latest content is available, no embargo periods.

See the journals in your area

Simple and Affordable Pricing

14-day free trial. Cancel anytime, with a 30-day money-back guarantee.

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$40/month

Best Deal — 25% off

Annual Plan

  • All the features of the Professional Plan, but for 25% off!
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$30/month
billed annually