{"title":"毕晓普式构造数学中的证明相关性","authors":"I. Petrakis","doi":"10.1017/S0960129522000159","DOIUrl":null,"url":null,"abstract":"Abstract Bishop’s presentation of his informal system of constructive mathematics BISH was on purpose closer to the proof-irrelevance of classical mathematics, although a form of proof-relevance was evident in the use of several notions of moduli (of convergence, of uniform continuity, of uniform differentiability, etc.). Focusing on membership and equality conditions for sets given by appropriate existential formulas, we define certain families of proof sets that provide a BHK-interpretation of formulas that correspond to the standard atomic formulas of a first-order theory, within Bishop set theory \n$(\\mathrm{BST})$\n , our minimal extension of Bishop’s theory of sets. With the machinery of the general theory of families of sets, this BHK-interpretation within BST is extended to complex formulas. Consequently, we can associate to many formulas \n$\\phi$\n of BISH a set \n${\\texttt{Prf}}(\\phi)$\n of “proofs” or witnesses of \n$\\phi$\n . Abstracting from several examples of totalities in BISH, we define the notion of a set with a proof-relevant equality, and of a Martin-Löf set, a special case of the former, the equality of which corresponds to the identity type of a type in intensional Martin-Löf type theory \n$(\\mathrm{MLTT})$\n . Through the concepts and results of BST notions and facts of MLTT and its extensions (either with the axiom of function extensionality or with Vooevodsky’s axiom of univalence) can be translated into BISH. While Bishop’s theory of sets is standardly understood through its translation to MLTT, our development of BST offers a partial translation in the converse direction.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Proof-relevance in Bishop-style constructive mathematics\",\"authors\":\"I. Petrakis\",\"doi\":\"10.1017/S0960129522000159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Bishop’s presentation of his informal system of constructive mathematics BISH was on purpose closer to the proof-irrelevance of classical mathematics, although a form of proof-relevance was evident in the use of several notions of moduli (of convergence, of uniform continuity, of uniform differentiability, etc.). Focusing on membership and equality conditions for sets given by appropriate existential formulas, we define certain families of proof sets that provide a BHK-interpretation of formulas that correspond to the standard atomic formulas of a first-order theory, within Bishop set theory \\n$(\\\\mathrm{BST})$\\n , our minimal extension of Bishop’s theory of sets. With the machinery of the general theory of families of sets, this BHK-interpretation within BST is extended to complex formulas. Consequently, we can associate to many formulas \\n$\\\\phi$\\n of BISH a set \\n${\\\\texttt{Prf}}(\\\\phi)$\\n of “proofs” or witnesses of \\n$\\\\phi$\\n . Abstracting from several examples of totalities in BISH, we define the notion of a set with a proof-relevant equality, and of a Martin-Löf set, a special case of the former, the equality of which corresponds to the identity type of a type in intensional Martin-Löf type theory \\n$(\\\\mathrm{MLTT})$\\n . Through the concepts and results of BST notions and facts of MLTT and its extensions (either with the axiom of function extensionality or with Vooevodsky’s axiom of univalence) can be translated into BISH. While Bishop’s theory of sets is standardly understood through its translation to MLTT, our development of BST offers a partial translation in the converse direction.\",\"PeriodicalId\":49855,\"journal\":{\"name\":\"Mathematical Structures in Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Structures in Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1017/S0960129522000159\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Structures in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/S0960129522000159","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Proof-relevance in Bishop-style constructive mathematics
Abstract Bishop’s presentation of his informal system of constructive mathematics BISH was on purpose closer to the proof-irrelevance of classical mathematics, although a form of proof-relevance was evident in the use of several notions of moduli (of convergence, of uniform continuity, of uniform differentiability, etc.). Focusing on membership and equality conditions for sets given by appropriate existential formulas, we define certain families of proof sets that provide a BHK-interpretation of formulas that correspond to the standard atomic formulas of a first-order theory, within Bishop set theory
$(\mathrm{BST})$
, our minimal extension of Bishop’s theory of sets. With the machinery of the general theory of families of sets, this BHK-interpretation within BST is extended to complex formulas. Consequently, we can associate to many formulas
$\phi$
of BISH a set
${\texttt{Prf}}(\phi)$
of “proofs” or witnesses of
$\phi$
. Abstracting from several examples of totalities in BISH, we define the notion of a set with a proof-relevant equality, and of a Martin-Löf set, a special case of the former, the equality of which corresponds to the identity type of a type in intensional Martin-Löf type theory
$(\mathrm{MLTT})$
. Through the concepts and results of BST notions and facts of MLTT and its extensions (either with the axiom of function extensionality or with Vooevodsky’s axiom of univalence) can be translated into BISH. While Bishop’s theory of sets is standardly understood through its translation to MLTT, our development of BST offers a partial translation in the converse direction.
期刊介绍:
Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.