StackOverflow Questions for Tag: hol

g_d

Reputation: 707

Theorem that finding in a list works properly

coqhol

Score: 0

Answers: 2

user206904

Reputation: 550

proving Predicate logic with Isabelle

predicateisabelleproofhol

Score: 0

Answers: 1

notooth

Reputation: 31

How to get ML values from HOL?

isabellemlhol

Score: 2

Answers: 1

Q.Yang

Reputation: 173

How to use OpenTheory to transfer theorems in HOL-light format to theorems in Isabelle format

isabellehol

Score: 1

Answers: 0

Lorenz Leutgeb

Reputation: 504

Automatic translation from Isabelle/HOL to HOL

isabellehol

Score: 6

Answers: 1

Charlie Parker

Reputation: 5267

Why can't we do case analysis on inductively defined predicates directly when doing rule inversion?

isabelletheorem-provinghol

Score: 0

Answers: 2

Charlie Parker

Reputation: 5267

How can we force Isabelle to reveal to us what rule it's applying in the background in Isar when a proof starts?

isabelletheorem-provinghol

Score: 2

Answers: 1

Charlie Parker

Reputation: 5267

Why can't I make my cases explicit in Isabelle when the proof is already complete but gives a "fails to refine any pending goal" error?

isabelletheorem-provinghol

Score: 2

Answers: 1

Gergely

Reputation: 7545

Is it possible to write non-automatic formalizations in Isar?

isabelleproofisarhol

Score: 1

Answers: 1

Charlie Parker

Reputation: 5267

How does one define a if then else expression in Isabelle?

functional-programmingisabelletheorem-provinghol

Score: 1

Answers: 2

Simon Diemert

Reputation: 330

View Proof Steps From Tactic Application

smltheorem-provinghol

Score: 2

Answers: 0

Babado

Reputation: 135

Isabelle: verify tautological formula

isabellehol

Score: 1

Answers: 1

Imperishable Night

Reputation: 1533

Isabelle/HOL/Isar: How do I make formulas like "∃(x::nat). (x ≠ 2 ∧ (x ≠ 2 ⟶ x = 1))" easier to prove?

isabelleisarhol

Score: 0

Answers: 0

Gergely

Reputation: 7545

Prove a goal with an assumption in HOL

theorem-provinghol

Score: 2

Answers: 1

Tuffie

Reputation: 71

HOL Theorem Prover: Adding to existing theory

hol

Score: 0

Answers: 1

hackerCMU

Reputation: 13

Translating from HOL interpreter to TAC_PROOF with THENL

smltheorem-provinghol

Score: 1

Answers: 1

Tuffie

Reputation: 71

Theorem proving from first principles using SML with HOL inference rules

smltheorem-provinghol

Score: 2

Answers: 1

Tuffie

Reputation: 71

Exception on ACCEPT_TAC after THEN in HOL

smltheorem-provinghol

Score: 2

Answers: 1

PreviousPage 2Next

StackOverflow Questions for Tag: hol

Theorem that finding in a list works properly

proving Predicate logic with Isabelle

How to get ML values from HOL?

How to use OpenTheory to transfer theorems in HOL-light format to theorems in Isabelle format

Automatic translation from Isabelle/HOL to HOL

Why can&#39;t we do case analysis on inductively defined predicates *directly* when doing rule inversion?

How can we force Isabelle to reveal to us what rule it&#39;s applying in the background in Isar when a proof starts?

Why can&#39;t I make my cases explicit in Isabelle when the proof is already complete but gives a &quot;fails to refine any pending goal&quot; error?

Is it possible to write non-automatic formalizations in Isar?

How does one define a if then else expression in Isabelle?

View Proof Steps From Tactic Application

Isabelle: verify tautological formula

Isabelle/HOL/Isar: How do I make formulas like &quot;∃(x::nat). (x ≠ 2 ∧ (x ≠ 2 ⟶ x = 1))&quot; easier to prove?

Prove a goal with an assumption in HOL

HOL Theorem Prover: Adding to existing theory

Translating from HOL interpreter to TAC_PROOF with THENL

Theorem proving from first principles using SML with HOL inference rules

Exception on ACCEPT_TAC after THEN in HOL

Why can't we do case analysis on inductively defined predicates directly when doing rule inversion?

How can we force Isabelle to reveal to us what rule it's applying in the background in Isar when a proof starts?

Why can't I make my cases explicit in Isabelle when the proof is already complete but gives a "fails to refine any pending goal" error?

Isabelle/HOL/Isar: How do I make formulas like "∃(x::nat). (x ≠ 2 ∧ (x ≠ 2 ⟶ x = 1))" easier to prove?