Jonathan P. Seldin

Publication Activity (10 Years)

Years Active: 1968-2024
Publications (10 Years): 5

Top Topics

Computer Algebra

Mathematical Knowledge

Top Venues

Theor. Comput. Sci.

Publications

Fairouz Kamareddine, Jonathan P. Seldin
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today. CoRR (2024)
Fairouz Kamareddine, Jonathan P. Seldin
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today. SYNASC (2023)
Jonathan P. Seldin
Formalism and Structuralism, a Synthesis: the Philosophical Ideas of H. B. Curry. FLAP 5 (6) (2018)
Jonathan P. Seldin
The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II. Theor. Comput. Sci. 663 (2017)
Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells
Bridging Curry and Church's typing style. J. Appl. Log. 18 (2016)
Jonathan P. Seldin
Curry's Formalism as Structuralism. Logica Universalis 5 (1) (2011)
Jonathan P. Seldin
The search for a reduction in combinatory logic equivalent to λβ-reduction. Theor. Comput. Sci. 412 (37) (2011)
Martin W. Bunder, Jonathan P. Seldin
Variants of the basic calculus of constructions. J. Appl. Log. 2 (2) (2004)
Jonathan P. Seldin
Interpreting HOL in the calculus of constructions. J. Appl. Log. 2 (2) (2004)
Jonathan P. Seldin
Extensional Set Equality in the Calculus of Constructions. J. Log. Comput. 11 (3) (2001)
Jonathan P. Seldin
A Gentzen-style sequent calculus of constructions with expansion rules. Theor. Comput. Sci. 243 (1-2) (2000)
Jonathan P. Seldin
On The Role of Implication in Formal Logic. J. Symb. Log. 65 (3) (2000)
Jonathan P. Seldin
On lists and other abstract data types in the calculus of constructions. Math. Struct. Comput. Sci. 10 (2) (2000)
Mariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin
Preface. Math. Struct. Comput. Sci. 9 (4) (1999)
Jonathan P. Seldin
On the Proof Theory of Coquand's Calculus of Constructions. Ann. Pure Appl. Log. 83 (1) (1997)
Jonathan P. Seldin
Coquand's Calculus of Constructions: A Mathematical Foundation for a Proof Development System. Formal Aspects Comput. 4 (5) (1992)
Jonathan P. Seldin
Normalization and excluded middle. I. Stud Logica 48 (2) (1989)
Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
On Adding (xi) to Weak Equality in Combinatory Logic. J. Symb. Log. 54 (2) (1989)
Jonathan P. Seldin
On the Proof Theory of the Intermediate Logic MH. J. Symb. Log. 51 (3) (1986)
Jonathan P. Seldin
A second corrigendum to my paper: "Note on definitional reductions". Notre Dame J. Formal Log. 21 (4) (1980)
Jonathan P. Seldin
A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-Calculus. J. Symb. Log. 43 (4) (1978)
Martin W. Bunder, Jonathan P. Seldin
Some Anomalies in Fitch's System QD. J. Symb. Log. 43 (2) (1978)
Jonathan P. Seldin
A Sequent Calculus for Type Assignment. J. Symb. Log. 42 (1) (1977)
Jonathan P. Seldin
. Notre Dame J. Formal Log. 18 (1) (1977)
Jonathan P. Seldin
Arithmetic as a study of formal systems. Notre Dame J. Formal Log. 16 (4) (1975)
Jonathan P. Seldin
. J. Symb. Log. 38 (4) (1973)
Jonathan P. Seldin
Corrigendum to my paper: "Note on definitional reductions". Notre Dame J. Formal Log. 10 (4) (1969)
Jonathan P. Seldin
Note on definitional reductions. Notre Dame J. Formal Log. 9 (1) (1968)