Sequent systems on undirected graphs

DOI10.1007/978-3-031-63501-4_12MaRDI QIDQ7034589zbMATH OpenFDO

Authors Matteo Acclavio

Publication date 31 January 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-63501-4_12

zbMATH Keywords

sequent calculusanalyticitygraph modular decomposition

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• scientific article; zbMATH DE number 4103051 (Why is no real title available?)
• scientific article; zbMATH DE number 1024333 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 1765698 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 3414349 (Why is no real title available?)
• scientific article; zbMATH DE number 7809762 (Why is no real title available?)
• A System of Interaction and Structure II: The Need for Deep Inference
• A formal framework for specifying sequent calculus proof systems
• A graphical proof theory of logical time
• A proof calculus which reduces syntactic bureaucracy
• A survey of the algorithmic aspects of modular decomposition
• A system of interaction and structure
• An Analytic Propositional Proof System on Graphs
• BV and Pomset Logic Are Not the Same
• Buffered Communication Analysis in Distributed Multiparty Sessions
• Complement reducible graphs
• From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
• From syntactic proofs to combinatorial proofs
• Games and strategies as event structures
• Generalized connectives for multiplicative linear logic
• Learning pomset automata
• Light linear logic
• Linear logic
• Locality for classical logic
• Logic Programming with Focusing Proofs in Linear Logic
• Logic beyond formulas: a proof system on graphs
• Matching theory
• Modal logic
• Modeling concurrency with partial orders
• Modular sequent systems for modal logic
• Modularisation of sequent calculi for normal and non-normal modalities
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
• Non decomposable connectives of linear logic
• On full abstraction for PCF: I, II and III
• On the length of medial-switch-mix derivations
• On the meaning of logical rules. II: Multiplicatives and additives
• P-Components and the Homogeneous Decomposition of Graphs
• Petri nets, event structures and domains. I
• Pomset logic. The other approach to noncommutativity in logic
• Proofs without syntax
• The structure of multiplicatives
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Transitiv orientierbare Graphen
• Weakly distributive categories

Cited in

(1)

• Logic programming with multiplicative structures

This page was built for publication: Sequent systems on undirected graphs

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