The following pages link to Bernard R. Hodgson (Q790802):
Displaying 15 items.
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
- Regards sur les etudes de la CIEM. (Considerations on the studies of CIEM) (Q805596) (← links)
- Uniform normal form for general time-bounded complexity classes (Q1087539) (← links)
- Difficulties in the passage from secondary to tertiary education (Q1126877) (← links)
- On direct products of automaton decidable theories (Q1168306) (← links)
- An arithmetical characterization of NP (Q1171050) (← links)
- (Q3312199) (← links)
- (Q3350831) (← links)
- (Q3584320) (← links)
- Complexity bounds on proofs (Q3922673) (← links)
- (Q3990998) (← links)
- (Q4293707) (← links)
- (Q4362881) (← links)
- Extensions of arithmetic for proving termination of computations (Q4732468) (← links)
- A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems (Q5881273) (← links)
