An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics

DOI10.1016/j.entcs.2010.08.022zbMath1343.03021OpenAlexW2081691131MaRDI QIDQ3178265

Dominique Larchey-Wendling

Publication date: 8 July 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.08.022

zbMATH Keywords

decidabilityKripke semanticsMinsky machineBoolean bunched logicclassical bunched logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items

Effect algebras, Girard quantales and complementation in separation logic

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The semantics and proof theory of the logic of bunched implications
• Nondeterministic Phase Semantics and the Undecidability of Boolean BI
• Undecidability of Propositional Separation Logic and Its Neighbours
• Modal logics withn-ary connectives
• The semantics of BI and resource tableaux
• Classical BI: Its Semantics and Proof Theory
• Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding
• The Logic of Bunched Implications
• BI as an assertion language for mutable data structures
• Classical BI
• Expressivity Properties of Boolean BI Through Relational Models
• Reachability analysis of pushdown automata: Application to model-checking