Author:
Acclavio Matteo,Straßburger Lutz
Publisher
Springer International Publishing
Reference19 articles.
1. Bellin, G., van de Wiele, J.: Subnets of proof-nets in MLL$$^-$$. In: Advances in Linear Logic, pp. 249–270. Cambridge University Press (1995)
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);K Brünnler,2001
3. Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Logic 44(1), 36–50 (1979)
4. Das, A.: On the relative proof complexity of deep inference via atomic flows. Log. Methods Comput. Sci. 11(1), 1–23 (2015)
5. Das, A., Straßburger, L.: On linear rewriting systems for Boolean logic and some applications to proof theory. Log. Methods Comput. Sci. 12(4), 1–27 (2016)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sequent Systems on Undirected Graphs;Lecture Notes in Computer Science;2024
2. Exponentially Handsome Proof Nets and Their Normalization;Electronic Proceedings in Theoretical Computer Science;2021-12-30
3. Combinatorial Proofs and Decomposition Theorems for First-order Logic;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
4. Proof Nets for Classical Logic;Notre Dame Journal of Formal Logic;2021-05-01
5. Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities;Computer Aided Verification;2021