z-logo
open-access-imgOpen Access
A computably stable structure with no Scott family of finitary formulas
Author(s) -
Peter Cholak,
Richard A. Shore,
Reed Solomon
Publication year - 2005
Publication title -
archive for mathematical logic
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 32
eISSN - 1432-0665
pISSN - 0933-5846
DOI - 10.1007/s00153-005-0326-7
Subject(s) - mathematics , finitary , countable set , discrete mathematics , halting problem , combinatorics , turing machine , algorithm , computation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom