Titlebook: Automated Reasoning; 10th International J Nicolas Peltier,Viorica Sofronie-Stokkermans Conference proceedings 2020 Springer Nature Switzerl

Julienne

书目名称Automated Reasoning影响因子(影响力)




书目名称Automated Reasoning影响因子(影响力)学科排名




书目名称Automated Reasoning网络公开度




书目名称Automated Reasoning网络公开度学科排名




书目名称Automated Reasoning被引频次




书目名称Automated Reasoning被引频次学科排名




书目名称Automated Reasoning年度引用




书目名称Automated Reasoning年度引用学科排名




书目名称Automated Reasoning读者反馈




书目名称Automated Reasoning读者反馈学科排名

梯田

Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOLctures in addition to reasoning in algebraic structures. We present an approach for this using classes and locales with implicit carriers. This involves using function liftings to implement some aspects of dependent types and using embeddings of algebras to inherit theorems. We also formalise a theory of filters based on partial orders.

gene-therapy

使厌恶

Andrew Kakabadse,Nada KakabadseThis paper describes the design of the normalising tactic . for the Lean prover. This tactic improves on existing tactics by extending commutative rings with a binary exponent operator. An inductive family of types represents the normal form, enforcing various invariants. The design can also be extended with more operators.

CYN

https://doi.org/10.1057/978-1-349-94994-6A fundamental theorem states that every field admits an algebraically closed extension. Despite its central importance, this theorem has never before been formalised in a proof assistant. We fill this gap by documenting its formalisation in Isabelle/HOL, describing the difficulties that impeded this development and their solutions.

flimsy

Abrupt

高调

Algebraically Closed Fields in Isabelle/HOLA fundamental theorem states that every field admits an algebraically closed extension. Despite its central importance, this theorem has never before been formalised in a proof assistant. We fill this gap by documenting its formalisation in Isabelle/HOL, describing the difficulties that impeded this development and their solutions.

irreparable

Formalization of Forcing in Isabelle/ZFWe formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ., we construct a proper generic extension and show that the latter also satisfies .. In doing so, we remodularized Paulson’s . library.

玩笑