Combinatorial Proofs and Decomposition Theorems for First-order Logic

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a syntax-free presentation of a proof that is independent from a...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Hughes, Dominic J. D., Strasburger, Lutz, Wu, Jui-Hsuan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Computer science Syntactics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!