Resource graphs and countermodels in resource logics

zbMATH Open1272.68356MaRDI QIDQ2848062FDOQ2848062

Didier Galmiche, Daniel Méry

Publication date: 25 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105050760

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cited In (2)

• A connection-based characterization of bi-intuitionistic validity
• A Connection-Based Characterization of Bi-intuitionistic Validity

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A Modal-Logic Based Graph Abstraction 👍 👎
• A Graph-theoretic Account of Logics 👍 👎
• Tableaux and Resource Graphs for Separation Logic 👍 👎
• Graph theoretical structures in logic programs and default theories 👍 👎
• On abstract resource semantics and computability logic 👍 👎
• A modal view on resource-bounded propositional logics 👍 👎
• A modal separation logic for resource dynamics 👍 👎
• Models and Separation Logics for Resource Trees 👍 👎

This page was built for publication: Resource graphs and countermodels in resource logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848062)