Paul C. Gilmore

According to our database, Paul C. Gilmore authored at least 17 papers between 1959 and 2001.

Collaborative distances:

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

2001

An Intensional Type Theory: Motivation and Cut-Elimination.

Paul C. Gilmore

J. Symb. Log., 2001

1999

Partial Functions in an Impredicative Simple Theory of Types.

Paul C. Gilmore

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

1997

NaDSyL and some Applications.

Paul C. Gilmore

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1995

An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima.

Paul C. Gilmore, Carl T. Kelley

SIAM J. Optim., 1995

1993

Logical Foundations for Programming Semantics.

Paul C. Gilmore, George K. Tsiknis

Theor. Comput. Sci., 1993

A Logic for Category Theory.

Paul C. Gilmore, George K. Tsiknis

Theor. Comput. Sci., 1993

A Syntactic Consistency Proof for NaDSet.

Paul C. Gilmore

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1987

A Foundation for the Entity Relationship Approach: How and Why.

Paul C. Gilmore

Proceedings of the Entity-Relationship Approach, 1987

1986

Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes.

Paul C. Gilmore

J. Symb. Log., 1986

1981

A Discipline in Crisis.

Peter J. Denning, Edward A. Feigenbaum, Paul C. Gilmore, Anthony C. Hearn, Robert W. Ritchie, Joseph F. Traub

Commun. ACM, 1981

1975

Meeting of the Association for Symbolic Logic.

Paul C. Gilmore, Donald A. Martin, Elliott Mendelson

J. Symb. Log., 1975

1970

The lambda-gamma calculus: A language adequate for defining recursive functions.

Paul C. Gilmore

Inf. Sci., 1970

An Examination of the Geometry Theorem Machine.

Paul C. Gilmore

Artif. Intell., 1970

1962

Some Forms of Completeness.

Paul C. Gilmore

J. Symb. Log., 1962

1960

Quantificational logic.

Paul C. Gilmore

Inf. Control., June, 1960

A Proof Method for Quantification Theory: Its Justification and Realization.

Paul C. Gilmore

IBM J. Res. Dev., 1960

1959

A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus.

Paul C. Gilmore

Proceedings of the Information Processing, 1959