Paul C. Gilmore

17 papers A 1B 1Journal 12Unranked 3
YearRankTypeTitle / Venue / Authors
2001 J jnl
An Intensional Type Theory: Motivation and Cut-Elimination.
J. Symb. Log.
Paul C. Gilmore
1999 B conf
Partial Functions in an Impredicative Simple Theory of Types.
TABLEAUX
Paul C. Gilmore
1997 — conf
NaDSyL and some Applications.
Kurt Gödel Colloquium
Paul C. Gilmore
1995 J jnl
An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima.
SIAM J. Optim.
Paul C. Gilmore, Carl T. Kelley
1993 J jnl
A Logic for Category Theory.
Theor. Comput. Sci.
Paul C. Gilmore, George K. Tsiknis
1993 — conf
A Syntactic Consistency Proof for NaDSet.
Kurt Gödel Colloquium
Paul C. Gilmore
1993 J jnl
Logical Foundations for Programming Semantics.
Theor. Comput. Sci.
Paul C. Gilmore, George K. Tsiknis
1987 A conf
A Foundation for the Entity Relationship Approach: How and Why.
ER
Paul C. Gilmore
1986 J jnl
Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes.
J. Symb. Log.
Paul C. Gilmore
1981 J jnl
A Discipline in Crisis.
Commun. ACM
Peter J. Denning, Edward A. Feigenbaum, Paul C. Gilmore, Anthony C. Hearn, Robert W. Ritchie, Joseph F. Traub
1975 J jnl
Meeting of the Association for Symbolic Logic.
J. Symb. Log.
Paul C. Gilmore, Donald A. Martin, Elliott Mendelson
1970 J jnl
An Examination of the Geometry Theorem Machine.
Artif. Intell.
Paul C. Gilmore
1970 J jnl
The lambda-gamma calculus: A language adequate for defining recursive functions.
Inf. Sci.
Paul C. Gilmore
1962 J jnl
Some Forms of Completeness.
J. Symb. Log.
Paul C. Gilmore
1960 J jnl
A Proof Method for Quantification Theory: Its Justification and Realization.
IBM J. Res. Dev.
Paul C. Gilmore
1960 J jnl
Quantificational logic.
Inf. Control.
Paul C. Gilmore
1959 — conf
A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus.
IFIP Congress
Paul C. Gilmore