Question

How to prove this theorem in this hilbert system

score 198 · Answer 1 · 2026-02-23 12:04:01

198

Views

How to prove this theorem in this hilbert system

Published on 23 Feb 2026 - 12:04

score 106 · Answer 2 · 2021-11-20 18:22:46

106

Views

Natural deduction and introduction of universal quantifier

Published on 20 Nov 2021 - 18:22

score 111 · Answer 3 · 2026-02-23 22:19:28

111

Views

Clarification regarding substitution in sequent calculus

Published on 23 Feb 2026 - 22:19

score 59 · Answer 4 · 2021-12-04 16:58:38

59

Views

A simpler axiom for "induction" in untyped lambda calculus

Published on 04 Dec 2021 - 16:58

score 102 · Answer 5 · 2021-12-06 20:46:01

102

Views

Should you avoid using the same variable name after existential elimination?

Published on 06 Dec 2021 - 20:46

score 105 · Answer 6 · 2021-12-07 06:19:12

105

Views

How do I prove Separation Schema within ZFC?

Published on 07 Dec 2021 - 6:19

score 20 · Answer 7 · 2021-12-10 17:24:58

20

Views

What is the lower ordinal bound for the smallest fixed point of derivations with infinitary rules

Published on 10 Dec 2021 - 17:24

score 513 · Answer 8 · 2021-12-13 03:14:57

513

Views

⊢∃(⟹∀) using Hilbert-style proof

Published on 13 Dec 2021 - 3:14

score 122 · Answer 9 · 2021-12-15 15:02:27

122

Views

Q. Is there a formal definition of the word "rigorous"?

Published on 15 Dec 2021 - 15:02

score 156 · Answer 10 · 2021-12-16 06:00:55

156

Views

Reverse deduction theorem for predicate logic

Published on 16 Dec 2021 - 6:00

score 116 · Answer 11 · 2021-12-24 21:41:41

How to justify claims on the complexity of formal proofs without definitions, as described in "Type Theory and Formal Proof" by Nederpelt and Geuvers

score 33 · Answer 12 · 2022-01-05 15:40:01

33

Views

Showing that $\lim_{x\to c} f(x) > \alpha \Rightarrow f(c+h) > \alpha$ for $|h| < \delta $ where $\delta > 0 $

Published on 05 Jan 2022 - 15:40

score 57 · Answer 13 · 2026-03-28 20:05:35

57

Views

datebase of formal mathematics

Published on 28 Mar 2026 - 20:05

score 72 · Answer 14 · 2022-01-14 20:29:41

72

Views

Are any well known conjectures proved to be provable or falsifiable and yet not proved or falsified?

Published on 14 Jan 2022 - 20:29

score 211 · Answer 15 · 2022-01-19 04:29:48

211

Views

What exactly does it mean to make an intuitive argument rigorous?

Published on 19 Jan 2022 - 4:29

List Question

How to prove this theorem in this hilbert system

Natural deduction and introduction of universal quantifier

Clarification regarding substitution in sequent calculus

A simpler axiom for "induction" in untyped lambda calculus

Should you avoid using the same variable name after existential elimination?

How do I prove Separation Schema within ZFC?

What is the lower ordinal bound for the smallest fixed point of derivations with infinitary rules

⊢∃(⟹∀) using Hilbert-style proof

Q. Is there a formal definition of the word "rigorous"?

Reverse deduction theorem for predicate logic

How to justify claims on the complexity of formal proofs without definitions, as described in "Type Theory and Formal Proof" by Nederpelt and Geuvers

Showing that $\lim_{x\to c} f(x) > \alpha \Rightarrow f(c+h) > \alpha$ for $|h| < \delta $ where $\delta > 0 $

datebase of formal mathematics

Are any well known conjectures proved to be provable or falsifiable and yet not proved or falsified?

What exactly does it mean to make an intuitive argument rigorous?

Trending Questions

Popular # Hahtags

Popular Questions