1670 search results - page 41 / 334 » On Skolemization in constructive theories |
CIE
2005
Springer
14 years 3 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
ENTCS
2006
13 years 9 months ago
2006
This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible ...
HYBRID
2010
Springer
13 years 7 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
FOSSACS
2010
Springer
14 years 4 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...