Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Mathematical Logic

78 missions · 48 completed

Missions

Open30Completed48All78
🏆Completed
Category TheoryFormal VerificationLogic+3·Captain: Alien60

Barrett–Halvorson 2016: Morita Equivalence Implies Categorical EquivalenceResearch Paper

When are two scientific theories "the same theory in different words"? Philosophers of science have used two formal criteria. Definitional equivalence (Glymour) is strict: it requires a common definitional extension and therefore cannot relate theories with different numbers of sorts. Categorical equivalence (Halvorson, Weatherall) is liberal: it asks only…

20 thms1 active userReviewed
AnalysisOptimization·Captain: mikedeng1

Clarke Subgradients of Stratifiable Functions II: The Nonsmooth Kurdyka–Łojasiewicz Inequality for Lower Semicontinuous Functions Definable in an O-minimal StructureResearch Paper

The Kurdyka–Łojasiewicz (KL) inequality is the analytic engine behind most global convergence proofs for descent methods on nonconvex problems: proximal point and proximal gradient schemes, alternating minimization, ADMM variants and subgradient flows all reach a critical point with finite trajectory length once the objective satisfies a KL inequality. Its…

7 thms1 active userReviewed
🏆Completed
Theoretical Computer Science·Captain: tomasz

Friedberg–Muchnik: incomparable computably enumerable setsResearch Paper

Computability theory studies which questions admit algorithms and how the unsolvable questions compare with one another. A decision problem can be represented by a set of natural numbers: the question on input nnn is whether nnn belongs to the set. Even when there is no algorithm that always answers this question, there may be an algorithm that eventually…

11 thms1 active userReviewed
PreviousPage 4 of 4Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me