Definability with a predicate for a semi-linear set

E-ISSN： 1943-5886|68|1|319-351

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.68, Iss.1, 2003-03, pp. : 319-351

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers

The Journal of Symbolic Logic, Vol. 54, Iss. 4, 1989-12 ,pp. : 1253-1287

Cambridge University Press

Access to resources Recommend Favorite

Definability in models of set theory

The Journal of Symbolic Logic, Vol. 45, Iss. 1, 1980-03 ,pp. : 9-19

Cambridge University Press

Access to resources Recommend Favorite

Definability and decidability issues in extensions of the integers with the divisibility predicate

The Journal of Symbolic Logic, Vol. 61, Iss. 2, 1996-06 ,pp. : 515-540

Cambridge University Press

Access to resources Recommend Favorite

Parametrices and Exact Paralinearization of Semi-Linear Boundary Problems

By Johnsen Jon

Communications in Partial Differential Equations, Vol. 33, Iss. 10, 2008-10 ,pp. : 1729-1787

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Persistent Properties of Solutions to Semi-Linear Schrodinger Equation

By Nahas J. Ponce G.

Communications in Partial Differential Equations, Vol. 34, Iss. 10, 2009-10 ,pp. : 1208-1227

Taylor & Francis Ltd

Access to resources Recommend Favorite