265 search results - page 38 / 53 » Weakly Algebraizable Logics |
JUCS
2010
13 years 3 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
DAC
1996
ACM
14 years 22 days ago
1996
ACM
1 In this paper, we propose a hybrid approach for estimating the switching activities of the internal nodes in logic circuits. The new approach combines the advantages of the simul...
JSYML
2007
13 years 8 months ago
2007
The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to b...
KRDB
2003
13 years 10 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...