A01=Paul C. Gilmore
Author_Paul C. Gilmore
Cantor's Diagonal Argument
Cantor’s Diagonal Argument
Category=PBCD
Choice Term
Completeness Theorem
Denotational Semantics
Derivable Sequent
Descending Chain
Domain Constructors
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
formal semantics
Free Occurrence
Higher Order Logics
Induction Assumption
Infinite Descending Chain
Infix Notation
intensional logic
intensional type theory applications
intuitionistic mathematics
mathematical foundations
Natural Numbers
Peano's Axioms
Peano’s Axioms
predicate logic
Predicate Term
Predicate Type
Proof Theory
Recursion Generator
recursion theory
Recursive Predicates
Secondary Type
Semantic Tree
Sequent Calculus
Set Theory ZFC
Type Expression
Variable Cv
Product details
- ISBN 9781568812762
- Weight: 360g
- Dimensions: 152 x 229mm
- Publication Date: 18 Nov 2005
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
Logicism, as put forward by Bertrand Russell, was predicated on a belief that all of mathematics can be deduced from a very small number of fundamental logical principles. In Logicism Renewed, the author revisits this concept in light of advances in mathematical logic and the need for languages that can be understood by both humans and computers that require distinguishing between the intension and extension of predicates. Using Intensional Type Theory (ITT) the author provides a unified foundation for mathematics and computer science, yielding a much simpler foundation for recursion theory and the semantics of computer programs than that currently provided by category theory.
Paul Gilmore is professor emeritus in the Computer Science department at the University of British Columbia. His research interests include Logical Foundations of Mathematics and Computer Science, Applications of Logic in Computer Science, and Databases.
