Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Resource-distribution via Boolean constraints

From MaRDI portal
Publication:5267424
Jump to:navigation, search

DOI10.1145/601775.601778zbMath1407.03078OpenAlexW2112448481MaRDI QIDQ5267424

James Harland, David J. Pym

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/601775.601778

zbMATH Keywords

sequent calculussubstructural logicsalgebrasrelevant logicsBoolean constraintsproof-search


Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Proof theory in general (including proof-theoretic semantics) (03F03)


Related Items

Bunched sequential information, Temporal BI: proof system, semantics and translations, Unnamed Item, Efficient resource management for linear logic proof search, Focussing and proof construction, Resourceful program synthesis from graded linear types



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5267424&oldid=19910650"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 21:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki