Unifying Boolean and Algebraic Descriptive Complexity

Baptiste Chanus, Damiano Mazza, Morgan Rogers

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce ultrarings, which simultaneously generalize commutative rings and Boolean lextensive categories. As such, they allow to blend together standard algebraic notions (from commutative algebra) and logical notions (from categorical logic), providing a unifying descriptive framework in which complexity classes over arbitrary rings (as in the Blum, Schub, Smale model) and usual, Boolean complexity classes may be captured in a uniform way.

Original languageEnglish
Title of host publication10th International Conference on Formal Structures for Computation and Deduction, FSCD 2025
EditorsMaribel Fernandez
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773744
DOIs
Publication statusPublished - 7 Jul 2025
Externally publishedYes
Event10th International Conference on Formal Structures for Computation and Deduction, FSCD 2025 - Birmingham, United Kingdom
Duration: 14 Jul 202520 Jul 2025

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume337
ISSN (Print)1868-8969

Conference

Conference10th International Conference on Formal Structures for Computation and Deduction, FSCD 2025
Country/TerritoryUnited Kingdom
CityBirmingham
Period14/07/2520/07/25

Keywords

  • Blum-Shub-Smale complexity
  • Categorical logic
  • Descriptive complexity theory

Fingerprint

Dive into the research topics of 'Unifying Boolean and Algebraic Descriptive Complexity'. Together they form a unique fingerprint.

Cite this