3047 search results - page 169 / 610 » On the Meaning of Logical Completeness |
126
Voted
JAPLL
2006
15 years 1 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
96
Voted
MLQ
2002
15 years 21 days ago
2002
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...
MEMICS
2010
14 years 7 months ago
2010
Recently, almost uncontrolled technological progress allows so called high-throughput data collection for sophisticated and complex experimental biological systems analysis. Espec...
100
click to vote
CADE
2006
Springer
16 years 1 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
102
Voted
ITC
1996
IEEE
15 years 5 months ago
1996
IEEE
This paper presents a low-overhead scheme for built-in self-test of circuits with scan. Complete (100%) fault coverage is obtained without modifying the function logic and without...