| 2001 |
|---|
| 13 | | Paul C. Gilmore:
An Intensional Type Theory: Motivation and Cut-Elimination.
J. Symb. Log. 66(1): 383-400 (2001) |
| 1999 |
|---|
| 12 | | Paul C. Gilmore:
Partial Functions in an Impredicative Simple Theory of Types.
TABLEAUX 1999: 186-201 |
| 1997 |
|---|
| 11 | | Paul C. Gilmore:
NaDSyL and some Applications.
Kurt Gödel Colloquium 1997: 153-166 |
| 1993 |
|---|
| 10 | | Paul C. Gilmore:
A Syntactic Consistency Proof for NaDSet.
Kurt Gödel Colloquium 1993: 190-201 |
| 9 | | Paul C. Gilmore,
George K. Tsiknis:
A Logic for Category Theory.
Theor. Comput. Sci. 111(1&2): 211-252 (1993) |
| 8 | | Paul C. Gilmore,
George K. Tsiknis:
Logical Foundations for Programming Semantics.
Theor. Comput. Sci. 111(1&2): 253-290 (1993) |
| 1987 |
|---|
| 7 | EE | Paul C. Gilmore:
A Foundation for the Entity Relationship Approach: How and Why.
ER 1987: 95-113 |
| 1986 |
|---|
| 6 | | Paul C. Gilmore:
Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes.
J. Symb. Log. 51(2): 393-411 (1986) |
| 1981 |
|---|
| 5 | | Peter J. Denning,
Edward A. Feigenbaum,
Paul C. Gilmore,
Anthony C. Hearn,
Robert W. Ritchie,
J. F. Traub:
A Discipline in Crisis.
Commun. ACM 24(6): 370-374 (1981) |
| 1975 |
|---|
| 4 | | Paul C. Gilmore,
Donald A. Martin,
Elliott Mendelson:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 40(2): 299-304 (1975) |
| 1970 |
|---|
| 3 | | Paul C. Gilmore:
An Examination of the Geometry Theorem Machine.
Artif. Intell. 1(3): 171-187 (1970) |
| 1962 |
|---|
| 2 | | Paul C. Gilmore:
Some Forms of Completeness.
J. Symb. Log. 27(3): 344-352 (1962) |
| 1959 |
|---|
| 1 | | Paul C. Gilmore:
A program for the production from axioms, of proofs for theorems derivable within the first order predicate calculus.
IFIP Congress 1959: 265-272 |
