Categoricity results for \(L_{\infty \kappa}\)-free algebras (Q1104924): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(88)90049-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041529775 / rank
 
Normal rank

Revision as of 20:06, 19 March 2024

scientific article
Language Label Description Also known as
English
Categoricity results for \(L_{\infty \kappa}\)-free algebras
scientific article

    Statements

    Categoricity results for \(L_{\infty \kappa}\)-free algebras (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The paper under review is a compact collection of many interesting and important theorems with many corollaries, examples (the last section tells about concrete algebraic examples) and remarks on \(L_{\infty \kappa}\)-free algebras in a variety of universal algebras. The main results are very shortly described in the summary: ``Let V denote a variety of algebras in a countable language. An algebra is said to be \(L_{\infty \kappa}\)-free if it is Lloys Harrington's method of reindexing first used by Harrington to characterize the 1- section of the superjump. It turns out that the 1-section of R and \({}^ 2E\) is just large enough to contain winning strategies for every \(\Sigma\) \({}^ 0_ 3\)-game. The paper is technical, but accessible to readers familiar with higher type recursion theory.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    definability
    0 references
    \(L_{\infty \kappa }\)-free algebras
    0 references
    variety
    0 references
    reindexing
    0 references
    \(\Sigma ^ 0_ 3\)-game
    0 references
    higher type recursion theory
    0 references
    0 references