×

Found 3,019 Documents (Results 1–100)

100
MathJax

Logic and verification of product configuration in the automotive industry. (English) Zbl 07543891

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 387-408 (2022).
PDF BibTeX XML Cite
Full Text: DOI

The Braga method: extracting certified algorithms from complex recursive schemes in Coq. (English) Zbl 07543890

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 305-386 (2022).
PDF BibTeX XML Cite
Full Text: DOI

An Ad-Hoc semantics to study structural properties of types. (English) Zbl 07543889

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 267-303 (2022).
PDF BibTeX XML Cite
Full Text: DOI

Formal topology and univalent foundations. (English) Zbl 07543888

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 255-266 (2022).
PDF BibTeX XML Cite
Full Text: DOI

A uniform characterization of \(\Sigma_1\)-reflection over the fragments of Peano arithmetic. (English) Zbl 07543887

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 189-253 (2022).
PDF BibTeX XML Cite
Full Text: DOI

Generalized spaces for constructive algebra. (English) Zbl 07543886

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 99-187 (2022).
PDF BibTeX XML Cite
Full Text: DOI

From intuitionistic mathematics to point-free topology. (English) Zbl 07543885

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 55-98 (2022).
PDF BibTeX XML Cite
Full Text: DOI

Conceptions of proof from aristotle to Gentzen’s calculi. (English) Zbl 07543884

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 33-54 (2022).
PDF BibTeX XML Cite
Full Text: DOI

Proof and computation: perspectives for mathematics, computer science, and philosophy. (English) Zbl 07543883

Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 1-32 (2022).
PDF BibTeX XML Cite
Full Text: DOI

Proof nets for the Lambek calculus with one division and a negative-polarity modality for weakening. (English. Russian original) Zbl 07538686

J. Math. Sci., New York 262, No. 5, 759-766 (2022); translation from Fundam. Prikl. Mat. 23, No. 2, 247-257 (2020).
MSC:  03Bxx 03Fxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. (English) Zbl 1486.03009

Hackensack, NJ: World Scientific (ISBN 978-981-12-3647-1/hbk; 978-981-12-3649-5/ebook). xvi, 408 p. (2022).
PDF BibTeX XML Cite
Full Text: DOI

An algorithmic version of Zariski’s lemma. (English) Zbl 07495193

De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 469-482 (2021).
MSC:  14A25 03F65 12F05
PDF BibTeX XML Cite
Full Text: DOI

Advances in mathematical logic. Dedicated to the memory of Professor Gaisi Takeuti, SAML 2018. Selected, revised contributions based on the presentations at the symposium, Kobe, Japan, September 18–20, 2018. (English) Zbl 1479.03003

Springer Proceedings in Mathematics & Statistics 369. Singapore: Springer (ISBN 978-981-16-4172-5/hbk; 978-981-16-4173-2/ebook). xi, 229 p. (2021).
PDF BibTeX XML Cite
Full Text: DOI

Connecting sequent calculi with Lorenzen-style dialogue games. (English) Zbl 07465330

Heinzmann, Gerhard (ed.) et al., Paul Lorenzen – mathematician and logician. Contributions presented at the workshop, Konstanz, Germany, March 8–9, 2018. Cham: Springer. Log. Epistemol. Unity Sci. 51, 115-141 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Syntax for semantics: Krull’s maximal ideal theorem. (English) Zbl 07465328

Heinzmann, Gerhard (ed.) et al., Paul Lorenzen – mathematician and logician. Contributions presented at the workshop, Konstanz, Germany, March 8–9, 2018. Cham: Springer. Log. Epistemol. Unity Sci. 51, 77-102 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Lorenzen and constructive mathematics. (English) Zbl 07465326

Heinzmann, Gerhard (ed.) et al., Paul Lorenzen – mathematician and logician. Contributions presented at the workshop, Konstanz, Germany, March 8–9, 2018. Cham: Springer. Log. Epistemol. Unity Sci. 51, 47-61 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Foundations of constructive probability theory. (English) Zbl 07344237

Encyclopedia of Mathematics and its Applications 177. Cambridge: Cambridge University Press (ISBN 978-1-108-83543-5/hbk; 978-1-108-88401-3/ebook). xiii, 612 p. (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

On descriptional propositions in Ibn Sīnā: elements for a logical analysis. (English) Zbl 1473.03007

Mojtahedi, Mojtaba (ed.) et al., Mathematics, logic, and their philosophies. Essays in honour of Mohammad Ardeshir. Cham: Springer. Log. Epistemol. Unity Sci. 49, 411-431 (2021).
PDF BibTeX XML Cite
Full Text: DOI Link

Intuitionistic/constructive accounts of the continuum today. (English) Zbl 1467.03032

Shapiro, Stewart (ed.) et al., The history of continua. Philosophical and mathematical perspectives. Oxford: Oxford University Press. 476-501 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Isomorphism theorems for basic constructive algebraic structures with special emphasize on constructive semigroups with apartness – an overview. (English) Zbl 07392809

Silvestrov, Sergei (ed.) et al., Algebraic structures and applications. Selected papers based on the presentations at the international conference on stochastic processes and algebraic structures – from theory towards applications, SPAS 2017, Västerås and Stockholm, Sweden, October 4–6, 2017. Cham: Springer. Springer Proc. Math. Stat. 317, 653-686 (2020).
MSC:  20M15 03F65
PDF BibTeX XML Cite
Full Text: DOI

A constructive framework for teaching discrete mathematics. (English) Zbl 07285502

Kosheleva, Olga (ed.) et al., Beyond traditional probabilistic data processing techniques: interval, fuzzy etc. methods and their applications. Dedicated to Vladik Kreinovich on the occasion of his 65th birthday. Cham: Springer. Stud. Comput. Intell. 835, 21-46 (2020).
MSC:  68T37
PDF BibTeX XML Cite
Full Text: DOI

Spectral spaces versus distributive lattices: a dictionary. (English) Zbl 1440.03060

Facchini, Alberto (ed.) et al., Advances in rings, modules and factorizations. Selected papers based on the presentations at the international conference on rings and factorizations, Graz, Austria, February 19–23, 2018. Cham: Springer. Springer Proc. Math. Stat. 321, 223-245 (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Kreisel’s interests. On the foundations of logic and mathematics. Contributions of the conference, Salzburg, Austria, August 13–14, 2018. (English) Zbl 1456.03005

Tributes 41. London: College Publications (ISBN 978-1-84890-330-2). viii, 171 p. (2020).
PDF BibTeX XML Cite

Well-partial orderings and their maximal order types. (English) Zbl 07218748

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 351-391 (2020).
MSC:  03Fxx 03Exx 03Dxx
PDF BibTeX XML Cite
Full Text: DOI

A combinatorial bound for a restricted form of the termination theorem. (English) Zbl 07218746

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 321-338 (2020).
MSC:  03Bxx 03Fxx 05Dxx
PDF BibTeX XML Cite
Full Text: DOI

Well quasi-orders and the functional interpretation. (English) Zbl 07218744

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 221-269 (2020).
MSC:  03Fxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Upper bounds on the graph minor theorem. (English) Zbl 07218741

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 145-159 (2020).
MSC:  03Fxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

A course in constructive algebra. Translated from the English by Henri Lombardi and Stefan Neuwirth. (Un cours d’algèbre constructive.) (French) Zbl 1462.03003

Didactiques. Mathématiques. Besançon: Presses Universitaires de Franche-Comté (ISBN 978-2-84867-782-8/pbk). xii, 399 p. (2020).
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software