Functional trees and automorphisms of models

DOI10.1007/BF02260926MaRDI QIDQ1317640zbMATH OpenOpenAlexFDO

Publication date 12 April 1994

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02260926

automorphisms of models functional trees hyperarithmetical automorphisms infinite branch recursive model reducibility rigid models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Review text

An algorithmic construction is described which transforms functional trees into models such that these models are rigid if and only if the tree possesses an infinite branch. As a consequence of this, a series of results like ``\(\{n\mid R_ n\) is rigid\} is a \(\Pi_ 1^ 1\)-complete set are proved, where \(R_ n\) is some very natural enumeration of r.e. binary predicates. Methodologically we obtain that some results on functional trees may be interpreted in terms of automorphisms of models; for example, a recursive model is constructed each of whose hyperarithmetic copies has no hyperarithmetical automorphisms, but whose automorphism group has power \(2^ \omega\).

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Functional trees and automorphisms of models

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