Decidability and Definability Results Related to the Elementary Theory of Ordinal Multiplication

Fundamenta Mathematicae - Poland
doi 10.4064/fm171-3-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Mathematics, Polish Academy of Sciences

Related search

Decidability of Conversion for Type Theory in Type Theory

Proceedings of the ACM on Programming Languages
2018English

The Fundamental Laws of Addition and Multiplication in Elementary Algebra

Annals of Mathematics
UncertaintyStatisticsProbability
1906English

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results

English

Diophantine Definability and Decidability in Large Subrings of Totally Real Number Fields and Their Totally Complex Extensions of Degree 2

Journal of Number Theory
Number TheoryAlgebra
2002English

Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq

2018English

Dynamic Logic for Data-Aware Systems: Decidability Results

2017English

Completeness and Decidability Results for First-Order Clauses With Indices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Tree Automata Make Ordinal Theory Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory

Mathematics of Ramsey Theory
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy