List Question
20 TechQA 2024-02-06T18:18:00.813000I need help to finish a proof in Lean 4, Well Ordering Principle implies Axiom of Choice
53 views
Asked by Santiago Mourenza Rivero
How can I prove dependent function types equal in Agda?
45 views
Asked by Sam_W
Which automated theorem provers can output proofs in natural language?
79 views
Asked by Julien Narboux
Transforming arithmetic expressions into lists of polynomial coefficients in Isabelle. Can't prove algorithm for expressions with multiplication
109 views
Asked by curiousCprogrammer1231
Schematic variables as functions in isabelle?
43 views
Asked by curiousCprogrammer1231
Installing Z3 binding with haskell on mac
254 views
Asked by RunTimeError31415
Proving Equivalence with Subtraction
72 views
Asked by redjamjar
Unification when multiple copies of a formula are needed
21 views
Asked by Salman
Programming in the Calculus of Inductive Constructions with Coq
60 views
Asked by yiyuan-cao
What's the role of unification in Coq's core type system?
122 views
Asked by yiyuan-cao
(Z3Py) Using all_smt to generate all solutions of a model
129 views
Asked by My other car is a cadr
Proving Transitivity of Pointwise Relations on Lists in Coq
58 views
Asked by Benjamin Flin
Non-trivial Fixpoint on nested recursive types
88 views
Asked by shooqie
What is the function associated with seq.map in C API of z3?
71 views
Asked by arshiamoeini
Option that is some, let and case of cause rewriter not to simplify
73 views
Asked by bobismijnnaam
Instantiate typeclass over type_synonym
58 views
Asked by bobismijnnaam
Recursive function leads to simplifier loop in Isabelle
67 views
Asked by bobismijnnaam
Clarification on \forall in Lean4
308 views
Asked by Ollie Henry
How to formally verify a compiler (frontend and/or backend)?
256 views
Asked by anurag