Abstract
NaDSyL, a Natural Deduction based Symbolic Logic, and some of its applications are briefly described. The semantics of NaDSyL is based on the term models of the lambda calculus and is motivated by the belief that a confusion of use and mention is the source of the paradoxes. Proofs of the soundness, completeness and the eliminability of cut are sketched along with three applications: The foundations for recursive definitions of well-founded and non-well founded predicates, classical and intuitionistic second order arithmetic, and a study of Cantor's diagonal argument and paradox.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jamie Andrews. Logic Programming: Operational Semantics and Proof Theory. Cambridge University Press Distinguished Dissertation Series, 1992.
H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. Revised Edition, North-Holland, 1984.
E.W. Beth. Semantic Entailment and Formal Derivability, Mededelingen de Koninklijke Nederlandse Akademie der Wetenschappen, Afdeeling Letterkunde, Nieuwe Reeks, 18(13):309–342, 1955.
Alonzo Church. The Calculi of Lambda Conversion. Princeton University Press, 1941.
Alonzo Church. Introduction to Mathematical Logic I. Princeton University Press, 1956.
Joseph Warren Dauben, Georg Cantor, His Mathematics and Philosphy of the Infinite. Harvard University Press, 1979.
Paul C. Gilmore. A Consistent Naive Set Theory: Foundations for a Formal Theory of Computation, IBM Research Report RC 3413, June 22, 1971.
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.
Paul C. Gilmore. Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes, Journal of Symbolic Logic, 51:393–411, 1986.
Paul C. Gilmore. Soundness and Cut-Elimination for NaDSyL. Dept. of Computer Science Technical Report TR97-1, 27 pages.
Paul C. Gilmore. A Symbolic Logic and Some Applications. A monograph on NaDSyL in preparation.
Paul C. Gilmore and George K. Tsiknis. A logic for category theory, Theoretical Computer Science, 111:211–252, 1993.
Paul C. Gilmore and George K. Tsiknis. Logical Foundations for Programming Semantics, Theoretical Computer Science, 111:253–290, 1993.
Leon Henkin. Completeness in the Theory of Types, J. Symbolic Logic, 15:81–91, 1950.
Saul Kripke. Outline of a Theory of Truth, Journal of Philosophy, November 6, 690–716, 1975.
Gopalan Nadathur and Dale Miller. Higher-Order Logic Programming, CS-1994-38, Dept of Computer Science, Duke University, 1994.
Dag Prawitz. Completeness and Hauptsatz for second order logic, Theoria, 33:246–258, 1967.
Wilfred Sellars. Abstract Entities, Rev. of Metaphysics, 16:625–671, 1963.
Wilfred Sellars. Classes as Abstract Entities and the Russell Paradox, Rev. of Metaphysics, 17:67–90, 1963
J.E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilmore, P.C. (1997). NaDSyL and some applications. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_40
Download citation
DOI: https://doi.org/10.1007/3-540-63385-5_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63385-3
Online ISBN: 978-3-540-69806-7
eBook Packages: Springer Book Archive