The following pages link to Larry Wos (Q220717):
Displaying 50 items.
- The problem of demodulation during inference rule application (Q688553) (← links)
- The problem of demodulator adjunction (Q688566) (← links)
- The problem of demodulating across argument and literal boundaries (Q688583) (← links)
- The absence and the presence of fixed point combinators (Q807612) (← links)
- Basic research problems: The problem of choosing the representation, inference rule, and strategy (Q809627) (← links)
- The problem of choosing the type of subsumption to use (Q809628) (← links)
- Double-negation elimination in some propositional logics (Q813082) (← links)
- Meeting the challenge of fifty years of logic (Q911807) (← links)
- The problem of finding a semantic strategy for focusing inference rules (Q915497) (← links)
- A case study in automated theorem proving: Finding sages in combinatory logic (Q1098333) (← links)
- Erratum to ``A case study in automated theorem proving: finding sages in combinatory logic'' (Q1107334) (← links)
- The linked inference principle. I: The formal treatment (Q1189727) (← links)
- The problem of reasoning from inequalities (Q1195540) (← links)
- Automating the search for elegant proofs (Q1272613) (← links)
- The hot list strategy (Q1285861) (← links)
- The problem of naming and function replacement (Q1311398) (← links)
- The kernel strategy and its use for the study of combinatory logic (Q1311399) (← links)
- The problem of reasoning by analogy (Q1311406) (← links)
- The problem of selecting an approach based on prior success (Q1311414) (← links)
- The problem of automated theorem finding (Q1312164) (← links)
- The problem of induction (Q1319388) (← links)
- The problem of reasoning by case analysis (Q1319394) (← links)
- Basic research problems: The problem of strategy and hyperresolution (Q1332645) (← links)
- The problem of hyperparamodulation (Q1337565) (← links)
- The problem of hyperparamodulation and nuclei (Q1340968) (← links)
- The application of automated reasoning to questions in mathematics and logic (Q1354049) (← links)
- The power of combining resonance with heat (Q1357664) (← links)
- Shortest axiomatizations of implicational S4 and S5 (Q1430904) (← links)
- The strategy of cramming (Q1810853) (← links)
- OTTER and the Moufang identity problem (Q1815858) (← links)
- The problem of guaranteeing the existence of a complete set of reductions (Q1823015) (← links)
- The problem of determining the size of a complete set of reductions (Q1823016) (← links)
- The problem of finding an inference rule for set theory (Q1823017) (← links)
- Short single axioms for Boolean algebra (Q1869610) (← links)
- Hilbert's twenty-fourth problem (Q1869614) (← links)
- Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus (Q1869616) (← links)
- Searching for circles of pure proofs (Q1904397) (← links)
- Finding proofs in Tarskian geometry (Q2362499) (← links)
- (Q2754067) (← links)
- (Q2754068) (← links)
- OTTER Proofs in Tarskian Geometry (Q3192214) (← links)
- (Q3433180) (← links)
- (Q3804236) (← links)
- (Q3829089) (← links)
- Automated theorem proving and logic programming: a natural symbiosis (Q3978317) (← links)
- (Q3994754) (← links)
- Unit Refutations and Horn Sets (Q4050192) (← links)
- (Q4255507) (← links)
- (Q4264737) (← links)
- (Q4296171) (← links)
