NaDSyL and some applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1289, Issue , 1997, Pages 153-166

  Gilmore, Paul C ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); SEMANTICS;

ITS APPLICATIONS; LAMBDA CALCULUS; NATURAL DEDUCTION; RECURSIVE DEFINITIONS; SECOND ORDER ARITHMETICS; SYMBOLIC LOGIC;

LOGIC PROGRAMMING;

EID: 84947912111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63385-5_40     Document Type: Conference Paper

References (20)

1. Jamie Andrews. Logic Programming: Operational Semantics and Proof Theory. Cambridge University Press Distinguished Dissertation Series, 1992.
2. H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. Revised Edition, North-Holland, 1984.
3. E.W. Beth. Semantic Entailment and Formal Derivability, Mededelingen de Koninklijke Nederlandse Akademie der Wetenschappen, Afdeeling Letterkunde, Nieuwe Reeks, 18(13):309-342, 1955.
4. Alonzo Church. The Calculi of Lambda Conversion. Princeton University Press, 1941.
5. Alonzo Church. Introduction to Mathematical Logic I. Princeton University Press, 1956.
6. Joseph Warren Dauben, Georg Cantor, His Mathematics and Philosphy of the Infinite. Harvard University Press, 1979.
7. Paul C. Gilmore. A Consistent Naive Set Theory: Foundations for a Formal Theory of Computation, IBM Research Report RC 3413, June 22, 1971.
8. Paul C. Gilmore. Combining Unrestricted Abstraction with Universal Quantification. A revised version of [7], To H.B. Curry: Essays on Combinatorial Logic, Lambda Calculus and Formalism, Editors J.P. Seldin, J.R. Hindley, Academic Press, 99-123, 1980.
9. Paul C. Gilmore. Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes, Journal of Symbolic Logic, 51:393-411, 1986.
10. Paul C. Gilmore. Soundness and Cut-Elimination for NaDSyL. Dept, of Computer Science Technical Report TR97-1, 27 pages.
11. Paul C. Gilmore, A Symbolic Logic and Some Applications. A monograph on NaDSyL in preparation.
12. Paul C. Gilmore and George K. Tsiknis. A logic for category theory, Theoretical Computer Science, 111:211-252, 1993.
13. Paul C. Gilmore and George K. Tsiknis. Logical Foundations for Programming Semantics, Theoretical Computer Science, 111:253-290, 1993.
14. Leon Henkin. Completeness in the Theory of Types, J. Symbolic Logic, 15:81-91, 1950.
15. Saul Kripke. Outline of a Theory of Truth, Journal of Philosophy, November 6, 690-716, 1975.
16. Gopalan Nadathur and Dale Miller, Higher-Order Logic Programming, CS-1994-38, Dept of Computer Science, Duke University, 1994.
17. Dag Prawitz. Completeness and Hauptsatz for second order logic, Theoria, 33:246-258, 1967.
18. Wilfred Sellars. Abstract Entities, Rev. of Metaphysics, 16:625-671, 1963.
19. Wilfred Sellars. Classes as Abstract Entities and the Russell Paradox, Rev. of Metaphysics, 17:67-90, 1963
20. J.E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.