Pages that link to "Item:Q638492"
From MaRDI portal
The following pages link to Cut-free formulations for a quantified logic of here and there (Q638492):
Displaying 4 items.
- Is cut-free logic fit for unrestricted abstraction? (Q2131274) (← links)
- Syntactic ASP forgetting with forks (Q2694542) (← links)
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs (Q6063883) (← links)
- Syntactic ASP forgetting with forks (Q6152659) (← links)