Cambridge Journals Online - Mathematical Structures in Computer Science Vol. 11 Iss. 06

Home
CJO Mobile
Mobile Device Twinning
Contact Us
Site Map
Help
FAQ
Accessibility
Register

Basket
Log in

User Log-in
Institutional Log-in
Register for an Account

Username or Email Address:

Password:

Remember me

Forgot your Password? Log in

Trouble Logging in?

You can also login through:

Facebook
Twitter
Google Plus

About Us
News
Browse Journals
Authors
- Authors Home
Societies
- Societies Home
Librarians
Agents
- Agents Home
Users
- Users Home
Corporate
- Corporate Home

Citation Search
Quick Search

Advanced Search

Welcome to Cambridge Journals Online

To access subscriptions and personalised features please log in or register

Register for an Account

Journal Information

Editorial Board
Mathematical Structures in Computer Science News
Book Review Info
Instructions for Contributors
Transfer of Copyright
Abstracting & Indexing Services
Request Permissions
Advertising Information

Mathematical Structures in Computer Science Home

Save Journal to My CJO Account

Browse Journal

FirstView Articles
Latest Issue
Back Issues

Browse Articles

Most Downloaded
Most Cited

Submit Your Article
Sign-Up for Contents Alerts

Subscribe & Recommend Journal

Subscribe to Journal

Related Journals

Combinatorics, Probability and Computing
LMS Journal of Computation and Mathematics
Acta Numerica

Advertising and Corporate Sales
Request Permissions

CJO Search Widget (Mathematical Structures in Computer Science) What is this?
Add Cambridge Journals Online as a search option in your browser toolbar. What is this?

Access Information

Consortia Access
Free Access
Individual Access
Open Access
Pay-per-View Access
Subscription Access

Home
>
Mathematical Structures in Computer Science
>
Vol. 11 Issue 06

Mathematical Structures in Computer Science

New Content Alerts
Journal Widget About Widget
Rss
Atom

Table of Contents - Volume 11 - Issue 06 - 2001

View Table of Contents as PDF
Forward TOC

Previous Issue
Next Issue

Select All
Deselect All

View Selected Abstracts
Save to My Saved Articles
Export Citation (s)
Download PDF (s)

Add to Basket

Research Articles

The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity

false

Abstract
Article Structure
Figures and Tables
References

MAX KANOVICH and JACQUELINE VAUZEILLES

Mathematical Structures in Computer Science / Volume 11 / Issue 06 / December 2001, pp 689 - 716

2001 Cambridge University Press

DOI: http://dx.doi.org/10.1017/S0960129501003413 (About DOI), Published online: 09 January 2002

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en_US.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Rent This Article Now for 24 Hours
$5.99 / £3.99 / €4.49
Request Permissions

Strongly algebraic = SFP (topically) Strongly algebraic = SFP (topically)

false

Abstract
Article Structure
Figures and Tables
References

STEVEN VICKERS

Mathematical Structures in Computer Science / Volume 11 / Issue 06 / December 2001, pp 717 - 742

2001 Cambridge University Press

DOI: http://dx.doi.org/10.1017/S0960129501003437 (About DOI), Published online: 09 January 2002

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en_US.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Rent This Article Now for 24 Hours
$5.99 / £3.99 / €4.49
Request Permissions

Recognizable languages in divisibility monoids Recognizable languages in divisibility monoids

false

Abstract
Article Structure
Figures and Tables
References

MANFRED DROSTE and DIETRICH KUSKE

Mathematical Structures in Computer Science / Volume 11 / Issue 06 / December 2001, pp 743 - 770

2001 Cambridge University Press

DOI: http://dx.doi.org/10.1017/S0960129501003395 (About DOI), Published online: 09 January 2002

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en_US.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Rent This Article Now for 24 Hours
$5.99 / £3.99 / €4.49
Request Permissions

On the elimination of some higher type quantifiers On the elimination of some higher type quantifiers

false

Abstract
Article Structure
Figures and Tables
References

YASUWO IKEDA, KOHJI TOMITA and CHIHARU HOSONO

Mathematical Structures in Computer Science / Volume 11 / Issue 06 / December 2001, pp 771 - 779

2001 Cambridge University Press

DOI: http://dx.doi.org/10.1017/S0960129501003401 (About DOI), Published online: 09 January 2002

Post a Comment

Name *

Your Position and Institution

Email *

Would you like to receive email updates for comments posted on this article?

Comment * ???en_US.toc.displayArticle.1000 ??? characters remaining

Abstract
Buy This Article $45.00 / £30.00
Rent This Article Now for 24 Hours
$5.99 / £3.99 / €4.49
Request Permissions

View Selected Abstracts
Save to My Saved Articles
Export Citation (s)
Download PDF (s)

Add to Basket

View Table of Contents as PDF
Forward TOC

Previous Issue
Next Issue

Copyright Statement
Rights and Permissions
Privacy Policy
Terms of Use
Feedback
Press Releases

© Cambridge University Press

Cambridge University Press

Cross Ref
Cited by CrossRef
Project Counter
Level Double-A conformance icon, W3C-WAI Web Content Accessibility Guidelines 1.0
RSS Feed
Get Adobe Reader
Automated Content Access Protocol enabled