Downward transfer of satisfiability for sentences of L 1,1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|48|4|1146-1150

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.48, Iss.4, 1983-12, pp. : 1146-1150

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

The Hanf number for complete L ω 1,ω -sentences (without GCH)

By  

The Journal of Symbolic Logic, Vol. 39, Iss. 3, 1974-09 ,pp. : 575-578

Cambridge University Press

Access to resources Recommend Favorite

Compactness and transfer for a fragment of L 2

By  

The Journal of Symbolic Logic, Vol. 42, Iss. 2, 1977-06 ,pp. : 261-268

Cambridge University Press

Access to resources Recommend Favorite

The Satisfiability Problem for Probabilistic Ordered Branching Programs

By Agrawal M.   Thierauf T.  

Theory of Computing Systems, Vol. 34, Iss. 5, 2001-10 ,pp. : 471-487

Springer Publishing Company

Access to resources Recommend Favorite

On the expressiveness of frame satisfiability and fragments of second-order logic

By  

The Journal of Symbolic Logic, Vol. 63, Iss. 1, 1998-03 ,pp. : 73-82

Cambridge University Press

Access to resources Recommend Favorite

Truth In V for ∃*∀∀-Sentences is Decidable

By  

The Journal of Symbolic Logic, Vol. 71, Iss. 4, 2006-12 ,pp. : 1200-1222

Cambridge University Press

Access to resources Recommend Favorite