default search action
John C. Shepherdson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
- [j32]Petr Hájek, John C. Shepherdson:
A note on the notion of truth in fuzzy logic. Ann. Pure Appl. Log. 109(1-2): 65-69 (2001) - 2000
- [j31]Petr Hájek, Jeff B. Paris, John C. Shepherdson:
The Liar Paradox and Fuzzy Logic. J. Symb. Log. 65(1): 339-346 (2000) - [j30]Petr Hájek, Jeff B. Paris, John C. Shepherdson:
Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic. J. Symb. Log. 65(2): 669-682 (2000)
1990 – 1999
- 1995
- [c2]John C. Shepherdson:
W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra. Machine Intelligence 15 1995: 489-505 - 1994
- [j29]Kerima Benkerimi, John C. Shepherdson:
Partial Deduction of Updateable Definite Logic Programs. J. Log. Program. 18(1): 1-26 (1994) - [j28]John C. Shepherdson:
The Role of Standardising Apart in Logic Programming. Theor. Comput. Sci. 129(1): 143-142 (1994) - 1992
- [j27]John C. Shepherdson:
Mints Type Deductive Calculi for Logic Programming. Ann. Pure Appl. Log. 56(1-3): 7-17 (1992) - [j26]John C. Shepherdson:
SLDNF-Resolution with Equality. J. Autom. Reason. 8(2): 297-306 (1992) - [j25]John C. Shepherdson:
Unfold/Fold Transformations of Logic Programs. Math. Struct. Comput. Sci. 2(2): 143-157 (1992) - 1991
- [j24]John C. Shepherdson:
Unsolvable Problems for SLDNF Resolution. J. Log. Program. 10(1): 19-22 (1991) - [j23]John W. Lloyd, John C. Shepherdson:
Partial Evaluation in Logic Programming. J. Log. Program. 11(3&4): 217-242 (1991) - [j22]John C. Shepherdson:
Correct Answers to Allowed Programs and Queries are Ground. J. Log. Program. 11(3&4): 359-362 (1991) - [c1]Philippa Gardner, John C. Shepherdson:
Unfold/Fold Transformations of Logic Programs. Computational Logic - Essays in Honor of Alan Robinson 1991: 565-583 - 1990
- [j21]Patricia M. Hill, John W. Lloyd, John C. Shepherdson:
Properties of a Pruning Operator. J. Log. Comput. 1(1): 99-143 (1990)
1980 – 1989
- 1989
- [j20]John C. Shepherdson:
A Sound and Complete Semantics for a Version of Negation as Failure. Theor. Comput. Sci. 65(3): 343-371 (1989) - 1988
- [p1]John C. Shepherdson:
Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming. 1988: 19-88 - 1985
- [j19]John C. Shepherdson:
Negation as Failure II. J. Log. Program. 2(3): 185-202 (1985) - 1984
- [j18]John C. Shepherdson:
Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. J. Log. Program. 1(1): 51-79 (1984) - 1983
- [j17]James P. Jones, John C. Shepherdson:
Variants of Robinson's essentially undecidable theoryR. Arch. Math. Log. 23(1): 61-64 (1983) - 1982
- [j16]John C. Shepherdson:
Graph Theoretic Characterization of G-Schemes and TL-Schemes. Theor. Comput. Sci. 17: 217-228 (1982) - 1981
- [j15]John C. Shepherdson:
In Memoriam Calvin C. Elgot. Theor. Comput. Sci. 16: 1-4 (1981) - 1980
- [j14]Verena H. Dyson, James P. Jones, John C. Shepherdson:
Some diophantine forms of gödel's theorem. Arch. Math. Log. 22(1-2): 51-60 (1980)
1970 – 1979
- 1979
- [j13]Calvin C. Elgot, John C. Shepherdson:
A Semantically Meaningful Characterization of Reducible Flowchart Schemes. Theor. Comput. Sci. 8: 325-357 (1979) - 1976
- [j12]A. Bezboruah, John C. Shepherdson:
Godel's Second Incompleteness Theorem for Q. J. Symb. Log. 41(2): 503-512 (1976) - [j11]John C. Shepherdson:
On the Definition of Computable Function of a Real Variable. Math. Log. Q. 22(1): 391-402 (1976) - 1974
- [j10]H. E. Rose, John C. Shepherdson:
European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. J. Symb. Log. 39(2): 406-432 (1974) - 1970
- [j9]John C. Shepherdson:
R70-20 Sequential Boolean Equations. IEEE Trans. Computers 19(7): 658 (1970)
1960 – 1969
- 1964
- [j8]John C. Shepherdson, S. Korner, M. D. Gladstone:
Meeting of the Association for Symbolic Logic. J. Symb. Log. 29(4): 218-228 (1964) - 1963
- [j7]John C. Shepherdson, Howard E. Sturgis:
Computability of Recursive Functions. J. ACM 10(2): 217-255 (1963)
1950 – 1959
- 1959
- [j6]John C. Shepherdson:
The Reduction of Two-Way Automata to One-Way Automata. IBM J. Res. Dev. 3(2): 198-200 (1959) - 1956
- [j5]John C. Shepherdson:
On the Interpretation of Aristotelian Syllogistic. J. Symb. Log. 21(2): 137-147 (1956) - [j4]John C. Shepherdson:
Note on a System of Myhill. J. Symb. Log. 21(3): 261-264 (1956) - 1953
- [j3]John C. Shepherdson:
Inner Models for Set Theory - Part III. J. Symb. Log. 18(2): 145-167 (1953) - 1952
- [j2]John C. Shepherdson:
Inner Models for Set Theory-Part II. J. Symb. Log. 17(4): 225-237 (1952) - 1951
- [j1]John C. Shepherdson:
Inner Models for Set Theory - Part I. J. Symb. Log. 16(3): 161-190 (1951)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: