Arithmetical algorithms for elementary patterns

DOI10.1007/S00153-014-0404-9zbMath1354.03088OpenAlexW2079139533MaRDI QIDQ2257107

Samuel A. Alexander

Publication date: 23 February 2015

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-014-0404-9

zbMATH Keywords

ordinal arithmeticordinal notation systemspatterns of resemblance

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Related Items (2)

Pure \(\Sigma_2\)-elementarity beyond the core ⋮ A Glimpse of $$ \sum_{3} $$-elementarity

Cites Work

• Unnamed Item
• The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity
• Patterns of resemblance of order 2
• Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
• Ordinal arithmetic and \(\Sigma_1\)-elementarity
• Decidability and definability results related to the elementary theory of ordinal multiplication
• Assignment of ordinals to patterns of resemblance
• Normal forms for elementary patterns
• Elementary patterns of resemblance

This page was built for publication: Arithmetical algorithms for elementary patterns