The following pages link to W. E. Singletary (Q1220501):
Displayed 20 items.
- The one-one equivalence of some general combinatorial decision problems (Q1220502) (← links)
- Many-one degrees associated with partial propositional calculi (Q2265412) (← links)
- Results regarding the axiomatization of partial propositional calculi (Q2539215) (← links)
- Connectedness-equivalent spaces on the line (Q2539760) (← links)
- Tutor - a Turing machine simulator (Q2556223) (← links)
- Triadic partial implicational propositional calculi (Q4063116) (← links)
- Combinatorial systems defined over one- and two-letter alphabets (Q4103085) (← links)
- (Q4130949) (← links)
- A note on finite axiomatization of partial propositional calculi (Q5545947) (← links)
- (Q5552754) (← links)
- The post correspondence problem (Q5556433) (← links)
- The equivalence of some general combinatorial decision problems (Q5556434) (← links)
- Degrees of Unsolvability in Formal Grammars (Q5556435) (← links)
- A complex of problems proposed by Post (Q5557938) (← links)
- Decision problems associated with complete deterministic normal systems (Q5609384) (← links)
- The many-one equivalence of some general combinatorial decision problems (Q5619078) (← links)
- (Q5639688) (← links)
- On deterministic normal systems (Q5663843) (← links)
- Combinatorial systems with axiom (Q5921244) (← links)
- Combinatorial systems with axiom (Q5921583) (← links)