<--- Back to Details
First PageDocument Content
Formal methods / Philosophy of mathematics / Theoretical computer science / Mathematical proof / Formal verification / Theorem / Richard J. Lipton / Algorithm / Mathematical beauty / Mathematics / Logic / Mathematical logic
Date: 2008-09-16 22:24:39
Formal methods
Philosophy of mathematics
Theoretical computer science
Mathematical proof
Formal verification
Theorem
Richard J. Lipton
Algorithm
Mathematical beauty
Mathematics
Logic
Mathematical logic

Add to Reading List

Source URL: www.csee.umbc.edu

Download Document from Source Website

File Size: 1,06 MB

Share Document on Facebook

Similar Documents

Theoretical computer science / Formal methods / Mathematical logic / Logic in computer science / Mathematics / Constraint programming / Automated theorem proving / Satisfiability modulo theories / Formal verification / Type theory / First-order logic / Vampire

Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https://cedeela.fr/~simon/ August 2017

DocID: 1xVS8 - View Document

Mathematical logic / Logic / Mathematics / Model theory / Automated theorem proving / Predicate logic / Semantics / Logic programming / Resolution / First-order logic / Skolem normal form / Substitution

Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California

DocID: 1xVHV - View Document

Spectral theory / Hermann Minkowski / Minkowski's second theorem / Operator theory / Mathematics / Dissipative operator

A proof of Minkowski’s second theorem Matthew Tointon Minkowski’s second theorem is a fundamental result from the geometry of numbers with important applications in additive combinatorics (see, for example, its appli

DocID: 1xVE5 - View Document

Theoretical computer science / Logic / Formal methods / Mathematical logic / Model theory / Interpretation / Logic in computer science / Propositional calculus / Boolean satisfiability problem / Automated theorem proving / Propositional variable / IP

Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2

DocID: 1xVDI - View Document

Mathematics / Mathematical analysis / Abstract algebra / Sheaf theory / Divisor / D-module / Extreme value theorem / Commutative algebra / Algebraic geometry / Morphism of algebraic varieties / Dimension theory

A BOUNDEDNESS THEOREM FOR NEARBY SLOPES OF HOLONOMIC D-MODULES by Jean-Baptiste Teyssier Abstract. — Using twisted nearby cycles, we define a new notion of slopes for complex holonomic D-modules. We prove a boundednes

DocID: 1xVAt - View Document