Author: Freydenberger Dominik
Publisher: Springer Publishing Company
ISSN: 1432-4350
Source: Theory of Computing Systems, Vol.53, Iss.2, 2013-08, pp. : 159-193
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
The Journal of Symbolic Logic, Vol. 78, Iss. 4, 2013-12 ,pp. :
Some theorems on definability and decidability
The Journal of Symbolic Logic, Vol. 17, Iss. 3, 1952-09 ,pp. :
Prime models and almost decidability
The Journal of Symbolic Logic, Vol. 51, Iss. 2, 1986-06 ,pp. :
On the decidability of implicational ticket entailment
The Journal of Symbolic Logic, Vol. 78, Iss. 1, 2013-03 ,pp. :
Complexity, decidability and completeness
The Journal of Symbolic Logic, Vol. 71, Iss. 2, 2006-06 ,pp. :