default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan P. Seldin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Fairouz Kamareddine, Jonathan P. Seldin:
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today. CoRR abs/2401.02806 (2024)- 2023
- [c1]Fairouz Kamareddine, Jonathan P. Seldin:
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today. SYNASC 2023: 11-19
2010 – 2019
- 2018
- [j26]Jonathan P. Seldin:
Formalism and Structuralism, a Synthesis: the Philosophical Ideas of H. B. Curry. FLAP 5(6): 1301-1306 (2018) - 2017
- [j25]Jonathan P. Seldin:
The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II. Theor. Comput. Sci. 663: 34-58 (2017) - 2016
- [j24]Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells:
Bridging Curry and Church's typing style. J. Appl. Log. 18: 42-70 (2016) - 2011
- [j23]Jonathan P. Seldin:
Curry's Formalism as Structuralism. Logica Universalis 5(1): 91-100 (2011) - [j22]Jonathan P. Seldin:
The search for a reduction in combinatory logic equivalent to λβ-reduction. Theor. Comput. Sci. 412(37): 4905-4918 (2011)
2000 – 2009
- 2009
- [r1]Jonathan P. Seldin:
The Logic of Church and Curry. Logic from Russell to Church 2009: 819-873 - 2004
- [j21]Jonathan P. Seldin:
Interpreting HOL in the calculus of constructions. J. Appl. Log. 2(2): 173-189 (2004) - [j20]Martin W. Bunder, Jonathan P. Seldin:
Variants of the basic calculus of constructions. J. Appl. Log. 2(2): 191-217 (2004) - 2001
- [j19]Jonathan P. Seldin:
Extensional Set Equality in the Calculus of Constructions. J. Log. Comput. 11(3): 483-493 (2001) - 2000
- [j18]Jonathan P. Seldin:
On The Role of Implication in Formal Logic. J. Symb. Log. 65(3): 1076-1114 (2000) - [j17]Jonathan P. Seldin:
On lists and other abstract data types in the calculus of constructions. Math. Struct. Comput. Sci. 10(2): 261-276 (2000) - [j16]Jonathan P. Seldin:
A Gentzen-style sequent calculus of constructions with expansion rules. Theor. Comput. Sci. 243(1-2): 199-215 (2000)
1990 – 1999
- 1999
- [j15]Mariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin:
Preface. Math. Struct. Comput. Sci. 9(4): 321 (1999) - 1997
- [j14]Jonathan P. Seldin:
On the Proof Theory of Coquand's Calculus of Constructions. Ann. Pure Appl. Log. 83(1): 23-101 (1997) - 1992
- [j13]Jonathan P. Seldin:
Coquand's Calculus of Constructions: A Mathematical Foundation for a Proof Development System. Formal Aspects Comput. 4(5): 425-441 (1992)
1980 – 1989
- 1989
- [j12]Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin:
On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. 54(2): 590-607 (1989) - [j11]Jonathan P. Seldin:
Normalization and excluded middle. I. Stud Logica 48(2): 193-217 (1989) - 1986
- [b2]J. Roger Hindley, Jonathan P. Seldin:
Introduction to Combinators and Lambda-Calculus. Cambridge University Press 1986 - [j10]Jonathan P. Seldin:
On the Proof Theory of the Intermediate Logic MH. J. Symb. Log. 51(3): 626-647 (1986) - 1980
- [j9]Jonathan P. Seldin:
A second corrigendum to my paper: "Note on definitional reductions". Notre Dame J. Formal Log. 21(4): 728 (1980)
1970 – 1979
- 1978
- [j8]Martin W. Bunder, Jonathan P. Seldin:
Some Anomalies in Fitch's System QD. J. Symb. Log. 43(2): 247-249 (1978) - [j7]Jonathan P. Seldin:
A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-Calculus. J. Symb. Log. 43(4): 643-649 (1978) - 1977
- [j6]Jonathan P. Seldin:
A Sequent Calculus for Type Assignment. J. Symb. Log. 42(1): 11-28 (1977) - [j5]Jonathan P. Seldin:
The Q-consistency of F22. Notre Dame J. Formal Log. 18(1): 117-127 (1977) - 1975
- [j4]Jonathan P. Seldin:
Arithmetic as a study of formal systems. Notre Dame J. Formal Log. 16(4): 449-464 (1975) - 1973
- [j3]Jonathan P. Seldin:
Equality in F 21. J. Symb. Log. 38(4): 571-575 (1973) - 1972
- [b1]J. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin:
Introduction to combinatory logic. Cambridge University Press 1972, ISBN 978-0-521-09697-3, pp. 1-170
1960 – 1969
- 1969
- [j2]Jonathan P. Seldin:
Corrigendum to my paper: "Note on definitional reductions". Notre Dame J. Formal Log. 10(4): 412 (1969) - 1968
- [j1]Jonathan P. Seldin:
Note on definitional reductions. Notre Dame J. Formal Log. 9(1): 4-6 (1968)
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-05-20 00:52 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:
