The following pages link to FLOTTER (Q41399):
Displayed 15 items.
- Labelled splitting (Q1037396) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- An optimality result for clause form translation (Q1201346) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators (Q1432885) (← links)
- Deciding the \(E^+\)-class by an a posteriori, liftable order (Q1577484) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. II (Q1864899) (← links)
- Deciding the guarded fragments by resolution (Q1867216) (← links)
- A note on assumptions about Skolem functions (Q1904405) (← links)
- Effective Normalization Techniques for HOL (Q2817937) (← links)
- Reasoning without believing: on the mechanisation of presuppositions and partiality (Q4583173) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← links)
- (Q5219924) (← links)
- Integration of automated and interactive theorem proving in ILF (Q5234689) (← links)
- Soft typing for ordered resolution (Q5234715) (← links)