Person:1254850: Difference between revisions

From MaRDI portal
Person:1254850
m AuthorDisambiguator moved page Person:788705 to John C. Shepherdson: Duplicate
m AuthorDisambiguator moved page John C. Shepherdson to John C. Shepherdson: Duplicate
 
(No difference)

Latest revision as of 23:10, 8 December 2023

Available identifiers

zbMath Open shepherdson.john-cWikidataQ37737905 ScholiaQ37737905MaRDI QIDQ1254850

List of research outcomes





PublicationDate of PublicationType
A tribute to Leslie Howarth (1911--2001)2024-10-02Paper
https://portal.mardi4nfdi.de/entity/Q48135132004-08-13Paper
https://portal.mardi4nfdi.de/entity/Q44288882003-09-22Paper
A note on the notion of truth in fuzzy logic2003-02-03Paper
Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic2001-01-14Paper
The liar paradox and fuzzy logic2000-06-22Paper
https://portal.mardi4nfdi.de/entity/Q43914481998-06-03Paper
https://portal.mardi4nfdi.de/entity/Q47641041995-09-18Paper
The role of standardising apart in logic programming1995-05-01Paper
Partial deduction of updateable definite logic programs1995-01-02Paper
Unfold/fold transformations of logic programs1992-12-14Paper
SLDNF-resolution with equality1992-09-27Paper
Mints type deductive calculi for logic programming1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40103691992-09-27Paper
Partial evaluation in logic programming1992-06-28Paper
Correct answers to allowed programs and queries are ground1992-06-28Paper
Properties of a Pruning Operator1990-01-01Paper
A sound and complete semantics for a version of negation as failure1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37699421988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38046801988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57503911988-01-01Paper
Negation as failure. II1985-01-01Paper
Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption1984-01-01Paper
Calvin C. Elgot (1922-1980)1983-01-01Paper
Variants of Robinson's essentially undecidable theoryR1983-01-01Paper
Graph theoretic characterization of G-schemes and T L-schemes1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39306171982-01-01Paper
Some diophantine forms of gödel's theorem1982-01-01Paper
In memoriam Calvin C. Elgot1981-01-01Paper
Utility theory based on rational probabilities1980-01-01Paper
A semantically meaningful characterization of reducible flowchart schemes1979-01-01Paper
Gödel's Second incompleteness theorem for Q1976-01-01Paper
On the Definition of Computable Function of a Real Variable1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888001975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40670741970-01-01Paper
Sets recognized by n-tape automata1969-01-01Paper
Weak and Strong Induction1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55349371965-01-01Paper
Machine Configuration and Word Problems of Given Degree of Unsolvability1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55511631965-01-01Paper
Ernst Robert (Peter) Reifenberg1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53417501964-01-01Paper
Computability of Recursive Functions1963-01-01Paper
Representability of recursively enumerable sets in formal theories1961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55413401959-01-01Paper
Effective procedures in field theory1956-01-01Paper
Note on a system of myhill1956-01-01Paper
On the interpretation of Aristotelian syllogistic1956-01-01Paper
On the factorization of polynomials in a finite number of steps1955-01-01Paper
Effective operations on partial recursive functions1955-01-01Paper
On two problems of Kurepa1954-01-01Paper
Inner models for set theory – Part III1953-01-01Paper
Inner models for set theory—Part II1952-01-01Paper
Inverses and Zero Divisors in Matrix Rings1951-01-01Paper
Inner models for set theory—Part I1951-01-01Paper
Well-Ordered Sub-Series of General Series1951-01-01Paper
On the Addition of Elements of a Sequence1947-01-01Paper

Research outcomes over time

This page was built for person: John C. Shepherdson