Computable categoricity for pseudo-exponential fields of \(\aleph_1\)

DOI10.1016/j.apal.2014.04.003zbMath1351.03022OpenAlexW2007185936MaRDI QIDQ2349103

Jesse Johnson

Publication date: 17 June 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2014.04.003

zbMATH Keywords

computable categoricitypseudo-exponentiation

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Categoricity and completeness of theories (03C35)

Related Items (1)

UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finitely presented exponential fields
• A note on the axioms for Zilber's pseudo-exponential fields
• Pseudo-exponentiation on algebraically closed fields of characteristic zero
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Exponential algebraicity in exponential fields
• L_A(Ⅎ)
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
• Quasiminimal structures and excellence
• The Arithmetical Hierarchy in the Setting of $\omega_1$
• The role of true finiteness in the admissible recursively enumerable degrees
• COVERS OF THE MULTIPLICATIVE GROUP OF AN ALGEBRAICALLY CLOSED FIELD OF CHARACTERISTIC ZERO
• Logic with the quantifier “there exist uncountably many”

This page was built for publication: Computable categoricity for pseudo-exponential fields of \(\aleph_1\)