Jonathan P. Seldin

31 papers Misc 1Journal 27
YearRankTypeTitle / Venue / Authors
2024 J jnl
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today.
CoRR
Fairouz Kamareddine, Jonathan P. Seldin
2023 Misc conf
The paradoxes and the infinite dazzled ancient mathematics and continue to do so today.
SYNASC
Fairouz Kamareddine, Jonathan P. Seldin
2018 J jnl
Formalism and Structuralism, a Synthesis: the Philosophical Ideas of H. B. Curry.
FLAP
Jonathan P. Seldin
2017 J jnl
The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II.
Theor. Comput. Sci.
Jonathan P. Seldin
2016 J jnl
Bridging Curry and Church's typing style.
J. Appl. Log.
Fairouz Kamareddine, Jonathan P. Seldin, J. B. Wells
2011 J jnl
Curry's Formalism as Structuralism.
Logica Universalis
Jonathan P. Seldin
2011 J jnl
The search for a reduction in combinatory logic equivalent to λβ-reduction.
Theor. Comput. Sci.
Jonathan P. Seldin
2009 — ch.
The Logic of Church and Curry.
Logic from Russell to Church
Jonathan P. Seldin
2004 J jnl
Interpreting HOL in the calculus of constructions.
J. Appl. Log.
Jonathan P. Seldin
2004 J jnl
Variants of the basic calculus of constructions.
J. Appl. Log.
Martin W. Bunder, Jonathan P. Seldin
2001 J jnl
Extensional Set Equality in the Calculus of Constructions.
J. Log. Comput.
Jonathan P. Seldin
2000 J jnl
A Gentzen-style sequent calculus of constructions with expansion rules.
Theor. Comput. Sci.
Jonathan P. Seldin
2000 J jnl
On The Role of Implication in Formal Logic.
J. Symb. Log.
Jonathan P. Seldin
2000 J jnl
On lists and other abstract data types in the calculus of constructions.
Math. Struct. Comput. Sci.
Jonathan P. Seldin
1999 J jnl
Preface.
Math. Struct. Comput. Sci.
Mariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin
1997 J jnl
On the Proof Theory of Coquand's Calculus of Constructions.
Ann. Pure Appl. Log.
Jonathan P. Seldin
1992 J jnl
Coquand's Calculus of Constructions: A Mathematical Foundation for a Proof Development System.
Formal Aspects Comput.
Jonathan P. Seldin
1989 J jnl
Normalization and excluded middle. I.
Stud Logica
Jonathan P. Seldin
1989 J jnl
On Adding (xi) to Weak Equality in Combinatory Logic.
J. Symb. Log.
Martin W. Bunder, J. Roger Hindley, Jonathan P. Seldin
1986 — book
Introduction to Combinators and Lambda-Calculus.
J. Roger Hindley, Jonathan P. Seldin
1986 J jnl
On the Proof Theory of the Intermediate Logic MH.
J. Symb. Log.
Jonathan P. Seldin
1980 J jnl
A second corrigendum to my paper: "Note on definitional reductions".
Notre Dame J. Formal Log.
Jonathan P. Seldin
1978 J jnl
A Sequent Calculus Formulation of Type Assignment with Equality Rules for the lambda beta-Calculus.
J. Symb. Log.
Jonathan P. Seldin
1978 J jnl
Some Anomalies in Fitch's System QD.
J. Symb. Log.
Martin W. Bunder, Jonathan P. Seldin
1977 J jnl
A Sequent Calculus for Type Assignment.
J. Symb. Log.
Jonathan P. Seldin
1977 J jnl
The Q-consistency of
Notre Dame J. Formal Log.
Jonathan P. Seldin
1975 J jnl
Arithmetic as a study of formal systems.
Notre Dame J. Formal Log.
Jonathan P. Seldin
1973 J jnl
Equality in F
J. Symb. Log.
Jonathan P. Seldin
1972 — book
Introduction to combinatory logic.
J. Roger Hindley, Rasmus Lerdorf, Jonathan P. Seldin
1969 J jnl
Corrigendum to my paper: "Note on definitional reductions".
Notre Dame J. Formal Log.
Jonathan P. Seldin
1968 J jnl
Note on definitional reductions.
Notre Dame J. Formal Log.
Jonathan P. Seldin