The following pages link to (Q4524785):
Displaying 11 items.
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps (Q429596) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- The liberalized \(\delta\)-rule in free variable semantic tableaux (Q1344882) (← links)
- The cutting of compositions (Q1896323) (← links)
- Cut rule for the resolution method (Q2253866) (← links)
- Cuts and gluts (Q3647229) (← links)
- Lean induction principles for tableaux (Q4610315) (← links)
- Non-elementary speed-ups in proof length by different variants of classical analytic calculi (Q4610324) (← links)
- Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs (Q5436992) (← links)
- Edges and tableaux (Q5925774) (← links)
