971 search results - page 76 / 195 » Approximate Satisfiability and Equivalence |
95
Voted
APAL
2006
15 years 22 days ago
2006
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
88
Voted
CORR
2006
Springer
15 years 21 days ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
127
click to vote
LOGCOM
2008
15 years 19 days ago
2008
The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax s...
111
Voted
ORDER
2006
15 years 18 days ago
2006
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
85
Voted
SIAMDM
2008
15 years 17 days ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...