Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–82) PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS Ulrich Kohlenbach

Source URL: eta.impa.br

• Mathematics
• Structure
• Abstraction
• Computability theory
• Metric geometry
• Topology
• Proof theory
• Primitive recursive function
• Theory of computation
• Mathematical logic
• Metric space
• Proof mining

2012 Spring CHMMC Power Round In this round you will develop a proof of a number theoretic fact through mostly geometrical methods. For this part of the contest, you must fully justify all of your answers unless otherwis

Source URL: chmmc.caltech.edu

Puzzle 1 Condylarth Puzzle 23 July 2006 Abstract We present a new topological proof of Fermat’s Last Theorem. Our methods involve the

Source URL: mathcamp.org

Oracle Complexity of Second-Order Methods for Finite-Sum Problems A. Proofs A.1. Auxiliary Lemmas The following lemma was essentially proven in (Lan, 2015; Nesterov, 2013), but we provide a proof for completeness: Lemma

Source URL: proceedings.mlr.press

Fields Medal Ngô Bao Châu Citation: “For his proof of the Fundamental Lemma in the theory of automorphic forms through the introduction of new algebro-geometric methods.” Ngô Bao Châu removed one of the great imp

Source URL: www.icm2010.in

• Mathematics
• Automorphic forms
• Langlands program
• Conjectures
• Representation theory of Lie groups
• Fields Medalists
• Ng Bo Chu
• Fundamental lemma
• Grard Laumon
• Fundamental theorem
• Fields Medal
• Richard Taylor

User Interaction with the Matita Proof Assistant Andrea Asperti (), Claudio Sacerdoti Coen (), Enrico Tassi () and Stefano Zacchiroli () Departm

Source URL: matita.cs.unibo.it

• Automated theorem proving
• Software
• Theoretical computer science
• Proof assistants
• Functional languages
• Type theory
• Matita
• Formal methods
• Calculus of constructions
• Mathematical proof
• Automated reasoning
• Theorem

Learning from an expert’s proof AI4FM Leo Freitas and Cliff B Jones School of Computing Science, Newcastle University, UK, {leo.freitas, cliff.jones}@ncl.ac.uk Abstract

Source URL: fm.csl.sri.com

• Automated theorem proving
• Theoretical computer science
• Logic
• Mathematics
• Mathematical proofs
• Proof assistants
• Formal methods
• Formal verification
• KeY
• Isabelle
• Rippling
• Automated reasoning

Jeremy Avigad PERSONAL DATA Born January 9, 1968, New York, N.Y. Citizenship: USA. ADDRESS Department of Philosophy Carnegie Mellon University

Source URL: www.andrew.cmu.edu

• Logic
• Mathematics
• Philosophy
• Logic in computer science
• Automated theorem proving
• Formal sciences
• Formal methods
• Mathematical logic
• Proof theory
• Automated reasoning
• Formal epistemology
• Foundations of mathematics

A Note on Boundary Constraints for Linear Variational Surface Design Andrew Nealen TU Berlin Abstract This note presents a proof for the subspace property of linear variational methods for fair surface design. Specifical

Source URL: igl.ethz.ch

• Algebra
• Mathematics
• Matrices
• Linear algebra
• Algebraic graph theory
• Operator theory
• Functional analysis
• Laplacian matrix
• Matrix
• Linear subspace
• Collinearity

LEO-II and Satallax on the Sledgehammer Test Bench Nik Sultanaa,∗, Jasmin Christian Blanchetteb , Lawrence C. Paulsona a Computer b Institut Laboratory, University of Cambridge, United Kingdom

Source URL: people.mpi-inf.mpg.de

• Theoretical computer science
• Mathematical logic
• Logic in computer science
• Automated theorem proving
• Proof assistants
• Formal methods
• Type theory
• Isabelle
• First-order logic
• Logic for Computable Functions
• Unification
• HOL