Jonathan P. Seldin

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today.
Proceedings of the 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2023

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

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

2016
Bridging Curry and Church's typing style.
J. Appl. Log., 2016

2011
The search for a reduction in combinatory logic equivalent to λβ-reduction.
Theor. Comput. Sci., 2011

Curry's Formalism as Structuralism.
Logica Universalis, 2011

2009
The Logic of Church and Curry.
Proceedings of the Logic from Russell to Church, 2009

2004
Interpreting HOL in the calculus of constructions.
J. Appl. Log., 2004

Variants of the basic calculus of constructions.
J. Appl. Log., 2004

2001
Extensional Set Equality in the Calculus of Constructions.
J. Log. Comput., 2001

2000
A Gentzen-style sequent calculus of constructions with expansion rules.
Theor. Comput. Sci., 2000

On lists and other abstract data types in the calculus of constructions.
Math. Struct. Comput. Sci., 2000

On The Role of Implication in Formal Logic.
J. Symb. Log., 2000

1999
Preface.
Math. Struct. Comput. Sci., 1999

1997
On the Proof Theory of Coquand's Calculus of Constructions.
Ann. Pure Appl. Log., 1997

1992
Coquand's Calculus of Constructions: A Mathematical Foundation for a Proof Development System.
Formal Aspects Comput., 1992

1989
Normalization and excluded middle. I.
Stud Logica, 1989

On Adding (xi) to Weak Equality in Combinatory Logic.
J. Symb. Log., 1989

1986
On the Proof Theory of the Intermediate Logic MH.
J. Symb. Log., 1986

Introduction to Combinators and Lambda-Calculus.
Cambridge University Press, 1986

1980
A second corrigendum to my paper: "Note on definitional reductions".
Notre Dame J. Formal Log., 1980

1978
A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-Calculus.
J. Symb. Log., 1978

Some Anomalies in Fitch's System QD.
J. Symb. Log., 1978

1977
The Q-consistency of <i>F</i><sub>22</sub>.
Notre Dame J. Formal Log., 1977

A Sequent Calculus for Type Assignment.
J. Symb. Log., 1977

1975
Arithmetic as a study of formal systems.
Notre Dame J. Formal Log., 1975

1973
Equality in F <sub>21</sub>.
J. Symb. Log., 1973

1972
Introduction to combinatory logic.
Cambridge University Press, ISBN: 978-0-521-09697-3, 1972

1969
Corrigendum to my paper: "Note on definitional reductions".
Notre Dame J. Formal Log., 1969

1968
Note on definitional reductions.
Notre Dame J. Formal Log., 1968


  Loading...