找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Logic and Set Theory; Applying Formalized Jacob T. Schwartz,Domenico Cantone,Eugenio G. Omod Textbook 2011 Springer-Verlag L

[复制链接]
查看: 39847|回复: 37
发表于 2025-3-21 17:52:42 | 显示全部楼层 |阅读模式
书目名称Computational Logic and Set Theory
副标题Applying Formalized
编辑Jacob T. Schwartz,Domenico Cantone,Eugenio G. Omod
视频video
概述Presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz.Introduces an unique system for automated proof verification in large-scale software systems.With a Foreword by Prof. Martin
图书封面Titlebook: Computational Logic and Set Theory; Applying Formalized  Jacob T. Schwartz,Domenico Cantone,Eugenio G. Omod Textbook 2011 Springer-Verlag L
描述This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma.
出版日期Textbook 2011
关键词Automated Reasoning; Computer Systems; Program Verification Methods; Programming Logic
版次1
doihttps://doi.org/10.1007/978-0-85729-808-9
isbn_softcover978-1-4471-6018-2
isbn_ebook978-0-85729-808-9
copyrightSpringer-Verlag London Limited 2011
The information of publication is updating

书目名称Computational Logic and Set Theory影响因子(影响力)




书目名称Computational Logic and Set Theory影响因子(影响力)学科排名




书目名称Computational Logic and Set Theory网络公开度




书目名称Computational Logic and Set Theory网络公开度学科排名




书目名称Computational Logic and Set Theory被引频次




书目名称Computational Logic and Set Theory被引频次学科排名




书目名称Computational Logic and Set Theory年度引用




书目名称Computational Logic and Set Theory年度引用学科排名




书目名称Computational Logic and Set Theory读者反馈




书目名称Computational Logic and Set Theory读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:42:04 | 显示全部楼层
发表于 2025-3-22 04:01:37 | 显示全部楼层
发表于 2025-3-22 06:20:59 | 显示全部楼层
发表于 2025-3-22 12:46:20 | 显示全部楼层
Selbstaufhebung des Liberalismuse practical, while others are too specialized to serve often in ordinary mathematical discourse. The review of candidates begins with one of the most elementary but important decision procedures, the Davis–Putnam–Logemann–Loveland technique for deciding the validity of propositional formulae. The re
发表于 2025-3-22 16:49:24 | 显示全部楼层
Undecidability and Unsolvability,pter ends with a discussion on the ., whose addition to the axioms of set theory has direct practical interest: these in fact make the collection of proof mechanisms available to the verifier indefinitely extensible.
发表于 2025-3-22 19:29:24 | 显示全部楼层
发表于 2025-3-23 00:48:11 | 显示全部楼层
发表于 2025-3-23 01:31:15 | 显示全部楼层
发表于 2025-3-23 05:56:59 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-5 15:25
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表