Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 2 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

2 results

Clear filters
Project-declaredLean 4.32.1

Church theorem general

LO.FirstOrder.Arithmetic.church_theorem_general

Project documentation

Church's theorem, for an arbitrary arithmetic theory T ⊇ 𝗥₀ sound on 𝚺₁ sentences: the set of T-provable sentences is not computable.

formal logicmetatheoryproof theory

Source project: Foundation

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.1

Undecidability first order logic

LO.FirstOrder.Arithmetic.undecidability_first_order_logic

Project documentation

Church's theorem: the set of (purely logically, i.e. -)provable sentences is not computable.

formal logicmetatheoryproof theory

Source project: Foundation

Person-level attribution pending.

View proof record