Publisher： Cambridge University Press
E-ISSN： 1943-5886|68|1|17-34
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.68, Iss.1, 2003-03, pp. : 17-34
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Certain predicates defined by induction schemata
The Journal of Symbolic Logic, Vol. 18, Iss. 1, 1953-03 ,pp. :
Access to resources
Recommend
3.2. Semi-decidable or Negatively Semi-decidable Languages
Chaos and Complexity Letters, Vol. , Iss. , 2016-01 ,pp. :
A complete, decidable theory with two decidable models
The Journal of Symbolic Logic, Vol. 44, Iss. 3, 1979-09 ,pp. :
Decidable fragments of field theories
The Journal of Symbolic Logic, Vol. 55, Iss. 3, 1990-09 ,pp. :
Indiscernibles and decidable models
The Journal of Symbolic Logic, Vol. 48, Iss. 1, 1983-03 ,pp. :