The following pages link to (Q4942635):
Displaying 8 items.
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- A modal view on resource-bounded propositional logics (Q2157601) (← links)
- Encoding first order proofs in SMT (Q2864408) (← links)
- The limits of decidability for first order logic on CPDA graphs (Q2904796) (← links)
- Protocol Verification Via Rigid/Flexible Resolution (Q3498469) (← links)
- (Q4503908) (← links)
- The Exact Complexity of the First-Order Logic Definability Problem (Q5012557) (← links)
- Proving with BDDs and control of information (Q5210793) (← links)