TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
A | |
algebraic number theory | |
annotating proofs | |
ar5iv | |
Archive of Formal Proofs | |
argument graph | |
argument mapping | |
arXiv | |
Automated Configuration | |
Automated conjecturing | |
automated reasoning | |
automated software verification | |
Automating Formalization | |
B | |
belief set | |
Branch Cuts | |
C | |
Centrality metrics | |
Change of variables | |
client-server architecture | |
Closure Algebras | |
Compactness Theorem | |
complex analysis | |
Complex networks | |
computational logic | |
computer aided teaching | |
confidential computing | |
Configuration Invention | |
continuum hypothesis | |
controlled language | |
controlled natural language | |
Convex Optimisation | |
D | |
Dataset | |
Decomposition rules | |
Dependency graphs | |
Dependent types | |
E | |
extremal combinatorics | |
F | |
FAIR | |
Finite Automata | |
first-order theorem proving | |
Formal entity network | |
formal math | |
formal mathematics | |
Formal Methods | |
formal specification and verification | |
Formal Specifications | |
formal verification | |
Formalisation | |
formalisation of mathematics | |
formalization | |
Formalization quality | |
G | |
Galois groups | |
generalized set theory | |
Graded rings | |
Graph Rewriting | |
graphs | |
H | |
Hall's Theorem | |
Heat equation | |
Higher-Order Logic | |
HOL Light | |
Hybrid reasoning | |
Hybrid Systems | |
I | |
Incremental Reasoning | |
induction | |
Informal Mathematics | |
Integral | |
Interactive Theorem Proving | |
Inverse functions | |
Isabelle | |
Isabelle/HOL | |
K | |
knowledge management services | |
knowledge organization | |
L | |
Lambda-Calculus | |
lattice | |
Lean | |
Lean theorem prover | |
Logic education | |
M | |
Machine Learning | |
Machine Translation | |
machine-actionable | |
markdown | |
MathDataHub | |
Mathematical documents | |
Mathematical Knowledge Management | |
Mathematical langauge processing | |
mathlib | |
metamath | |
Mizar Mathematical Library | |
MMT | |
N | |
Naproche | |
Nominal AC-Unification | |
O | |
OEIS | |
P | |
Parallel Corpus | |
Partial Differential Equations | |
Paul Erdős | |
proof graph | |
proof-generating machine | |
ProVerif | |
PVS | |
Python | |
Q | |
QBF | |
QED manifesto | |
QSAT | |
Quantified Boolean Formulas | |
quantifier elimination | |
Query answering | |
R | |
Real Algebra | |
real arithmetic | |
realm | |
remote attestation | |
S | |
Satisfiability checking | |
Satisfiability Modulo Theories | |
Scholarly HTML5 | |
semantic data | |
Semantification | |
Separation of Variables | |
set theory | |
Simple Type Theory | |
Simplification Rules | |
SMT solving | |
soft types | |
Solution Counting | |
Sophize | |
Sperner | |
sTeX | |
Strategies | |
study aids | |
superposition-based proving | |
Surface Language | |
symbolic security analysis | |
System On TPTP | |
T | |
Tetrapod | |
TeX | |
Text summarization | |
Theorem Proving | |
Theorema | |
Theory Exploration | |
topology | |
typeclasses | |
U | |
understanding proofs | |
User Experience | |
User Interface | |
W | |
Web service | |
webinterface |