John C. Shepherdson

Available identifiers

zbMath Open shepherdson.john-cWikidataQ37737905 ScholiaQ37737905MaRDI QIDQ1254850

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4813513	2004-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4428888	2003-09-22	Paper
A note on the notion of truth in fuzzy logic	2003-02-03	Paper
Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic	2001-01-14	Paper
The liar paradox and fuzzy logic	2000-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q4391448	1998-06-03	Paper
https://portal.mardi4nfdi.de/entity/Q4764104	1995-09-18	Paper
The role of standardising apart in logic programming	1995-05-01	Paper
Partial deduction of updateable definite logic programs	1995-01-02	Paper
Unfold/fold transformations of logic programs	1992-12-14	Paper
SLDNF-resolution with equality	1992-09-27	Paper
Mints type deductive calculi for logic programming	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4010369	1992-09-27	Paper
Partial evaluation in logic programming	1992-06-28	Paper
Correct answers to allowed programs and queries are ground	1992-06-28	Paper
Properties of a Pruning Operator	1990-01-01	Paper
A sound and complete semantics for a version of negation as failure	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3769942	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3804680	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5750391	1988-01-01	Paper
Negation as failure. II	1985-01-01	Paper
Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption	1984-01-01	Paper
Calvin C. Elgot (1922-1980)	1983-01-01	Paper
Variants of Robinson's essentially undecidable theoryR	1983-01-01	Paper
Graph theoretic characterization of G-schemes and T L-schemes	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3930617	1982-01-01	Paper
Some diophantine forms of gödel's theorem	1982-01-01	Paper
In memoriam Calvin C. Elgot	1981-01-01	Paper
Utility theory based on rational probabilities	1980-01-01	Paper
A semantically meaningful characterization of reducible flowchart schemes	1979-01-01	Paper
Gödel's Second incompleteness theorem for Q	1976-01-01	Paper
On the Definition of Computable Function of a Real Variable	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4088800	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4067074	1970-01-01	Paper
Sets recognized by n-tape automata	1969-01-01	Paper
Weak and Strong Induction	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5534937	1965-01-01	Paper
Machine Configuration and Word Problems of Given Degree of Unsolvability	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5551163	1965-01-01	Paper
Ernst Robert (Peter) Reifenberg	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5341750	1964-01-01	Paper
Computability of Recursive Functions	1963-01-01	Paper
Representability of recursively enumerable sets in formal theories	1961-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5541340	1959-01-01	Paper
Effective procedures in field theory	1956-01-01	Paper
Note on a system of myhill	1956-01-01	Paper
On the interpretation of Aristotelian syllogistic	1956-01-01	Paper
On the factorization of polynomials in a finite number of steps	1955-01-01	Paper
Effective operations on partial recursive functions	1955-01-01	Paper
On two problems of Kurepa	1954-01-01	Paper
Inner models for set theory – Part III	1953-01-01	Paper
Inner models for set theory—Part II	1952-01-01	Paper
Inverses and Zero Divisors in Matrix Rings	1951-01-01	Paper
Inner models for set theory—Part I	1951-01-01	Paper
Well-Ordered Sub-Series of General Series	1951-01-01	Paper
On the Addition of Elements of a Sequence	1947-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: John C. Shepherdson