The following pages link to John C. Shepherdson (Q1254850):
Displaying 50 items.
- (Q788705) (redirect page) (← links)
- Calvin C. Elgot (1922-1980) (Q788706) (← links)
- Utility theory based on rational probabilities (Q1136594) (← links)
- In memoriam Calvin C. Elgot (Q1154455) (← links)
- Graph theoretic characterization of G-schemes and T L-schemes (Q1159978) (← links)
- SLDNF-resolution with equality (Q1189731) (← links)
- Mints type deductive calculi for logic programming (Q1192340) (← links)
- A semantically meaningful characterization of reducible flowchart schemes (Q1254851) (← links)
- The role of standardising apart in logic programming (Q1329744) (← links)
- A sound and complete semantics for a version of negation as failure (Q1824413) (← links)
- Sets recognized by n-tape automata (Q2542993) (← links)
- On two problems of Kurepa (Q2651770) (← links)
- On the factorization of polynomials in a finite number of steps (Q2653557) (← links)
- Effective operations on partial recursive functions (Q3230369) (← links)
- Effective procedures in field theory (Q3231245) (← links)
- Note on a system of myhill (Q3233203) (← links)
- On the interpretation of Aristotelian syllogistic (Q3235791) (← links)
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption (Q3694733) (← links)
- Negation as failure. II (Q3740275) (← links)
- (Q3769942) (← links)
- (Q3804680) (← links)
- (Q3930617) (← links)
- Some diophantine forms of gödel's theorem (Q3956938) (← links)
- Partial evaluation in logic programming (Q3988796) (← links)
- Correct answers to allowed programs and queries are ground (Q3988802) (← links)
- (Q4010369) (← links)
- Unfold/fold transformations of logic programs (Q4015152) (← links)
- (Q4067074) (← links)
- (Q4088800) (← links)
- Gödel's Second incompleteness theorem for <i>Q</i> (Q4093419) (← links)
- On the Definition of Computable Function of a Real Variable (Q4132502) (← links)
- Partial deduction of updateable definite logic programs (Q4289930) (← links)
- (Q4391448) (← links)
- (Q4428888) (← links)
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic (Q4508252) (← links)
- Variants of Robinson's essentially undecidable theoryR (Q4749827) (← links)
- (Q4764104) (← links)
- (Q4813513) (← links)
- The liar paradox and fuzzy logic (Q4953224) (← links)
- (Q5341750) (← links)
- (Q5534937) (← links)
- (Q5541340) (← links)
- Machine Configuration and Word Problems of Given Degree of Unsolvability (Q5545521) (← links)
- (Q5551163) (← links)
- Weak and Strong Induction (Q5581610) (← links)
- Representability of recursively enumerable sets in formal theories (Q5720192) (← links)
- Computability of Recursive Functions (Q5729305) (← links)
- Ernst Robert (Peter) Reifenberg (Q5733508) (← links)
- Properties of a Pruning Operator (Q5750389) (← links)
- (Q5750391) (← links)
