Mixing
![At what point does a decimal become negligible? [on hold]](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhZCTB4-bb-s-32SAm6ytjzFOU06cH9o8q-a_wq_UnH6lcd8hvws23CmBWHM6g256LzTX9yK1EiCCzTC1NSgtxlNk_J9hdr9bA3tD0Nqntbl521j4bLAm_uXPANuWLBhcCKTKzns2gaUodx/s72-c/1.jpg)
A truly rigorous textbook
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Does there exist a mathematical text that references a formal computer verified proof for every theorem it presents? I'm imagining a digital textbook that gives the higher level concepts in typical prose but also provides a means to examine each logical step in as much detail as desired. If not, is such a thing feasible or likely to be attempted?
education
asked Jul 17 at 3:03
user695931
1249
add a comment |Â
up vote
1
down vote
favorite
Does there exist a mathematical text that references a formal computer verified proof for every theorem it presents? I'm imagining a digital textbook that gives the higher level concepts in typical prose but also provides a means to examine each logical step in as much detail as desired. If not, is such a thing feasible or likely to be attempted?
education
asked Jul 17 at 3:03
user695931
1249
4
I imagine the answer is "no", as the level of detail of a computer-verified proof would have little to no practical value to a reader, and would likely be much harder to get through than a normal textbook. That being said, isa-afp.org is a database of computer-verified proofs that may be useful.
– NMister
Jul 17 at 3:10
@NMister I was kind of imagining something where the prose follows the formal proof at a high level and provides links to increasing detail that the reader can follow if a certain step needs clarification. They wouldn't have to read it at the finest detail, but it would be easily accessible if needed.
– user695931
Jul 17 at 3:19
1
The demand for formality strikes me as perhaps a more severe restriction than you would envision, but the book that comes to my mind is Homotopy Type Theory -- Univalent Foundations for Mathematics. It is available in printed form and in PDF downloads.
– hardmath
Jul 17 at 3:35
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Does there exist a mathematical text that references a formal computer verified proof for every theorem it presents? I'm imagining a digital textbook that gives the higher level concepts in typical prose but also provides a means to examine each logical step in as much detail as desired. If not, is such a thing feasible or likely to be attempted?
education
asked Jul 17 at 3:03
user695931
1249
Does there exist a mathematical text that references a formal computer verified proof for every theorem it presents? I'm imagining a digital textbook that gives the higher level concepts in typical prose but also provides a means to examine each logical step in as much detail as desired. If not, is such a thing feasible or likely to be attempted?
education
asked Jul 17 at 3:03
user695931
1249
asked Jul 17 at 3:03
user695931
1249
asked Jul 17 at 3:03
user695931
1249
asked Jul 17 at 3:03
user695931
1249
1249
4
I imagine the answer is "no", as the level of detail of a computer-verified proof would have little to no practical value to a reader, and would likely be much harder to get through than a normal textbook. That being said, isa-afp.org is a database of computer-verified proofs that may be useful.
– NMister
Jul 17 at 3:10
@NMister I was kind of imagining something where the prose follows the formal proof at a high level and provides links to increasing detail that the reader can follow if a certain step needs clarification. They wouldn't have to read it at the finest detail, but it would be easily accessible if needed.
– user695931
Jul 17 at 3:19
1
The demand for formality strikes me as perhaps a more severe restriction than you would envision, but the book that comes to my mind is Homotopy Type Theory -- Univalent Foundations for Mathematics. It is available in printed form and in PDF downloads.
– hardmath
Jul 17 at 3:35
add a comment |Â
4
I imagine the answer is "no", as the level of detail of a computer-verified proof would have little to no practical value to a reader, and would likely be much harder to get through than a normal textbook. That being said, isa-afp.org is a database of computer-verified proofs that may be useful.
– NMister
Jul 17 at 3:10
@NMister I was kind of imagining something where the prose follows the formal proof at a high level and provides links to increasing detail that the reader can follow if a certain step needs clarification. They wouldn't have to read it at the finest detail, but it would be easily accessible if needed.
– user695931
Jul 17 at 3:19
1
The demand for formality strikes me as perhaps a more severe restriction than you would envision, but the book that comes to my mind is Homotopy Type Theory -- Univalent Foundations for Mathematics. It is available in printed form and in PDF downloads.
– hardmath
Jul 17 at 3:35
4
4
I imagine the answer is "no", as the level of detail of a computer-verified proof would have little to no practical value to a reader, and would likely be much harder to get through than a normal textbook. That being said, isa-afp.org is a database of computer-verified proofs that may be useful.
– NMister
Jul 17 at 3:10
I imagine the answer is "no", as the level of detail of a computer-verified proof would have little to no practical value to a reader, and would likely be much harder to get through than a normal textbook. That being said, isa-afp.org is a database of computer-verified proofs that may be useful.
– NMister
Jul 17 at 3:10
@NMister I was kind of imagining something where the prose follows the formal proof at a high level and provides links to increasing detail that the reader can follow if a certain step needs clarification. They wouldn't have to read it at the finest detail, but it would be easily accessible if needed.
– user695931
Jul 17 at 3:19
@NMister I was kind of imagining something where the prose follows the formal proof at a high level and provides links to increasing detail that the reader can follow if a certain step needs clarification. They wouldn't have to read it at the finest detail, but it would be easily accessible if needed.
– user695931
Jul 17 at 3:19
1
1
The demand for formality strikes me as perhaps a more severe restriction than you would envision, but the book that comes to my mind is Homotopy Type Theory -- Univalent Foundations for Mathematics. It is available in printed form and in PDF downloads.
– hardmath
Jul 17 at 3:35
The demand for formality strikes me as perhaps a more severe restriction than you would envision, but the book that comes to my mind is Homotopy Type Theory -- Univalent Foundations for Mathematics. It is available in printed form and in PDF downloads.
– hardmath
Jul 17 at 3:35
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
2
down vote
Not a textbook but a blog article by Timothy Gowers discussing the ability for computers to write proofs to problems at the level of analysis 1. Here he says
"a few years ago I teamed up with a colleague of mine, Mohan Ganesalingam, to write a computer program to solve easy problems."
and then he goes on to discuss the process
Here's the link https://gowers.wordpress.com/2014/02/03/how-to-work-out-proofs-in-analysis-i/
answered Jul 17 at 3:11
john fowles
1,093817
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
Not a textbook but a blog article by Timothy Gowers discussing the ability for computers to write proofs to problems at the level of analysis 1. Here he says
"a few years ago I teamed up with a colleague of mine, Mohan Ganesalingam, to write a computer program to solve easy problems."
and then he goes on to discuss the process
Here's the link https://gowers.wordpress.com/2014/02/03/how-to-work-out-proofs-in-analysis-i/
answered Jul 17 at 3:11
john fowles
1,093817
add a comment |Â
up vote
2
down vote
Not a textbook but a blog article by Timothy Gowers discussing the ability for computers to write proofs to problems at the level of analysis 1. Here he says
"a few years ago I teamed up with a colleague of mine, Mohan Ganesalingam, to write a computer program to solve easy problems."
and then he goes on to discuss the process
Here's the link https://gowers.wordpress.com/2014/02/03/how-to-work-out-proofs-in-analysis-i/
answered Jul 17 at 3:11
john fowles
1,093817
add a comment |Â
up vote
2
down vote
up vote
2
down vote
Not a textbook but a blog article by Timothy Gowers discussing the ability for computers to write proofs to problems at the level of analysis 1. Here he says
"a few years ago I teamed up with a colleague of mine, Mohan Ganesalingam, to write a computer program to solve easy problems."
and then he goes on to discuss the process
Here's the link https://gowers.wordpress.com/2014/02/03/how-to-work-out-proofs-in-analysis-i/
answered Jul 17 at 3:11
john fowles
1,093817
Not a textbook but a blog article by Timothy Gowers discussing the ability for computers to write proofs to problems at the level of analysis 1. Here he says
"a few years ago I teamed up with a colleague of mine, Mohan Ganesalingam, to write a computer program to solve easy problems."
and then he goes on to discuss the process
Here's the link https://gowers.wordpress.com/2014/02/03/how-to-work-out-proofs-in-analysis-i/
answered Jul 17 at 3:11
john fowles
1,093817
answered Jul 17 at 3:11
john fowles
1,093817
answered Jul 17 at 3:11
john fowles
1,093817
answered Jul 17 at 3:11
john fowles
1,093817
1,093817
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2854095%2fa-truly-rigorous-textbook%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
4
I imagine the answer is "no", as the level of detail of a computer-verified proof would have little to no practical value to a reader, and would likely be much harder to get through than a normal textbook. That being said, isa-afp.org is a database of computer-verified proofs that may be useful.
– NMister
Jul 17 at 3:10
@NMister I was kind of imagining something where the prose follows the formal proof at a high level and provides links to increasing detail that the reader can follow if a certain step needs clarification. They wouldn't have to read it at the finest detail, but it would be easily accessible if needed.
– user695931
Jul 17 at 3:19
1
The demand for formality strikes me as perhaps a more severe restriction than you would envision, but the book that comes to my mind is Homotopy Type Theory -- Univalent Foundations for Mathematics. It is available in printed form and in PDF downloads.
– hardmath
Jul 17 at 3:35