José A. Alonso
Why not just use Lean?. ~ Lawrence Paulson. https://lawrencecpaulson.github.io//2026/04/23/Why_not_Lean.html #ITP #Nqthm #HOL #CoqProver #IsabelleHOL #LeanProver #AI4Math
Achim D. BruckerWant to learn more about the latest developments on using AI and (interactive) theorem proving in Mathematics? Wait no longer!
We have a great line-up of speakers at our online Workshop on AI and Theorem Provers in Mathematics. The workshop will be held online from 8th to 10th of April and attendance is free (registration required). For more details, visit the workshop website: https://aitpm.github.io/
#math #itp #theoremProving #isabelleHOL #lean #llm #ai #formal_mehods #agda #hol #mathematics
O SlovenskuV sobotu policisté řešili nevídaný případ. Jeli za holčičkou, kterou zpozoroval náhodný obyvatel Ústí nad Labem na sídlišti, samotnou, v bačkůrkách a oblečenou v pyžamu! Ztracená dívka údajně jela za svou kamarádkou ze školky, když maminka doma usnula. Policisté se o ni postarali a příběh měl šťastný konec.
Osamělá holčička v pyžámku a bačkůrkách na sídlišti v Ústí: Chtěla za kamarádkou ze školky
V sobotu policisté řešili nevídaný případ. Jeli za holčičkou, kterou zpozoroval náhodný obyvatel Ústí nad Labem na sídlišti, samotnou, v bačkůrkách a oblečenou v pyžamu! Ztracená dívka údajně jela za svou kamarádkou ze školky, když maminka doma usnula. Policisté se o ni postarali a příběh měl šťastný konec.
Lazarou Monkey Terror 🚀💙🌈"Oh please let me keep the Peerage, I'll make it worth your while......"
"OK Peter, because we love you."
#Labour #PeterMandelson #UKPOL #UKPOLITICS #HouseOfLords #HoL
Go all the way and make it an elected 2nd house. But not shit like the American one, obvs....there are other countries in the World...
#UKPOL #UKPOLITICS #HoL #KeirStarmer #Labour #Starmer #Tories #PeterMandelson #Epstein #JeffreyEpstein #ClanOfPaedophiles #HouseOfLords
Hey British democracy fans, this is what will happen if the Lords aren't reformed sharpish.....so this is what WILL happen as Labour fails....
#UKPOL #UKPOLITICS #HoL #Democracy #ReformUK #ClanOfPaedophiles
🇳🇴 von Hol, Richtung Vossestrand
terrorist :: Feline**Theorem proving with the real numbers**
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-408.html
by John Robert Harrison
November 1996
The author used #HOL to formalise real numbers, including metric, sequences and limits, continuity and differentiation, power series and transcendental functions, integration.
There is also a #CAS and IEEE floating standard verification tools.
HoldMyTypeWhy a Digital Clock is Decidable
Finite State System: A digital clock has a finite, albeit large, number of possible states . A typical clock tracks seconds (0-59), minutes (0-59), hours (0-23 or 1-12 with AM/PM), and potentially date information. The total number of unique configurations (states) is finite. Systems with a finite number of states are generally decidable [3].
Deterministic Behavior: The clock's transitions between states are predictable and governed by fixed rules (e.g., after 59 seconds, the seconds reset to 0, and the minutes increment by 1) . This determinism allows for predictable analysis of its behavior.
Programmatic verification of a digital clock typically involves treating it as a finite state machine (FSM) or using formal verification techniques Modeling as a Finite State Machine /Model Checking
Theorem Proving: Use interactive theorem provers (e.g., #Coq, #Isabelle / #HOL) to mathematically prove the clock's implementation adheres to its formal specification
#academia folks need be motivated and paid for this and by them I mean anyone , who can do it , which means many people who couldn't pursue , this need be a #udemy course
Finite State System: A digital clock has a finite, albeit large, number of possible states . A typical clock tracks seconds (0-59), minutes (0-59), hours (0-23 or 1-12 with AM/PM), and potentially date information. The total number of unique configurations (states) is finite. Systems with a finite number of states are generally decidable [3].
Deterministic Behavior: The clock's transitions between states are predictable and governed by fixed rules (e.g., after 59 seconds, the seconds reset to 0, and the minutes increment by 1) . This determinism allows for predictable analysis of its behavior.
Programmatic verification of a digital clock typically involves treating it as a finite state machine (FSM) or using formal verification techniques Modeling as a Finite State Machine /Model Checking
Theorem Proving: Use interactive theorem provers (e.g., #Coq, #Isabelle / #HOL) to mathematically prove the clock's implementation adheres to its formal specification
#academia folks need be motivated and paid for this and by them I mean anyone , who can do it , which means many people who couldn't pursue , this need be a #udemy course