×

Found 6,525 Documents (Results 1–100)

Lower bounds on \(\beta (\alpha)\). (English) Zbl 07627918

Berger, Ulrich (ed.) et al., Revolutions and revelations in computability. 18th conference on computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13359, 64-73 (2022).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Election in fully anonymous shared memory systems: tight space bounds and algorithms. (English) Zbl 07615857

Parter, Merav (ed.), Structural information and communication complexity. 29th international colloquium, SIROCCO 2022, Paderborn, Germany, June 27–29, 2022, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13298, 174-190 (2022).
MSC:  68Mxx 68Q11 68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Caculability anthology. Birth and development of the theory of computability from the 1920s to the 1970s. Historical introduction by Serge Grigorieff. (Anthologie de la caculabilité. Naissance et développements de la théorie de la calculabilité des années 1920 à 1970. Introduction historique par Serge Grigorieff.) (French) Zbl 1496.03009

Paris: Cassini (ISBN 978-2-84225-094-2/hbk). xvi, 798 p. (2022).
PDF BibTeX XML Cite

Between Turing and Kleene. (English) Zbl 07551724

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 281-300 (2022).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI arXiv

Betwixt Turing and Kleene. (English) Zbl 07551721

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 236-252 (2022).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI arXiv

The isomorphism problem for FST injection structures. (English) Zbl 07551709

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 25-36 (2022).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

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 Link

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

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 arXiv

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

Uniformly computably separable algebras with effectively splittable families of negative congruences. (English. Russian original) Zbl 07538031

Sib. Math. J. 63, No. 3, 466-475 (2022); translation from Sib. Mat. Zh. 63, No. 3, 562-575 (2022).
MSC:  03Dxx 03Cxx 08Axx
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software