Jonathan P. Seldin

According to our database, Jonathan P. Seldin authored at least 30 papers between 1968 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

The paradoxes and the infinite dazzled ancient mathematics and continue to do so today.

Fairouz Kamareddine, Jonathan P. Seldin

CoRR, 2024

2018

Formalism and Structuralism, a Synthesis: the Philosophical Ideas of H. B. Curry.

Jonathan P. Seldin

FLAP, 2018

2017

The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II.

Jonathan P. Seldin

Theor. Comput. Sci., 2017

2016

Bridging Curry and Church's typing style.

Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells

J. Appl. Log., 2016

2011

The search for a reduction in combinatory logic equivalent to λβ-reduction.

Jonathan P. Seldin

Theor. Comput. Sci., 2011

Curry's Formalism as Structuralism.

Jonathan P. Seldin

Logica Universalis, 2011

2009

The Logic of Church and Curry.

Jonathan P. Seldin

Proceedings of the Logic from Russell to Church, 2009

2004

Interpreting HOL in the calculus of constructions.

Jonathan P. Seldin

J. Appl. Log., 2004

Variants of the basic calculus of constructions.

Martin W. Bunder, Jonathan P. Seldin

J. Appl. Log., 2004

2001

Extensional Set Equality in the Calculus of Constructions.

Jonathan P. Seldin

J. Log. Comput., 2001

2000

A Gentzen-style sequent calculus of constructions with expansion rules.

Jonathan P. Seldin

Theor. Comput. Sci., 2000

On lists and other abstract data types in the calculus of constructions.

Jonathan P. Seldin

Math. Struct. Comput. Sci., 2000

On The Role of Implication in Formal Logic.

Jonathan P. Seldin

J. Symb. Log., 2000

1999

Preface.

Mariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin

Math. Struct. Comput. Sci., 1999

1997

On the Proof Theory of Coquand's Calculus of Constructions.

Jonathan P. Seldin

Ann. Pure Appl. Log., 1997

1992

Coquand's Calculus of Constructions: A Mathematical Foundation for a Proof Development System.

Jonathan P. Seldin

Formal Aspects Comput., 1992

1989

Normalization and excluded middle. I.

Jonathan P. Seldin

Stud Logica, 1989

On Adding (xi) to Weak Equality in Combinatory Logic.

Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin

J. Symb. Log., 1989

1986

On the Proof Theory of the Intermediate Logic MH.

Jonathan P. Seldin

J. Symb. Log., 1986

Introduction to Combinators and Lambda-Calculus.

J. Roger Hindley, Jonathan P. Seldin

Cambridge University Press, 1986

1980

A second corrigendum to my paper: "Note on definitional reductions".

Jonathan P. Seldin

Notre Dame J. Formal Log., 1980

1978

A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-Calculus.

Jonathan P. Seldin

J. Symb. Log., 1978

Some Anomalies in Fitch's System QD.

Martin W. Bunder, Jonathan P. Seldin

J. Symb. Log., 1978

1977

The Q-consistency of <i>F</i>₂₂.

Jonathan P. Seldin

Notre Dame J. Formal Log., 1977

A Sequent Calculus for Type Assignment.

Jonathan P. Seldin

J. Symb. Log., 1977

1975

Arithmetic as a study of formal systems.

Jonathan P. Seldin

Notre Dame J. Formal Log., 1975

1973

Equality in F ₂₁.

Jonathan P. Seldin

J. Symb. Log., 1973

1972

Introduction to combinatory logic.

J. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin

Cambridge University Press, ISBN: 978-0-521-09697-3, 1972

1969

Corrigendum to my paper: "Note on definitional reductions".

Jonathan P. Seldin

Notre Dame J. Formal Log., 1969

1968

Note on definitional reductions.

Jonathan P. Seldin

Notre Dame J. Formal Log., 1968