Amanote Research
Register
Sign In
Theorem Proving in Higher Order Logics
Lecture Notes in Computer Science
- Germany
doi 10.1007/b100400
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Science
Theoretical Computer Science
Date
January 1, 2004
Authors
Unknown
Publisher
Springer Berlin Heidelberg
Related search
Resolution-Based Theorem Proving for Many-Valued Logics
Journal of Symbolic Computation
Computational Mathematics
Number Theory
Algebra
Comparing Unification Algorithms in First-Order Theorem Proving
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Mechanizing Programming Logics in Higher Order Logic
Cryptographically Sound Theorem Proving
A Splitting Theorem for Higher Order Parallel Immersions
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
Generalized Rolewicz Theorem for Convexity of Higher Order
Mathematical Inequalities and Applications
Mathematics
Applied Mathematics
Mechanical Theorem Proving in Tarski’s Geometry
A Generalization of Nash's Theorem With Higher-Order Functionals
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Mathematics
Engineering
Astronomy
Physics
Fuzzy Transforms of Higher Order Approximate Derivatives: A Theorem
Fuzzy Sets and Systems
Artificial Intelligence
Logic
