The following pages link to (Q2751355):
Displaying 11 items.
- A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
- Resolution is cut-free (Q972424) (← links)
- Socratic proofs (Q1876085) (← links)
- Resourceful program synthesis from graded linear types (Q2119110) (← links)
- Path calculus in the modal logic S4 (Q2571516) (← links)
- Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi (Q2817945) (← links)
- Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations (Q3455767) (← links)
- Decidability of the Class E by Maslov’s Inverse Method (Q3586019) (← links)
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method (Q5191105) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- A modal loosely guarded fragment of second-order propositional modal logic (Q6169327) (← links)
