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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori:	Hughes, Dominic J. D., Strasburger, Lutz, Wu, Jui-Hsuan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 29.06.2021
Predmet:	Computer science Syntactics
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!