Exact complexity bounds for ordinal addition

DOI10.1016/0304-3975(95)00221-9zbMATH Open0872.68118OpenAlexW2048865589MaRDI QIDQ671516FDOQ671516

Authors: Françoise Maurin 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00221-9

Recommendations

• scientific article; zbMATH DE number 2087209
• Tree Automata Make Ordinal Theory Easy
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
• Ehrenfeucht games and ordinal addition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Title not available (Why is that?)
• Weak Second‐Order Arithmetic and Finite Automata
• The complexity of logical theories
• The first order properties of products of algebraic systems
• Title not available (Why is that?)
• A uniform method for proving lower bounds on the computational complexity of logical theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The theory of integer multiplication with order restricted to primes is decidable

Cited In (4)

• Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
• Tree Automata Make Ordinal Theory Easy
• Tight bounds on expected time to add correctly and add mostly correctly
• Title not available (Why is that?)

This page was built for publication: Exact complexity bounds for ordinal addition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671516)