{"id":"https://openalex.org/W1508864478","doi":"https://doi.org/10.1007/3-540-45842-5_6","title":"Constructive Reals in Coq: Axioms and Categoricity","display_name":"Constructive Reals in Coq: Axioms and Categoricity","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1508864478","doi":"https://doi.org/10.1007/3-540-45842-5_6","mag":"1508864478"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45842-5_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45842-5_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071639019","display_name":"Herman Geuvers","orcid":"https://orcid.org/0000-0003-2522-2980"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Herman Geuvers","raw_affiliation_strings":["Department of Computer Science, University of Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056082326","display_name":"Milad Niqui","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Milad Niqui","raw_affiliation_strings":["Department of Computer Science, University of Nijmegen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071639019"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9809,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.86607645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"79","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.8805122375488281},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.8643403053283691},{"id":"https://openalex.org/keywords/reverse-mathematics","display_name":"Reverse mathematics","score":0.6045958995819092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4882202446460724},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.4868111312389374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48477667570114136},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4683004915714264},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4661378264427185},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.44920387864112854},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4283788800239563},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41350215673446655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4003713130950928},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.28382617235183716},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2610381245613098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18121355772018433},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09070628881454468},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.07042858004570007}],"concepts":[{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.8805122375488281},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.8643403053283691},{"id":"https://openalex.org/C127753061","wikidata":"https://www.wikidata.org/wiki/Q2005236","display_name":"Reverse mathematics","level":3,"score":0.6045958995819092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4882202446460724},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.4868111312389374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48477667570114136},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4683004915714264},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4661378264427185},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.44920387864112854},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4283788800239563},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41350215673446655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4003713130950928},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.28382617235183716},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2610381245613098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18121355772018433},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09070628881454468},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.07042858004570007},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-45842-5_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45842-5_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/845ebb01-5608-4532-b77b-0773f3868b89","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/845ebb01-5608-4532-b77b-0773f3868b89","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Geuvers, J H & Niqui, M 2002, Constructive reals in Coq : axioms and categoricity. in P Callaghan, Z Luo, J McKinna & R Pollack (eds), Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers). Lecture Notes in Computer Science, vol. 2277, Springer, pp. 79-95. https://doi.org/10.1007/3-540-45842-5_6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.6910","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.6910","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ru.nl/~milad/publications/TYPES00.pdf","raw_type":"text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/845ebb01-5608-4532-b77b-0773f3868b89","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/845ebb01-5608-4532-b77b-0773f3868b89","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers), 79 - 95","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1504696707","https://openalex.org/W1553763224","https://openalex.org/W1560253649","https://openalex.org/W1598302926","https://openalex.org/W1601195943","https://openalex.org/W1602576468","https://openalex.org/W2015422016","https://openalex.org/W2034441209","https://openalex.org/W2407619777","https://openalex.org/W2490002303","https://openalex.org/W2798718690","https://openalex.org/W6630101114","https://openalex.org/W6635616823","https://openalex.org/W6820394604"],"related_works":["https://openalex.org/W1524804222","https://openalex.org/W2906661256","https://openalex.org/W2213028572","https://openalex.org/W3026697850","https://openalex.org/W2888810578","https://openalex.org/W4289666903","https://openalex.org/W1965882341","https://openalex.org/W1774729455","https://openalex.org/W2769609281","https://openalex.org/W2105747912"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}