2 search results - page 1 / 1 » Effectively inseparable Boolean algebras in lattices of sent... |
90
Voted
AML
2010
15 years 20 days ago
2010
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
102
click to vote
ISCI
2008
15 years 16 days ago
2008
The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical sc...