OurBigBook
About
$
Donate
Sign in
Sign up
Finite character of formal proofs
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Foundations of mathematics
Mathematical logic
First-order logic
First-order theory
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Every
formal proof
is
a
finite string and therefore
uses
only finitely many of the available assumptions.
Ancestors
(7)
First-order theory
First-order logic
Mathematical logic
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(4)
Increasing union of deductively closed sets
Past exam of the mathematics course of the University of Cambridge
/
2017
/
iii
/
Paper 135
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ii
/
Paper 1
/
16G
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ii
/
Paper 1
/
16G
/
c
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version