Pages that link to "Item:Q798649"

The following pages link to On some proof theoretical properties of the modal logic GL (Q798649):

Displaying 11 items.

• Cut elimination for GLS using the terminability of its regress process (Q288243) (← links)
• The modal logic of provability: cut-elimination (Q790809) (← links)
• Syntactical results on the arithmetical completeness of modal logic (Q1319362) (← links)
• Cut-elimination for weak Grzegorczyk logic Go (Q2016062) (← links)
• Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq (Q2142084) (← links)
• A proof theory for the logic of provability in true arithmetic (Q2193977) (← links)
• On the absence of finite approximation relative to model completeness in propositional provability logic (Q2833438) (← links)
• Valentini's cut-elimination for provability logic resolved (Q2890695) (← links)
• A Syntactic Proof of Cut‐Elimination For GL_lin (Q3762309) (← links)
• (Q5445167) (← links)
• The persistence principle over weak interpretability logic (Q6561649) (← links)