A Lopez-Escobar Theorem for Continuous Domains

Journal of Symbolic Logic:1-18 (forthcoming)
  Copy   BIBTEX

Abstract

We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let $Mod(\tau )$ be the set of countable structures with universe $\omega $ in vocabulary $\tau $ topologized by the Scott topology. We show that an invariant set $X\subseteq Mod(\tau )$ is $\Pi ^0_\alpha $ in the Borel hierarchy of this topology if and only if it is definable by a $\Pi ^p_\alpha $ -formula, a positive $\Pi ^0_\alpha $ formula in the infinitary logic $L_{\omega _1\omega }$. As a corollary of this result we obtain a new pullback theorem for positive computable embeddings: Let $\mathcal {K}$ be positively computably embeddable in $\mathcal {K}'$ by $\Phi $, then for every $\Pi ^p_\alpha $ formula $\xi $ in the vocabulary of $\mathcal {K}'$ there is a $\Pi ^p_\alpha $ formula $\xi ^{*}$ in the vocabulary of $\mathcal {K}$ such that for all $\mathcal {A}\in \mathcal {K}$, $\mathcal {A}\models \xi ^{*}$ if and only if $\Phi (\mathcal {A})\models \xi $. We use this to obtain new results on the possibility of positive computable embeddings into the class of linear orderings.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Models Omitting Given Complete Types.Akito Tsuboi - 2008 - Notre Dame Journal of Formal Logic 49 (4):393-399.
On a Theorem of J. I. Malitz.E. G. K. Lopez-Escobar - 1970 - Journal of Symbolic Logic 35 (4):586-586.
A Non-Interpolation Theorem.E. G. K. Lopez-Escobar - 1975 - Journal of Symbolic Logic 40 (3):457-458.

Analytics

Added to PP
2024-03-16

Downloads
8 (#1,299,968)

6 months
8 (#347,703)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.

View all 13 references / Add more references