Enumerating Independent Linear Inferences

DOI10.46298/lmcs-19(2:11)2023arXiv2111.05209MaRDI QIDQ6135760

Unnamed Author, Anupam Das

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05209

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Extension without cut
• Complement reducible graphs
• A game semantics for linear logic
• Introduction to computability logic
• Rewriting with Linear Inferences in Propositional Logic
• On linear rewriting systems for Boolean logic and some applications to proof theory
• A Local System for Classical Logic
• Normalisation Control in Deep Inference via Atomic Flows
• The relative efficiency of propositional proof systems
• An Analytic Propositional Proof System on Graphs
• Logic Beyond Formulas
• On the relative proof complexity of deep inference via atomic flows
• A system of interaction and structure
• No complete linear term rewriting system for propositional logic
• A Characterization of Medial as Rewriting Rule
• Algorithm 457: finding all cliques of an undirected graph
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial

This page was built for publication: Enumerating Independent Linear Inferences